Approximate matching of polygonal shapes
- 1 September 1995
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 13 (3-4) , 251-265
- https://doi.org/10.1007/bf01530830
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A natural metric for curves — Computing the distance for polygonal chains and approximation algorithmsPublished by Springer Nature ,2005
- Approximation of convex polygonsPublished by Springer Nature ,2005
- Approximate matching of polygonal shapes (extended abstract)Published by Association for Computing Machinery (ACM) ,1991
- Computing the minimum Hausdorff distance for point sets under translationPublished by Association for Computing Machinery (ACM) ,1990
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequencesJournal of Combinatorial Theory, Series A, 1989
- Congruence, similarity, and symmetries of geometric objectsDiscrete & Computational Geometry, 1988
- AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segmentsDiscrete & Computational Geometry, 1987
- A sweepline algorithm for Voronoi diagramsAlgorithmica, 1987
- A linear time algorithm for the Hausdorff distance between convex polygonsInformation Processing Letters, 1983
- Transformation GeometryPublished by Springer Nature ,1982