TL;DR
The paper introduces the Stellar decomposition, a scalable, memory-efficient topological data structure for simplicial and cell complexes, enabling efficient traversal and application-specific customization, especially for high-dimensional and large datasets.
Contribution
It presents the Stellar decomposition model and the Stellar tree implementation, which improve memory efficiency and scalability over existing structures for complex topological data.
Findings
Stellar trees outperform state-of-the-art structures for non-manifold complexes.
The model enables construction of application-specific data structures with less memory.
Stellar trees effectively exploit spatial locality for efficient processing.
Abstract
We introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex's vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region's vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
