Algorithms and Data Structures
From MaRDI portal
Publication:5394244
DOI10.1007/11534273zbMath1161.68396MaRDI 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
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Succinct Representation of Labeled Graphs, A Compact Encoding of Plane Triangulations with Efficient Query Supports, Fast and compact planar embeddings, A compact encoding of plane triangulations with efficient query supports, Compact navigation and distance oracles for graphs with small treewidth, I/O-efficient path traversal in succinct planar graphs, Schnyder woods for higher genus triangulated surfaces, with applications to encoding, Succinct representations of planar maps, Navigating planar topologies in near-optimal space and time, Succinct representation of labeled graphs, Succinct encoding of binary strings representing triangulations, Succinct and Implicit Data Structures for Computational Geometry
Uses Software