Sciweavers

DCG
2008
86views more  DCG 2008»
13 years 11 months ago
Reconstruction Using Witness Complexes
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
Leonidas J. Guibas, Steve Oudot
DCG
2008
132views more  DCG 2008»
13 years 11 months ago
Ehrhart Series and Lattice Triangulations
Abstract We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials o...
Sam Payne
DCG
2008
68views more  DCG 2008»
13 years 11 months ago
Neighborly Embedded Manifolds
Gil Kalai, Avi Wigderson
DCG
2008
82views more  DCG 2008»
13 years 11 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
DCG
2008
79views more  DCG 2008»
13 years 11 months ago
Automorphisms and Distinguishing Numbers of Geometric Cliques
Michael O. Albertson, Debra L. Boutin
DCG
2008
86views more  DCG 2008»
13 years 11 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
DCG
2008
69views more  DCG 2008»
13 years 11 months ago
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
Saugata Basu, Thierry Zell
DCG
2008
82views more  DCG 2008»
13 years 11 months ago
Visibility Graphs of Point Sets in the Plane
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
Florian Pfender