Sciweavers

DCG
2008
110views more  DCG 2008»
13 years 4 months ago
An Inscribing Model for Random Polytopes
For convex bodies K with C2 boundary in Rd, we explore random polytopes with vertices chosen along the boundary of K. In particular, we determine asymptotic properties of the volum...
Ross M. Richardson, Van H. Vu, Lei Wu
DCG
2008
69views more  DCG 2008»
13 years 4 months ago
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D
Pankaj K. Agarwal, Rolf Klein, Christian Knauer, S...
DCG
2008
74views more  DCG 2008»
13 years 4 months ago
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls
We prove Helly-type theorems for line transversals to disjoint unit balls in Rd . In particular, we show that a family of n 2d disjoint unit balls in Rd has a line transversal if,...
Otfried Cheong, Xavier Goaoc, Andreas Holmsen, Syl...
DCG
2008
110views more  DCG 2008»
13 years 4 months ago
A Centrally Symmetric Version of the Cyclic Polytope
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces...
Alexander I. Barvinok, Isabella Novik
DCG
2008
104views more  DCG 2008»
13 years 4 months ago
Finding the Homology of Submanifolds with High Confidence from Random Samples
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Partha Niyogi, Stephen Smale, Shmuel Weinberger
DCG
2008
93views more  DCG 2008»
13 years 4 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
DCG
2008
118views more  DCG 2008»
13 years 4 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
DCG
2008
90views more  DCG 2008»
13 years 4 months ago
Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
Louis J. Billera, Samuel K. Hsiao, J. Scott Provan
DCG
2008
93views more  DCG 2008»
13 years 4 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
DCG
2008
77views more  DCG 2008»
13 years 4 months ago
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
We prove that for d 3, the 1-skeleton of any (d - 1)-dimensional doubly Cohen-Macaulay (abbreviated 2-CM) complex is generically drigid. This implies that Barnette's lower b...
Eran Nevo