Building Efficient and Compact Data Structures for Simplicial Complexes

The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the ST while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree and the Simplex Array List. We analyze the compressed ST, the Maximal Simplex Tree, and the Simplex Array List under various settings.

[1]  David Eppstein,et al.  Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time , 2010, Exact Complexity of NP-hard Problems.

[2]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[3]  Robert Sedgewick,et al.  Fast algorithms for sorting and searching strings , 1997, SODA '97.

[4]  Louis J. Billera,et al.  Face Numbers of Polytopes and Complexes , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[5]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[6]  Douglas Comer,et al.  Complexity of trie index construction , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[7]  Andrew W. Appel,et al.  The world's fastest Scrabble program , 1988, CACM.

[8]  Daniel M. Yellin.  Algorithms for subset testing and finding maximal sets , 1992, SODA '92.

[9]  Viliam Geffert,et al.  Hyper-minimizing minimized deterministic finite state automata , 2009, RAIRO Theor. Informatics Appl..

[10]  Nikos Fakotakis,et al.  Optimal insertion in deterministic DAWGs , 2003, Theor. Comput. Sci..

[11]  Dorian Mazauric,et al.  On the complexity of the representation of simplicial complexes by trees , 2016, Theor. Comput. Sci..

[12]  Mikel L. Forcada,et al.  Incremental Construction and Maintenance of Minimal Finite-State Automata , 2002, CL.

[13]  André Lieutier,et al.  Efficient data structure for representing and simplifying simplicial complexes in high dimensions , 2011, SoCG '11.

[14]  Nelma Moreira,et al.  Incomplete Transition Complexity of Some Basic Operations , 2013, SOFSEM.

[15]  Andreas Maletti,et al.  Notes on Hyper-minimization , 2011, AFL.

[16]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[17]  Arne Andersson,et al.  Improved Behaviour of Tries by Adaptive Branching , 1993, Inf. Process. Lett..

[18]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[19]  Jukka Teuhola,et al.  Text compression using prediction , 1986, SIGIR '86.

[20]  Sheng Yu,et al.  Minimal cover-automata for finite languages , 2001, Theor. Comput. Sci..

[21]  Jean-Daniel Boissonnat,et al.  Building Efficient and Compact Data Structures for Simplicial Complexes , 2015, Symposium on Computational Geometry.

[22]  Dominique Revuz,et al.  Minimisation of Acyclic Deterministic Automata in Linear Time , 1992, Theor. Comput. Sci..

[23]  Kai Shen,et al.  Adaptive Algorithms for Cache-Efficient Trie Search , 1998, ALENEX.

[24]  Bruce W. Watson,et al.  Incremental construction of minimal acyclic finite state automata , 2000, CL.

[25]  Martin Grohe,et al.  Characterisations of Nowhere Dense Graphs , 2013 .

[26]  A. Nerode,et al.  Linear automaton transformations , 1958 .

[27]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[28]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[29]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[30]  Jean-Daniel Boissonnat,et al.  The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes , 2012, Algorithmica.