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

A tutorial survey is presented of the quadtree and related hierarchical data structures. They
are based on the principle of recursive decomposition. The emphasis is on the …

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 newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

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 …

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 following problem is discussed: given n points in the plane (the sites) and an arbitrary
query point q, find the site that is closest to q. This problem can be solved by constructing the …

We present an algorithm for determining the shortest path between a source and a
destination on an arbitrary (possibly nonconvex) polyhedral surface. The path is constrained …

Do you spend too much time creating the building blocks of your graphics applications or
finding and correcting errors? Geometric Tools for Computer Graphics is an extensive …

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 …