COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We present a continuous submetric deformation of the surface of the cube which increases the enclosed volume by about 25.67%. Categories and Subject Descriptors: I.3.5 [Computatio...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We prove an optimal generalization of the centerpoint theorem: given a set P of n points in the plane, there exist two points (not necessarily among input points) that hit all con...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 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 ...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 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...