 |
 |
|
|
| inria-00001187, version 1 |
 |
|
|
|
| Voir la fiche détaillée |  BibTeX EndNote TEI RefWorks |
|
|
|||||||||
| 18th Canadian Conference on Computational Geometry (2005) |
|
| In a recent article, we presented a succinct representation of triangulations that supports efficient navigation operations. Here this representation is improved to allow for efficient local updates of the triangulations. Precisely, we show how a succinct representation of a triangulation with $m$ triangles can be maintained under vertex insertions in $O(1)$ amortized time and under vertex deletions/edge flips in $O(\lg^{2} m)$ amortized time. Our structure achieves the information theory bound for the storage for the class of triangulations with a boundary, requiring asymptotically $2.17m+o(m)$ bits, and supports adjacency queries between triangles in $O(1)$ time (an extra amount of $O(g\lg m)$ bits are needed for representing triangulations of genus $g$ surfaces). |
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'informatique de l'école polytechnique (LIX) |
|
CNRS : UMR7161 – Polytechnique - X |
| 2 : | GEOMETRICA (INRIA Sophia Antipolis) |
|
INRIA |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Géométrie algorithmiqueInformatique/Algorithme et structure de données |
| http://cs.uwindsor.ca/~cccg/ |
| inria-00001187, version 1 | |
| http://hal.inria.fr/inria-00001187/fr/ | |
| oai:hal.inria.fr:inria-00001187_v1 | |
| Contributeur : Olivier Devillers | |
| Soumis le : Mercredi 12 Avril 2006, 14:55:22 | |
| Dernière modification le : Jeudi 13 Avril 2006, 16:32:22 | |
