Comparison of distance measures for planar curves
From MaRDI portal
Publication:1889583
DOI10.1007/S00453-003-1042-5zbMATH Open1072.68105OpenAlexW2083244827MaRDI QIDQ1889583FDOQ1889583
Authors: Helmut Alt, Christian Knauer, Carola Wenk 
Publication date: 2 December 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1042-5
Recommendations
- On length measures of planar closed curves and the comparison of convex shapes
- A distance comparison principle for evolving curves
- On the precision of curve length estimation in the plane
- Measure comparison and distance inequalities for convex bodies
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- Geometric distance fields of plane curves
- Comparing curves in homogeneous spaces
- scientific article; zbMATH DE number 1489855
- scientific article; zbMATH DE number 6130264
Hausdorff distance[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Fr%EF%BF%BD%EF%BF%BDchet+distance&go=Go Fr��chet distance]
Cited In (22)
- On length measures of planar closed curves and the comparison of convex shapes
- The Computational Geometry of Comparing Shapes
- Tighter connections between Formula-SAT and shaving logs
- Approximating the packedness of polygonal curves
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Computing the Fréchet distance between simple polygons
- Fast Fréchet queries
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- Implicitization of curves and (hyper)surfaces using predicted support
- Optimizing the geometrical accuracy of curvilinear meshes
- Fast Fréchet distance between curves with long edges
- Approximating the Fréchet distance for realistic curves in near linear time
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Application of a metric for complex polynomials to bounded modification of planar Pythagorean-hodograph curves
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS
- Computing the discrete Fréchet distance with imprecise input
- Link distance and shortest path problems in the plane
- Computing the Fréchet distance between folded polygons
- Detecting commuting patterns by clustering subtrajectories
- Approximating the Packedness of Polygonal Curves
This page was built for publication: Comparison of distance measures for planar curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1889583)
