26 search results - page 4 / 6 » comgeo 2004 |
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
We present a new algorithm for automatically solving jigsaw puzzles byshapealone.Thealgorithm cansolvemore difficult puzzlesthan couldbesolved before, without the use of backtracki...
COMGEO
2004
ACM
14 years 11 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
14 years 11 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
14 years 11 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...
106
click to vote
COMGEO
2004
ACM
14 years 11 months ago
2004
ACM
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...