Lexicographic optimal homologous chains and applications to point cloud triangulations

DOI10.1007/S00454-022-00432-6OpenAlexW2994010277WikidataQ114229283 ScholiaQ114229283MaRDI QIDQ2105327FDOQ2105327

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

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

zbMATH Keywords

Delaunay triangulationsimplicial homologypoint cloud triangulation

Mathematics Subject Classification ID

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

Cites Work

• \textsc{Phat} -- persistent homology algorithms toolbox
• Computational topology. An introduction
• Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Max flows in \(O(nm)\) time, or better
• Screened Poisson surface reconstruction
• Worst-case Analysis of Set Union Algorithms
• 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
• Title not available (Why is that?)
• Minimum cuts and shortest homologous cycles
• Efficient mesh optimization schemes based on optimal Delaunay triangulations
• Title not available (Why is that?)
• Smooth surface reconstruction via natural neighbour interpolation of distance functions
• An improved equivalence algorithm
• Measuring and computing natural generators for homology groups
• Quantifying homology classes
• Hardness results for homology localization
• Annotating simplices with a homology basis and its applications
• Computing Minimal Persistent Cycles: Polynomial and Hard Cases

Cited In (3)

• Title not available (Why is that?)
• Delaunay and regular triangulations as lexicographic optimal chains
• Local criteria for triangulating general manifolds

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)