Computational geometry is concerned with the design and analysis of algorithms for
geometrical problems. In addition, other more practically oriented, areas of computer …

Voronoi diagrams partition space according to the influence certain sites exert on their
environment. Since the 17th century, such structures play an important role in many areas …

This well-accepted introduction to computational geometry is a textbook for high-level
undergraduate and low-level graduate courses. The focus is on algorithms and hence the …

This is the newly revised and expanded edition of the popular introduction to the design and
implementation of geometry algorithms arising in areas such as computer graphics, robotics …

The field of computational geometry is a relatively recent addition to the mathematical
landscape. Over the past ten years, a substantial number of papers and technical reports in …

This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

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 …

The power pow (x,s) of a point x with respect to a sphere s in Euclidean d-space E^d is given
by d^2(x,z)-r^2, where d denotes the Euclidean distance function, and z and r are the center …

Random sampling is used for several new geometric algorithms. The algorithms are “Las
Vegas,” and their expected bounds are with respect to the random behavior of the …

The topic of this chapter, Voronoi diagrams, differs from other areas of computational
geometry, in that its origin dates back to the 17th century. In his book on the principles of …