Building efficient and compact data structures for simplicial complexes

DOI10.1007/s00453-016-0207-yzbMath1372.68072OpenAlexW3101718603MaRDI QIDQ2408925

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

Publication date: 10 October 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5098/

zbMATH Keywords

simplicial complexNP-hardnesscompact data structuressimplex automaton

Mathematics Subject Classification ID

General topology of complexes (57Q05) Formal languages and automata (68Q45) Data structures (68P05)

Related Items

Strong collapse and persistent homology, Tracing Isomanifolds in \(\mathbb{R}\) ^d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations, Strong Collapse for Persistence, Computing Persistent Homology of Flag Complexes via Strong Collapses

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
• Improved behaviour of tries by adaptive branching
• On the complexity of the representation of simplicial complexes by trees
• Minimisation of acyclic deterministic automata in linear time
• Optimal insertion in deterministic DAWGs
• Algorithmic graph theory and perfect graphs
• Incomplete Transition Complexity of Some Basic Operations
• Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
• Linear Automaton Transformations
• Hyper-minimizing minimized deterministic finite state automata
• The Complexity of Trie Index Construction
• Incremental Construction and Maintenance of Minimal Finite-State Automata
• Incremental Construction of Minimal Acyclic Finite-State Automata
• Reducibility among Combinatorial Problems
• Building Efficient and Compact Data Structures for Simplicial Complexes
• Efficient data structure for representing and simplifying simplicial complexes in high dimensions
• Minimal cover-automata for finite languages