COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
of Polyhedra: Limits of Abstraction Friedrich Eisenbrand∗ Nicolai Hähnle† Alexander Razborov‡ Thomas Rothvoߧ September 25, 2009 tigate the diameter of a natural abstract...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
Given a set of n points in the plane and a collection of k halving lines of P ℓ1, . . . , ℓk indexed according to the increasing order of their slopes, we denote by d(ℓj, ...
COMPGEOM
2009
ACM
14 years 1 months 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...
COMPGEOM
2009
ACM
14 years 1 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...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
COMPGEOM
2009
ACM
14 years 1 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 ...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly cr...