Algorithms and Data Structures
From MaRDI portal
Publication:5394244
DOI10.1007/11534273zbMath1161.68396OpenAlexW3010016474MaRDI QIDQ5394244
No author found.
Publication date: 25 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11534273
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (12)
Schnyder woods for higher genus triangulated surfaces, with applications to encoding ⋮ Succinct encoding of binary strings representing triangulations ⋮ A compact encoding of plane triangulations with efficient query supports ⋮ Succinct representation of labeled graphs ⋮ Compact navigation and distance oracles for graphs with small treewidth ⋮ Succinct Representation of Labeled Graphs ⋮ I/O-efficient path traversal in succinct planar graphs ⋮ Succinct representations of planar maps ⋮ A Compact Encoding of Plane Triangulations with Efficient Query Supports ⋮ Fast and compact planar embeddings ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Navigating planar topologies in near-optimal space and time
Uses Software
This page was built for publication: Algorithms and Data Structures
