Pages that link to "Item:Q2408925"
From MaRDI portal
The following pages link to Building efficient and compact data structures for simplicial complexes (Q2408925):
Displaying 11 items.
- The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes (Q134868) (← links)
- On the complexity of the representation of simplicial complexes by trees (Q905846) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Explicit Array-Based Compact Data Structures for Triangulations (Q3104626) (← links)
- An Efficient Representation for Filtrations of Simplicial Complexes (Q4629957) (← links)
- Strong Collapse for Persistence (Q5009636) (← links)
- Computing Persistent Homology of Flag Complexes via Strong Collapses (Q5088987) (← links)
- Strong collapse and persistent homology (Q5880377) (← links)
- Tracing Isomanifolds in \(\mathbb{R}\) <sup><i>d</i></sup> in Time Polynomial in <i>d</i> using Coxeter–Freudenthal–Kuhn Triangulations (Q5890033) (← links)
- Discrete Geometry for Computer Imagery (Q5902465) (← links)
- A topological data analysis based classifier (Q6613903) (← links)