Building efficient and compact data structures for simplicial complexes

DOI10.1007/S00453-016-0207-YMaRDI QIDQ2408925zbMATH OpenOpenAlexFDO

Authors Jean-Daniel Boissonnat, Sébastien Tavenas, 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

compact data structuresNP-hardnesssimplex automatonsimplicial complex

Mathematics Subject Classification ID

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

Recommendations

• Building efficient and compact data structures for simplicial complexes
• A representation for abstract simplicial complexes: an analysis and a comparison.
• An efficient representation for filtrations of simplicial complexes

Cites work

• Algorithmic graph theory and perfect graphs
• Building efficient and compact data structures for simplicial complexes
• Characterisations of nowhere dense graphs (invited talk)
• Efficient data structure for representing and simplifying simplicial complexes in high dimensions
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1182908 (Why is no real title available?)
• scientific article; zbMATH DE number 742985 (Why is no real title available?)
• scientific article; zbMATH DE number 6472611 (Why is no real title available?)
• Hyper-minimizing minimized deterministic finite state automata
• Improved behaviour of tries by adaptive branching
• Incomplete transition complexity of some basic operations
• Incremental Construction and Maintenance of Minimal Finite-State Automata
• Incremental Construction of Minimal Acyclic Finite-State Automata
• Linear Automaton Transformations
• Listing all maximal cliques in sparse graphs in near-optimal time
• Minimal cover-automata for finite languages
• Minimisation of acyclic deterministic automata in linear time
• Notes on hyper-minimization
• On the complexity of the representation of simplicial complexes by trees
• Optimal insertion in deterministic DAWGs
• Reducibility among combinatorial problems
• The Complexity of Trie Index Construction

Cited in

(16)

• Succinct and Implicit Data Structures for Computational Geometry
• Explicit Array-Based Compact Data Structures for Triangulations
• Equivariant simplicial reconstruction
• An efficient representation for filtrations of simplicial complexes
• An efficient representation for filtrations of simplicial complexes
• The implementation of the colored abstract simplicial complex and its application to mesh generation
• Strong Collapse for Persistence
• Computing persistent homology of flag complexes via strong collapses
• Building efficient and compact data structures for simplicial complexes
• Efficient data structure for representing and simplifying simplicial complexes in high dimensions
• Tree checking for sparse complexes
• Strong collapse and persistent homology
• Tracing Isomanifolds in \(\mathbb{R}\) ^d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
• A representation for abstract simplicial complexes: an analysis and a comparison.
• A topological data analysis based classifier
• On the complexity of the representation of simplicial complexes by trees

This page was built for publication: Building efficient and compact data structures for simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408925)