Sciweavers

42 search results - page 3 / 9
» compgeom 2009
Sort
View
93
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Diameter of polyhedra: limits of abstraction
of Polyhedra: Limits of Abstraction Friedrich Eisenbrand∗ Nicolai Hähnle† Alexander Razborov‡ Thomas Rothvoß§ September 25, 2009 tigate the diameter of a natural abstract...
Friedrich Eisenbrand, Nicolai Hähnle, Thomas ...
COMPGEOM
2009
ACM
15 years 10 months ago
Halving lines and measure concentration in the plane
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, â„...
Rom Pinchasi
155
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Binary plane partitions for disjoint line segments
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...
Csaba D. Tóth
124
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Quadrilateral meshes with bounded minimum angle
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...
Scott Hine, F. Betul Atalay, Dianna Xu, Suneeta Ra...
118
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...