127
click to vote
COMPGEOM
15 years 1 months ago
2007 ACM 
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
COMPGEOM
15 years 4 months ago
2007 ACM 
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
103
click to vote
COMPGEOM
15 years 4 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...
COMPGEOM
15 years 4 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...
100
click to vote
COMPGEOM
15 years 4 months ago
2007 ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
|
Discrete Geometry