A Fast Approximate Skeleton with Guarantees for Any Cloud of Points in a Euclidean Space

DOI10.1007/978-3-030-83500-2_13OpenAlexW3042220052MaRDI QIDQ5861934

Yury Elkin, Di Liu, Vitaliy Kurlin

Publication date: 3 March 2022

Published in: Mathematics and Visualization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.08900

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science (68-XX) Computational aspects of data analysis and big data (68T09) Computational aspects of digital topology (68U03) Computational methods for problems pertaining to algebraic topology (55-08)

Cites Work

• Unnamed Item
• Near-linear time approximation algorithms for curve simplification
• Structure and stability of the one-dimensional Mapper
• A higher-dimensional homologically persistent skeleton
• Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
• Three-page embeddings of singular knots
• Elastic principal graphs and manifolds and their practical applications
• THREE-PAGE ENCODING AND COMPLEXITY THEORY FOR SPATIAL GRAPHS
• Fibonacci heaps and their uses in improved network optimization algorithms
• Computational Science and Its Applications – ICCSA 2004
• Metric graph reconstruction from noisy data
• Dynnikov three-page diagrams of spatial 3-valent graphs

This page was built for publication: A Fast Approximate Skeleton with Guarantees for Any Cloud of Points in a Euclidean Space