SCARST: Schnyder compact and regularity sensitive triangulation data structure

DOI10.4230/LIPICS.SOCG.2024.32MaRDI QIDQ6895872zbMATH OpenFDO

Authors Luca Castelli Aleardi, Olivier Devillers

Publication date 24 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2024.32

zbMATH Keywords

compact representationscompressionmeshestriangulations

Mathematics Subject Classification ID

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

Cites work

• A compact encoding of plane triangulations with efficient query supports
• An edgebreaker-based efficient compression scheme for regular meshes
• Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
• Catalog-based representation of 2D triangulations
• Encoding toroidal triangulations
• Fast and compact planar embeddings
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• Optimal coding and sampling of triangulations
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Succinct encoding of binary strings representing triangulations
• Succinct representations of planar maps
• Triangulations in CGAL

Cited in

(2)

• Computation of toroidal Schnyder woods made simple and fast: from theory to practice
• Efficient enumeration of drawings and combinatorial structures for maximal planar graphs

This page was built for publication: SCARST: Schnyder compact and regularity sensitive triangulation data structure

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