Computing the Fréchet distance between two polygonal curves H Alt, M Godau International Journal of Computational Geometry & ..., 1995 World Scientific As a measure for the resemblance of curves in… (More)

For two given simple polygonsP, Q, the problem is to determine a rigid motionI ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff distance betweenP andI(Q). Faster… (More)

The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. More… (More)

Voronoi diagrams of curved objects can show certa”n phenomena that are often considered artifacts: The Voronoi diagram is not connected; there are pairs of objects whose bisector is a closed curve or… (More)

In many applications, two-dimensional shapes are given by the planar curves forming their boundaries. Consequently, a ttaturat problem in shape comparison and recognition is to measure, how much two… (More)