947 search results - page 111 / 190 » Discrete Geometry |
120
Voted
COMPGEOM
2009
ACM
15 years 10 months 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...
118
click to vote
COMPGEOM
2009
ACM
15 years 10 months 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...
118
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
109
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
124
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...