CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS

DOI10.1142/S021819591100372XzbMath1241.68121OpenAlexW2062167329MaRDI QIDQ2893456

Olivier Devillers, Abdelkrim Mebarki, Luca Castelli Aleardi

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

triangulationcompressionmemory efficient data-structure

Mathematics Subject Classification ID

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

Related Items (1)

Succinct encoding of binary strings representing triangulations

Cites Work

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

This page was built for publication: CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS