COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
COMPGEOM
1991
ACM
13 years 8 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
COMPGEOM
1991
ACM
13 years 8 months ago
1991
ACM
Given a set of points in the plane, a crossing family is a collection of line segments, each joining two of the points, such that any two line segments intersect internally. Two s...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
The treatment of curved algebraic surfaces becomes more and more the focus of attention in Computational Geometry. We present a video that illustrates the computation of the conve...
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
CA
1996
IEEE
13 years 9 months ago
1996
IEEE
We present efficient and accurate algorithms for interference detection among objects undergoing polynomial deformation. The scope of our algorithms include physically-based model...
DAWAK
2001
Springer
13 years 9 months ago
2001
Springer
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...
ICPP
2002
IEEE
13 years 10 months ago
2002
IEEE
We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and c...