Closest paths in graph drawings under an elastic metric
From MaRDI portal
Publication:1784072
Pattern recognition, speech recognition (68T10) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Graph representations (geometric and intersection representations, etc.) (05C62) Machine vision and scene understanding (68T45)
Recommendations
Cites work
- scientific article; zbMATH DE number 1194132 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- A new geometric metric in the space of curves, and applications to tracking deforming objects by prediction and filtering
- A note on two problems in connexion with graphs
- Computable Elastic Distances Between Shapes
- Content-based image retrieval using a signature graph and a self-organizing map
- Convex Representations of Graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Functional and shape data analysis
- How to Draw a Graph
- Nuclei segmentation for computer-aided diagnosis of breast cancer
- On shape of plane elastic curves
- Riemannian geometries on spaces of plane curves
- Statistical Estimation of the Dynamics of Watershed Dams
- The Complexity of Enumeration and Reliability Problems
- Welcome to Riemannian computing in computer vision
Cited in
(3)
This page was built for publication: Closest paths in graph drawings under an elastic metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784072)