143
Voted
COMPGEOM
2007
ACM
15 years 9 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...
141
Voted
COMPGEOM
2007
ACM
15 years 9 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 ...
140
Voted
COMPGEOM
2007
ACM
15 years 9 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...
133
Voted
COMPGEOM
2007
ACM
15 years 9 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...
93
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM