Building Efficient and Compact Data Structures for Simplicial Complexes

DOI10.4230/LIPIcs.SOCG.2015.642zbMath1378.68026arXiv1503.07444OpenAlexW4391060513MaRDI QIDQ5368718

Jean-Daniel Boissonnat, C. S. Karthik, Sébastien Tavenas

Publication date: 10 October 2017

Full work available at URL: https://arxiv.org/abs/1503.07444

zbMATH Keywords

simplicial complexNP-hardnesscompact data structuresminimal simplex automaton

Mathematics Subject Classification ID

General topology of complexes (57Q05) Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (2)

Building efficient and compact data structures for simplicial complexes ⋮ On the complexity of the representation of simplicial complexes by trees

Uses Software

• Gudhi

This page was built for publication: Building Efficient and Compact Data Structures for Simplicial Complexes