Lexicographic optimal homologous chains and applications to point cloud triangulations

DOI10.1007/S00454-022-00432-6MaRDI QIDQ2105327zbMATH OpenOpenAlexWikidataFDO

Authors David Cohen-Steiner, A. Lieutier, Julien Vuillamy

Publication date 8 December 2022

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-022-00432-6

zbMATH Keywords

Delaunay triangulationpoint cloud triangulationsimplicial homology

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7760161
• Minimum bounded chains and minimum homologous chains in embedded simplicial complexes
• On complexity of computing bottleneck and lexicographic optimal cycles in a homology class
• Non total-unimodularity neutralized simplicial complexes

Cites work

• \textsc{Phat} -- persistent homology algorithms toolbox
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• A sampling theory for compact sets in Euclidean space
• A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
• An improved equivalence algorithm
• Annotating simplices with a homology basis and its applications
• Computational topology. An introduction
• Computing Minimal Persistent Cycles: Polynomial and Hard Cases
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Hardness results for homology localization
• scientific article; zbMATH DE number 6783459 (Why is no real title available?)
• scientific article; zbMATH DE number 2209724 (Why is no real title available?)
• Max flows in O(nm) time, or better
• Measuring and computing natural generators for homology groups
• Minimum cuts and shortest homologous cycles
• Quantifying homology classes
• Screened Poisson surface reconstruction
• Smooth surface reconstruction via natural neighbour interpolation of distance functions
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
• Worst-case Analysis of Set Union Algorithms

Cited in

(9)

• Local criteria for triangulating general manifolds
• scientific article; zbMATH DE number 7760161 (Why is no real title available?)
• Delaunay and regular triangulations as lexicographic optimal chains
• Delaunay-like triangulation of smooth orientable submanifolds by _1-norm minimization
• Lexicographic optimal chains and critical bases
• Wrapping cycles in Delaunay complexes: bridging persistent homology and discrete Morse theory
• A simplicial homology approach for assessing and rectifying coverage of sensor networks for improved crop management
• Train-free segmentation in MRI with cubical persistent homology
• Persistent (co)homology in matrix multiplication time

Describes a project that uses

Uses Software

• CGAL
• SegMatch

This page was built for publication: Lexicographic optimal homologous chains and applications to point cloud triangulations

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