DCG
2008
13 years 4 months ago
2008
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...
DCG
2008
13 years 4 months ago
2008
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...
DCG
2008
13 years 4 months ago
2008
DCG
2008
13 years 4 months ago
2008
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...
DCG
2008
13 years 4 months ago
2008
DCG
2008
13 years 4 months ago
2008
DCG
2008
13 years 4 months ago
2008
DCG
2008
13 years 4 months ago
2008
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...
DCG
2008
13 years 4 months ago
2008
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...
DCG
2008
13 years 4 months ago
2008
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...