42 search results - page 5 / 9 » compgeom 2009 |
144
click to vote
COMPGEOM
2009
ACM
16 years 9 days ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
184
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
154
click to vote
COMPGEOM
2009
ACM
16 years 9 days ago
2009
ACM
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
168
Voted
COMPGEOM
2009
ACM
16 years 9 days ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...
162
Voted
COMPGEOM
2009
ACM
16 years 9 days ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...