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 …

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 …

The Voronoi diagram of a set of sites partitions space into regions, one per site; the region
for a site s consists of all points closer to s than to any other site. The dual of the Voronoi …

Davenport Schinzel sequences are sequences that do not contain forbidden alternating
subsequences of certain length. They are a powerful combinatorial tool applicable in …

The intended audience of this book (and the combined two volumes especially) is quite
broad. It can be used in a variety of computer graphics courses or by those who are trying to …

This paper addresses the problem of computing stable grasps of 2-D polygonal objects. We
consider the case of a hand equipped with three hard fingers and assume point contact with …

This article addresses the problem of computing stable grasps of three-dimensional
polyhedral objects. We consider the case of a hand equipped with four hard fingers and …

Traditional vector-based GIS organize basic objects of interest such as roads, rivers, towns,
or houses in thematic multi-layered (polygonal) maps representing them as polygons, arcs …

Probabilistic, or randomized, algorithms are fast becoming as commonplace as conventional
deterministic algorithms. This survey presents five techniques that have been widely used in …

We prove four results on randomized incremental constructions(RICs):● an analysis of the
expected behavior under insertion and deletions,● a fully dynamic data structure for convex …