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
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
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
COMPGEOM
1996
ACM
13 years 9 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...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
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
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
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...