13 search results - page 2 / 3 » compgeom 1996 |
COMPGEOM
1996
ACM
13 years 9 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
13 years 9 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...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
Given a simple arrangementof n pseudolines in the Euclidean plane, associate with line i the list i of the lines crossing i in the order of the crossings on line i. i = ( i 1; i 2;...
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...