Between shapes, using the Hausdorff distance
Authors:
- Marc van KreveldMKMarc van Kreveld
- Tillmann MiltzowTMTillmann Miltzow
- Tim OpheldersTOTim Ophelders
- Willem SonkeWSWillem Sonke
- Jordi L. VermeulenJVJordi L. Vermeulen
Open Access
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 100
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (612.001.651, 639.023.208)
This publication has 13 references indexed in Scilit:
- NONLINEAR INTERPOLATION BETWEEN SLICESInternational Journal of Shape Modeling, 2008
- Guaranteed intersection-free polygon morphingComputers & Graphics, 2001
- Metro: Measuring Error on Simplified SurfacesComputer Graphics Forum, 1998
- Piecewise-Linear Interpolation between Polygonal SlicesComputer Vision and Image Understanding, 1996
- Approximate matching of polygonal shapesAnnals of Mathematics and Artificial Intelligence, 1995
- Arrangements of curves in the plane—topology, combinatorics, and algorithmsTheoretical Computer Science, 1992
- Shape reconstruction from planar cross sectionsComputer Vision, Graphics, and Image Processing, 1988
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- The Discrete Geodesic ProblemSIAM Journal on Computing, 1987
- A linear time algorithm for the Hausdorff distance between convex polygonsInformation Processing Letters, 1983