Dynamic updates of succinct triangulations - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Dynamic updates of succinct triangulations

Abstract

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 lgm)$ bits are needed for representing triangulations of genus $g$ surfaces).
Fichier principal
Vignette du fichier
RR-5709.pdf (376.09 Ko) Télécharger le fichier

Dates and versions

inria-00070308 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070308 , version 1

Cite

Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer. Dynamic updates of succinct triangulations. [Research Report] RR-5709, INRIA. 2006, pp.23. ⟨inria-00070308⟩
137 View
202 Download

Share

Gmail Facebook X LinkedIn More