20 search results - page 2 / 4 » compgeom 2000 |
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
We present fast implementations of a hybrid algorithm for reporting box and cube intersections. Our algorithm initially takes a divide-and-conquer approach and switches to simpler...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
The regression depth of a hyperplane with respect to a set of n points in Rd is the minimum number of points the hyperplane must pass through in a rotation to vertical. We general...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
For a sufficiently dense set of points in any closed Riemannian manifold, we prove that a unique Delannay triangulation exists. This triangulation has the same properties as in Eu...