Sciweavers

COMGEO
2004
ACM
13 years 11 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir
COMGEO
2004
ACM
13 years 11 months ago
Tiling space and slabs with acute tetrahedra
We show it is possible to tile three-dimensional space using only tetrahedra with acute dihedral angles. We present several constructions to achieve this, including one in which a...
David Eppstein, John M. Sullivan, Alper Üng&o...
COMGEO
2004
ACM
13 years 11 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
COMGEO
2004
ACM
13 years 11 months ago
Proximate point searching
Erik D. Demaine, John Iacono, Stefan Langerman
COMGEO
2004
ACM
13 years 11 months ago
Conforming Delaunay triangulations in 3D
David Cohen-Steiner, Éric Colin de Verdi&eg...
COMGEO
2004
ACM
13 years 11 months ago
Rotationally optimal spanning and Steiner trees in uniform orientation metrics
Marcus Brazil, Benny K. Nielsen, Pawel Winter, Mar...
COMGEO
2004
ACM
13 years 11 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
COMGEO
2004
ACM
13 years 11 months ago
Approximating geometric bottleneck shortest paths
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, ...
COMGEO
2004
ACM
13 years 11 months ago
Kinetic collision detection between two simple polygons
We design a kinetic data structure for detecting collisions between two simple polygons in motion. In order to do so, we create a planar subdivision of the free space between the ...
Julien Basch, Jeff Erickson, Leonidas J. Guibas, J...
COMGEO
2004
ACM
13 years 11 months ago
Ordered theta graphs
Let
Prosenjit Bose, Joachim Gudmundsson, Pat Morin