COMGEO
2004
ACM
13 years 11 months ago
2004
ACM
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
COMGEO
2004
ACM
13 years 11 months ago
2004
ACM
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
COMGEO
2004
ACM
13 years 11 months ago
2004
ACM
COMGEO
2004
ACM
13 years 11 months ago
2004
ACM
COMGEO
2004
ACM
13 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...
COMGEO
2004
ACM
13 years 11 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 11 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 11 months ago
2004
ACM
COMGEO
2004
ACM
13 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
13 years 11 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...