COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
COMGEO
2004
ACM
13 years 8 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...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
ded abstract of this chapter appeared as: Herman J. Haverkort, Mark de Berg and Joachim Gudmundsson: Box-trees for collision checking in industrial installations, in Proc. 18th ACM...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
COMGEO
2004
ACM
13 years 8 months ago
2004
ACM
COMGEO
2004
ACM
13 years 8 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
13 years 8 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
COMGEO
2004
ACM
13 years 8 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 8 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 8 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...