Shape simplification through graph sparsification

DOI10.1007/978-3-319-58961-9_2MaRDI QIDQ5082141zbMATH OpenOpenAlexWikidataFDO

Authors F. Escolano, Manuel Curado, Silvia Biasotti, Edwin R. Hancock

Publication date 15 June 2022

Published in Graph-Based Representations in Pattern Recognition (Search for Journal in Brave)

Full work available at URL https://eprints.whiterose.ac.uk/114032/1/paper_25.pdf

zbMATH Keywords

alpha shapesgraph sparsificationshape simplification

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for image processing (68U10)

Recommendations

• A general framework for graph sparsification
• Mason: morphological simplification
• A general framework for graph sparsification
• Drawing Big Graphs Using Spectral Sparsification
• Spectral sparsification of graphs

Cites work

• scientific article; zbMATH DE number 1256718 (Why is no real title available?)
• Computational topology. An introduction
• Dimension-independent modeling with simplicial complexes
• Graph sparsification by effective resistances
• On the shape of a set of points in the plane
• Sampling from large matrices
• Spectral sparsification of graphs
• Three-dimensional alpha shapes
• Topological persistence and simplification
• Twice-Ramanujan sparsifiers

Cited in

(4)

• scientific article; zbMATH DE number 2247682 (Why is no real title available?)
• From Shapes to Amortized Complexity
• On simplifying shapes by subjecting them to collinearity constraints
• Mason: morphological simplification

This page was built for publication: Shape simplification through graph sparsification

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