Computing the Fréchet distance between simple polygons
type: Item
instance of: scholarly article
title: Computing the Fréchet distance between simple polygons
zbMATH Open document ID: 1145.65009
author: Kevin Buchin
author: Maike Buchin
author: Carola Wenk
published in: Computational Geometry
publication date: 2008-07-29T00:00:00Z
Mathematics Subject Classification ID: 65D18
zbMATH DE Number: 5304593
zbMATH Keywords: shape matching
zbMATH Keywords: Fréchet distance
zbMATH Keywords: simple polygons
zbMATH Keywords: polynomial-time algorithm
zbMATH Keywords: shortest paths
zbMATH Keywords: dynamic programming
MaRDI profile type: Publication
full work available at URL: j.comgeo.2007.08.003
OpenAlex ID: W2122005371
cites work: Approximate matching of polygonal shapes
cites work: Can we compute the similarity between surfaces?
cites work: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
cites work: Q4945503
cites work: Comparison of distance measures for planar curves
cites work: Q3601525
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Matrix multiplication via arithmetic progressions
cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
cites work: Q4945512
cites work: ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Q5789249
cites work: Gaussian elimination is not optimal
DOI: 10.1016/J.COMGEO.2007.08.003
description: scientific article; zbMATH DE number 5304593