POLYGONAL-APPROXIMATION BY BOUNDARY REDUCTION

被引：10
|
作者：
BOXER, L
CHANG, CS
MILLER, R
RAUCHAPLIN, A
机构：
[1] SUNY BUFFALO,DEPT COMP SCI,BUFFALO,NY 14260
[2] CARLETON UNIV,SCH COMP SCI,OTTAWA K1S 5B6,ONTARIO,CANADA
来源：
PATTERN RECOGNITION LETTERS | 1993年 / 14卷 / 02期
基金：
美国国家科学基金会; 加拿大自然科学与工程研究理事会;
关键词：
analysis of algorithms; Hausdorff metric; Polygon;
D O I：
10.1016/0167-8655(93)90084-Q
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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.
引用
收藏
页码：111 / 119
页数：9
相关论文
共 50 条
12345