Catalog-based representation of 2D triangulations

DOI10.1142/S021819591100372XMaRDI QIDQ2893456zbMATH OpenOpenAlexFDO

Authors Luca Castelli Aleardi, Olivier Devillers, Abdelkrim Mebarki

Publication date 20 June 2012

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021819591100372x

zbMATH Keywords

compressionmemory efficient data-structuretriangulation

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Explicit Array-Based Compact Data Structures for Triangulations
• Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
• Algorithms and Data Structures
• Succinct representations of planar maps
• Persistent triangulations

Cites work

• Characterizing and efficiently computing quadrangulations of planar point sets
• COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS
• Converting triangulations to quadrangulations
• Optimal coding and sampling of triangulations
• Succinct representations of planar maps
• Triangulations in CGAL
• Using generic programming for designing a data structure for polyhedral surfaces

Cited in

(4)

• Succinct encoding of binary strings representing triangulations
• Persistent triangulations
• SCARST: Schnyder compact and regularity sensitive triangulation data structure
• Generation of polygonal meshes in compact space

This page was built for publication: Catalog-based representation of 2D triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893456)