Lexicographic optimal homologous chains and applications to point cloud triangulations
From MaRDI portal
Publication:2105327
DOI10.1007/s00454-022-00432-6OpenAlexW2994010277WikidataQ114229283 ScholiaQ114229283MaRDI QIDQ2105327
David Cohen-Steiner, André 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
Related Items
Local criteria for triangulating general manifolds ⋮ Delaunay and regular triangulations as lexicographic optimal chains
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hardness results for homology localization
- Efficient mesh optimization schemes based on optimal Delaunay triangulations
- \textsc{Phat} -- persistent homology algorithms toolbox
- A sampling theory for compact sets in Euclidean space
- Measuring and computing natural generators for homology groups
- Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
- Optimal homologous cycles, total unimodularity, and linear programming
- Annotating Simplices with a Homology Basis and Its Applications
- Worst-case Analysis of Set Union Algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
- Quantifying Homology Classes
- Computing Minimal Persistent Cycles: Polynomial and Hard Cases
- Screened poisson surface reconstruction
- An improved equivalence algorithm
- Smooth surface reconstruction via natural neighbour interpolation of distance functions
- Minimum cuts and shortest homologous cycles
- Max flows in O(nm) time, or better
