Array-based compact data structures for triangulations: practical solutions with theoretical guarantees

DOI10.20382/JOCG.V9I1A8MaRDI QIDQ4626294zbMATH OpenOpenAlexFDO

Authors Luca Castelli Aleardi, Olivier Devillers

Publication date 27 February 2019

Full work available at URL https://inria.hal.science/hal-01846652

zbMATH Keywords

compact data structurenavigationplanar triangulationsSchnyder woods

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Explicit Array-Based Compact Data Structures for Triangulations
• Algorithms and Data Structures
• Succinct encoding of binary strings representing triangulations
• Succinct representations of planar maps
• A Compact Encoding of Plane Triangulations with Efficient Query Supports

Cited in

(13)

• Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators
• Succinct encoding of binary strings representing triangulations
• Persistent triangulations
• Catalog-based representation of 2D triangulations
• Explicit Array-Based Compact Data Structures for Triangulations
• Algorithms and Data Structures
• Constructing efficient algorithms for solving certain computational geometry problems using Reeb graphs
• Space-efficient graph coarsening with applications to succinct planar encodings
• SCARST: Schnyder compact and regularity sensitive triangulation data structure
• Grand-Schnyder woods
• Toward Grünbaum's conjecture for 4-connected graphs
• Computation of toroidal Schnyder woods made simple and fast: from theory to practice
• Generation of polygonal meshes in compact space

This page was built for publication: Array-based compact data structures for triangulations: practical solutions with theoretical guarantees

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