Polygonal approximation by boundary reduction

Laurence Boxer; Chun Shi Chang; Russ Miller; Andrew Rau-Chaplin

doi:10.1016/0167-8655(93)90084-Q

Polygonal approximation by boundary reduction

Laurence Boxer
, Chun Shi Chang
, Russ Miller
, Andrew Rau-Chaplin

Department of Computer Science and Engineering

Niagara University
SUNY Buffalo
Carleton University

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	111-119
Number of pages	9
Journal	Pattern Recognition Letters
Volume	14
Issue number	2
DOIs	https://doi.org/10.1016/0167-8655(93)90084-Q
State	Published - Feb 1993

Keywords

analysis of algorithms
Hausdorff metric
Polygon

Access to Document

10.1016/0167-8655(93)90084-Q

Cite this

@article{3f46b7ebb80a4811ae4f554e95ad7ccb,

title = "Polygonal approximation by boundary reduction",

abstract = "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.",

keywords = "analysis of algorithms, Hausdorff metric, Polygon",

author = "Laurence Boxer and Chang, \{Chun Shi\} and Russ Miller and Andrew Rau-Chaplin",

year = "1993",

month = feb,

doi = "10.1016/0167-8655(93)90084-Q",

language = "English",

volume = "14",

pages = "111--119",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - Polygonal approximation by boundary reduction

AU - Boxer, Laurence

AU - Chang, Chun Shi

AU - Miller, Russ

AU - Rau-Chaplin, Andrew

PY - 1993/2

Y1 - 1993/2

N2 - 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.

AB - 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.

KW - analysis of algorithms

KW - Hausdorff metric

KW - Polygon

UR - https://www.scopus.com/pages/publications/38249004415

U2 - 10.1016/0167-8655(93)90084-Q

DO - 10.1016/0167-8655(93)90084-Q

M3 - Article

AN - SCOPUS:38249004415

SN - 0167-8655

VL - 14

SP - 111

EP - 119

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 2

ER -

Polygonal approximation by boundary reduction

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this