56
Voted
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
COMGEO
2004
ACM
14 years 10 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...
56
Voted
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
86
Voted
COMGEO
2004
ACM
14 years 10 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 ...
66
Voted
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
Let
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
87
Voted
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
91
Voted
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.