Back to Search
Start Over
Filtering Relocations on a Delaunay Triangulation.
- Source :
- Computer Graphics Forum; Jul2009, Vol. 28 Issue 5, p1465-1474, 10p, 7 Diagrams, 5 Graphs
- Publication Year :
- 2009
-
Abstract
- Updating a Delaunay triangulation when its vertices move is a bottleneck in several domains of application. Rebuilding the whole triangulation from scratch is surprisingly a very viable option compared to relocating the vertices. This can be explained by several recent advances in efficient construction of Delaunay triangulations. However, when all points move with a small magnitude, or when only a fraction of the vertices move, rebuilding is no longer the best option. This paper considers the problem of efficiently updating a Delaunay triangulation when its vertices are moving under small perturbations. The main contribution is a set of filters based upon the concept of vertex tolerances. Experiments show that filtering relocations is faster than rebuilding the whole triangulation from scratch under certain conditions. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01677055
- Volume :
- 28
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- Computer Graphics Forum
- Publication Type :
- Academic Journal
- Accession number :
- 43993792
- Full Text :
- https://doi.org/10.1111/j.1467-8659.2009.01523.x