Efficient data structure for representing and simplifying simplicial complexes in high dimensions

DOI10.1145/1998196.1998277MaRDI QIDQ5404466zbMATH OpenOpenAlexFDO

Authors David Salinas, D. Attali, A. Lieutier

Publication date 24 March 2014

Published in Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1998196.1998277

zbMATH Keywords

clique complexesdata structureedge contractionflag complexeshigh dimensionshomotopy equivalenceshape reconstructionshape simplificationsimplicial complexesvietoris-rips complexes

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An efficient representation for filtrations of simplicial complexes
• An efficient representation for filtrations of simplicial complexes
• Building efficient and compact data structures for simplicial complexes

Cited in

(11)

• Simploidal sets: a data structure for handling simploidal Bézier spaces
• Building efficient and compact data structures for simplicial complexes
• Irreducible triangulations of surfaces with boundary
• An efficient representation for filtrations of simplicial complexes
• Schrijver graphs and projective quadrangulations
• Small Flag Complexes with Torsion
• Strong collapse and persistent homology
• Tracing Isomanifolds in \(\mathbb{R}\) ^d in Time Polynomial in d using Coxeter–Freudenthal–Kuhn Triangulations
• Sectionable tournaments: their topology and coloring
• A topological data analysis based classifier
• Geometry-driven collapses for converting a Čech complex into a triangulation of a nicely triangulable shape

This page was built for publication: Efficient data structure for representing and simplifying simplicial complexes in high dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404466)