Sciweavers

COMPGEOM
1993
ACM
14 years 19 days ago
An Incremental Algorithm for Betti Numbers of Simplicial Complexes
Cecil Jose A. Delfinado, Herbert Edelsbrunner
COMPGEOM
1993
ACM
14 years 19 days ago
Approximating Center Points with Iterated Radon Points
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...
Kenneth L. Clarkson, David Eppstein, Gary L. Mille...
COMPGEOM
1993
ACM
14 years 19 days ago
Worst-Case Bounds for Subadditive Geometric Graphs
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 ...
Marshall W. Bern, David Eppstein
COMPGEOM
1993
ACM
14 years 19 days ago
Can Visibility Graphs be Represented Compactly?
Pankaj K. Agarwal, Noga Alon, Boris Aronov, Subhas...
COMPGEOM
1996
ACM
14 years 21 days 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
14 years 21 days 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
14 years 21 days ago
Enumeration of Regular Triangulations
Tomonari Masada, Hiroshi Imai, Keiko Imai
COMPGEOM
1996
ACM
14 years 21 days 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