An algorithm for computing the Euclidean distance between a pair of convex sets in R/sup
m/is described. Extensive numerical experience with a broad family of polytopes in R/sup …

Spatial data mining is the discovery of interesting relationships and characteristics that may
exist implicitly in spatial databases. To this end, this paper has three main contributions …

Collision detection is of paramount importance for many applications in computer graphics
and visualization. Typically, the input to a collision detection algorithm is a large number of …

Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs
(sometimes called connectivity or topology) of three-dimensional triangle meshes …

A typical range-searching problem has the following form: Pre-process a set S of points in R*
so that the points of S lying inside a query region can be reported or counted quickly. We …

Computational Geometry is an area that provides solutions to geometric problems which
arise in applications including Geographic Information Systems, Robotics and Computer …

A simple and e cient algorithm for nding the closest points between two convex polyhedra is
described here. Data from numerous experiments tested on a broad set of convex polyhedra …

We construct smooth parameterizations of irregular connectivity triangulations of arbitrary
genus 2-manifolds. Our algorithm uses hierarchical simplification to efficiently induce a …

The heart of any system that simulates the physical interaction between objects is collision
detection-the ability to detect when two objects have come into contact. This system is also …

We generalize basic signal processing tools such as downsampling, upsampling, and filters
to irregular connectivity triangle meshes. This is accomplished through the design of a non …