Sciweavers

110
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
On the exact maximum complexity of Minkowski sums of convex polyhedra
Efi Fogel, Dan Halperin, Christophe Weibel
130
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
Traversing a set of points with a minimum number of turns
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, F...
119
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
A space-optimal data-stream algorithm for coresets in the plane
Given a point set P R2 , a subset Q P is an -kernel of P if for every slab W containing Q, the (1+)-expansion of W also contains P. We present a data-stream algorithm for mainta...
Pankaj K. Agarwal, Hai Yu
91
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
Decomposition of multiple coverings into many parts
János Pach, Géza Tóth
86
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
Computing the volume of the union of cubes
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir