COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
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 ...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
Let