COMPGEOM
2007
ACM
13 years 6 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
2007
ACM
13 years 8 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...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 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...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devis...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...