Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees

DOI10.20382/jocg.v9i1a8zbMath1426.68267OpenAlexW2773875520MaRDI QIDQ4626294

Luca Castelli Aleardi, Olivier Devillers

Publication date: 27 February 2019

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

zbMATH Keywords

navigationplanar triangulationscompact data structureSchnyder woods

Mathematics Subject Classification ID

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

Related Items (3)

Succinct encoding of binary strings representing triangulations ⋮ Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators ⋮ Fast and compact planar embeddings

This page was built for publication: Array-based Compact Data Structures for Triangulations: Practical Solutions with Theoretical Guarantees