Explicit Array-Based Compact Data Structures for Triangulations
From MaRDI portal
Recommendations
- Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
- Succinct and Implicit Data Structures for Computational Geometry
- A compact encoding of plane triangulations with efficient query supports
- Building efficient and compact data structures for simplicial complexes
- Building efficient and compact data structures for simplicial complexes
- A Compact Encoding of Plane Triangulations with Efficient Query Supports
- A space efficient greedy triangulation algorithm
- Triangulations. Structures for algorithms and applications
- An efficient algorithm for enumeration of triangulations
- scientific article; zbMATH DE number 4064506
Cited in
(8)- Compression of coordinates of triangulation nodes
- Succinct encoding of binary strings representing triangulations
- Persistent triangulations
- Succinct and Implicit Data Structures for Computational Geometry
- Catalog-based representation of 2D triangulations
- Array-based compact data structures for triangulations: practical solutions with theoretical guarantees
- Algorithms and Data Structures
- Succinct representations of planar maps
This page was built for publication: Explicit Array-Based Compact Data Structures for Triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104626)