Computing the Fréchet distance between folded polygons

DOI10.1016/j.comgeo.2015.08.002zbMath1332.65032OpenAlexW1192944040MaRDI QIDQ904083

Anne Driemel, Jessica Sherette, Carola Wenk, Atlas F. IV. Cook

Publication date: 15 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.08.002

zbMATH Keywords

Fréchet distancesurface comparisonfolded polygonsmonotonicity testpolygon algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Gromov-Fréchet distance between curves

Cites Work

• Unnamed Item
• Unnamed Item
• Approximating the Fréchet distance for realistic curves in near linear time
• Can we compute the similarity between surfaces?
• Comparison of distance measures for planar curves
• Fréchet Distance of Surfaces: Some Simple Hard Cases
• The Computational Geometry of Comparing Shapes
• Matching planar maps
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
• Computing the Fréchet Distance between Folded Polygons
• Four Soviets Walk the Dog—with an Application to Alt's Conjecture
• Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
• The frechet distance revisited and extended
• Multiplying matrices faster than coppersmith-winograd
• Computing the Discrete Fréchet Distance in Subquadratic Time
• Algorithms in real algebraic geometry

This page was built for publication: Computing the Fréchet distance between folded polygons