The Computational Geometry of Comparing Shapes

DOI10.1007/978-3-642-03456-5_16zbMath1258.68165OpenAlexW2128953738MaRDI QIDQ3644725

Helmut Alt

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_16

zbMATH Keywords

shapescomputational geometrycomputabilitydistance measures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Translation invariant Fréchet distance queries ⋮ Neural manifold analysis of brain circuit dynamics in health and disease ⋮ Computing the Fréchet distance between folded polygons ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Approximating the Fréchet distance for realistic curves in near linear time ⋮ Improved algorithms for partial curve matching ⋮ On the computability of the set of automorphisms of the unit square ⋮ Unnamed Item ⋮ Fast algorithms for approximate Fréchet matching queries in geometric trees

Cites Work

• Can we compute the similarity between surfaces?
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions
• Congruence, similarity, and symmetries of geometric objects
• On a class of \(O(n^ 2)\) problems in computational geometry
• Approximate matching of polygonal shapes
• 2D-shape analysis using conformal mapping
• Shape Matching by Random Sampling
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Computational Geometry of Comparing Shapes