Sciweavers

Share
COMPGEOM
1996
ACM
9 years 8 months ago
Robust Adaptive Floating-Point Geometric Predicates
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...
Jonathan Richard Shewchuk
COMPGEOM
1996
ACM
9 years 8 months ago
Smallest Enclosing Cylinders
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...
Elmar Schömer, Jürgen Sellen, Marek Teic...
COMPGEOM
1996
ACM
9 years 8 months ago
Enumeration of Regular Triangulations
Tomonari Masada, Hiroshi Imai, Keiko Imai
COMPGEOM
1996
ACM
9 years 8 months ago
Flipping Edges in Triangulations
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...
Ferran Hurtado, Marc Noy, Jorge Urrutia
COMPGEOM
1996
ACM
9 years 8 months ago
Approximating Shortest Paths on a Convex Polytope in Three Dimensions
Sariel Har-Peled, Micha Sharir, Kasturi R. Varadar...
COMPGEOM
1996
ACM
9 years 8 months ago
On the Number of Arrangements of Pseudolines
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;...
Stefan Felsner
COMPGEOM
1996
ACM
9 years 8 months ago
New Lower Bounds for Convex Hull Problems in Odd Dimensions
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 ...
Jeff Erickson
COMPGEOM
1996
ACM
9 years 8 months ago
Linear Complexity Hexahedral Mesh Generation
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...
David Eppstein
COMPGEOM
1996
ACM
9 years 8 months ago
Convex Drawings of Graphs in Two and Three Dimensions (Preliminary Version)
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-...
Marek Chrobak, Michael T. Goodrich, Roberto Tamass...
books