Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it ...
Read More
Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa- tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con- structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com- binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
Read Less
Add this copy of Algorithms in Combinatorial Geometry to cart. $94.97, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 2004 by Springer.
Add this copy of Algorithms in Combinatorial Geometry to cart. $102.93, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2011 by Springer.
Add this copy of Algorithms in Combinatorial Geometry to cart. $112.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1987 by Springer.
Add this copy of Algorithms in Combinatorial Geometry (Hb 1987) to cart. $113.63, new condition, Sold by Books International rated 3.0 out of 5 stars, ships from Toronto, ON, CANADA, published 1987 by Springer.
Add this copy of Algorithms in Combinatorial Geometry to cart. $122.45, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 1987 by Springer.
Add this copy of Algorithms in Combinatorial Geometry (Monographs in to cart. $136.96, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 1987 by Springer.
Add this copy of Algorithms in Combinatorial Geometry (Hb 1987) to cart. $139.23, new condition, Sold by Books International rated 3.0 out of 5 stars, ships from Toronto, ON, CANADA, published 1987 by Springer.
Add this copy of Algorithms in Combinatorial Geometry (E a T C S to cart. $141.59, new condition, Sold by GridFreed rated 5.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 2004 by Springer Verlag.
Add this copy of Algorithms in Combinatorial Geometry (E a T C S to cart. $166.61, new condition, Sold by GridFreed rated 5.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 2004 by Springer Verlag.
