The field of multidimensional data structures is large and growing very quickly. Here, for the
first time, is a thorough treatment of multidimensional point data, object and image-based …

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 …

We survey the computational geometry relevant to finite element mesh generation. We
especially focus on optimal triangulations of geometric domains in two-and three …

Map compilation, or conflation, is now being accomplished by computer. Interactive routines
manipulate the graphic images of two different digital maps of the same region in order to …

Triangulations in CGAL* Page 1 Triangulations in CGAL* [Extended Abstract] Jean Daniel
Boissonnat Olivier Devillers Monique Teillaud INRIA BP93 06902 Sophia Antipolis, France …

A mesh is a discretization of a geometric domain into small simple shapes, such as triangles
or quadrilaterals in two dimensions and tetrahedra or hexahedra in three. Meshes find use …

A sliver is a tetrahedon whose four vertices lie close to a plane and whose orthogonal
projection to that plane is a convex quadrilateral with no short edge. Slivers are notoriously …

Building generalization is a difficult operation due to the complexity of the spatial distribution
of buildings and for reasons of spatial recognition. In this study, building generalization is …

In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments
that constrain the edges of the triangulation, while still maintaining most of the favorable …