Building efficient and compact data structures for simplicial complexes

HIGHLIGHTS

• who: Jean-Daniel Boissonnat et al. from the Geometrica, INRIA Sophia Antipolis, Mu00e9diterranu00e9e, France have published the research work: Building Eufb03cient and Compact Data Structures for Simplicial Complexes, in the Journal: (JOURNAL)
• what: The authors show how to optimally compress the Simplex Tree while retaining its functionalities. The authors propose two new data structures called Maximal Simplex Tree (MxST) and Simplex Array List (SAL). When the size of the structure is of primary concern, the work is usually focused on automata compression. The authors show that it is hard to find an optimal labeling for . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or E-mail:

  If you don't have an account, you can create one here.