Polygonal approximation by boundary reduction

Autor:	Andrew Rau-Chaplin, Russ Miller, Laurence Boxer, Chun-Shi Chang
Rok vydání:	1993
Předmět:	Boundary (topology) Reduction (complexity) Combinatorics Hausdorff distance Artificial Intelligence Signal Processing Polygon Pattern recognition (psychology) Metric (mathematics) Computer Vision and Pattern Recognition Software Sequential algorithm Mathematics Analysis of algorithms
Zdroj:	Pattern Recognition Letters. 14:111-119
ISSN:	0167-8655
DOI:	10.1016/0167-8655(93)90084-q
Popis:	We give a sequential algorithm for approximating a given polygon P by another polygon P′ such that P′ is a ‘good approximation’ of P, and has fewer edges. We formalize the notion of a ‘good approximation’ in terms of the Hausdorff metric and show through experimentation that the application of this metric leads to visually satisfying approximations. Our algorithm modifies that of Leu and Chen (1988) to produce output that better approximates the input.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1a0a90005c5a203c33d9bb1b9a3e9f4e https://doi.org/10.1016/0167-8655(93)90084-q Zobrazit plný text záznamu