Lexicographic optimal homologous chains and applications to point cloud triangulations
From MaRDI portal
Publication:2105327
Recommendations
Cites work
- scientific article; zbMATH DE number 6783459 (Why is no real title available?)
- scientific article; zbMATH DE number 2209724 (Why is no real title available?)
- A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
- A minimum spanning tree algorithm with inverse-Ackermann type complexity
- A sampling theory for compact sets in Euclidean space
- 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
- 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
- \textsc{Phat} -- persistent homology algorithms toolbox
Cited in
(3)
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)