COMPGEOM
1993
ACM
15 years 5 months ago
1993
ACM
112
Voted
COMPGEOM
1993
ACM
15 years 5 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
98
Voted
COMPGEOM
1993
ACM
15 years 5 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
COMPGEOM
1993
ACM
15 years 5 months ago
1993
ACM
COMPGEOM
1993
ACM
15 years 5 months ago
1993
ACM
111
Voted
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
106
Voted
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
103
Voted
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
100
Voted
COMPGEOM
1996
ACM
15 years 5 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...