26 search results - page 3 / 6 » On degrees in random triangulations of point sets |
STACS
2009
Springer
13 years 10 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
TOG
2008
13 years 6 months ago
2008
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
RSA
2008
13 years 5 months ago
2008
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
IVC
2008
13 years 6 months ago
2008
This paper generalizes Markov Random Field (MRF) stereo methods to the generation of surface relief (height) fields rather than disparity or depth maps. This generalization enable...