85 search results - page 8 / 17 » Elementary Moves on Triangulations |
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
Relief mosaics are collections of registered images that extend traditional mosaics by supporting motion parallax. A simple parallax interpolation algorithm based on computed corr...
VISUALIZATION
2005
IEEE
14 years 1 months ago
2005
IEEE
The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolu...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
In many applications it is often desirable to maintain a valid mesh within a certain domain that deforms over time. During a period for which the underlying mesh topology remains ...
COMPGEOM
2010
ACM
14 years 17 days 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 ...
GRAPHICSINTERFACE
2009
13 years 5 months ago
2009
We present a simple and efficient method for reconstructing triangulated surfaces from massive oriented point sample datasets. The method combines streaming and parallelization, m...