Simplicial complexes are widely used to discretize shapes. In low dimensions, a 3D shape is represented by discretizing its boundary surface, encoded as a triangle mesh, or by discretizing the enclosed volume, encoded as a tetrahedral mesh. High‐dimensional simplicial complexes have recently found their application in topological data analysis. Topological data analysis aims at studying a point cloud P, possibly embedded in a high‐dimensional metric space, by investigating the topological characteristics of the simplicial complexes built on P. Analysing such complexes is not feasible due to their size and dimensions. To this aim, the idea of simplifying a complex while preserving its topological features has been proposed in the literature. Here, we consider the problem of efficiently simplifying simplicial complexes in arbitrary dimensions. We provide a new definition for the edge contraction operator, based on a top‐based data structure, with the objective of preserving structural aspects of a simplicial shape (i.e., its homology), and a new algorithm for verifying the link condition on a top‐based representation. We implement the simplification algorithm obtained by coupling the new edge contraction and the link condition on a specific top‐based data structure, that we use to demonstrate the scalability of our approach.
Efficient Homology‐Preserving Simplification of High‐Dimensional Simplicial Shapes
Riccardo Fellegara,F. Iuricich,L. Floriani,Ulderico Fugacci
Published 2019 in Computer graphics forum (Print)
ABSTRACT
PUBLICATION RECORD
- Publication year
2019
- Venue
Computer graphics forum (Print)
- Publication date
2019-08-05
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-46 of 46 references · Page 1 of 1
CITED BY
Showing 1-5 of 5 citing papers · Page 1 of 1