156
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
130
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
108
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
A finite planar point set P is called a magic configuration if there is an assignment of positive weights to the points of P such that, for every line l determined by P, the sum o...
149
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
