Reversibly visible polygons and polygonal approximation in two dimensional space

Author

Rao, Sasipalli V S ; Harada, Koichi

Author_Institution

Div. of Inf. Sci., Hiroshima Univ., Japan

fYear

1997

fDate

23-27 Jun 1997

Firstpage

74

Lastpage

83

Abstract

A digitized picture in a 2D array of points is often desired to be approximated by polygonal lines, with the smallest number of sides under the given error tolerance E. To approximate the polygonal line of such data, we introduce two new terms called “windows in the edges” and “reversibly visible polygons”. We also present linear time algorithms that find minimax polygons, windows in the edges and the reversibly visible polygons. Based on these algorithms we finally produce a general polygonal line that lies in the reversibly visible polygon and approximates the polygonal line of the given data

Keywords

approximation theory; computer graphics; minimax techniques; piecewise-linear techniques; 2D array of points; digitized picture; error tolerance; general polygonal line; linear time algorithms; minimax polygons; polygonal approximation; polygonal line approximation; reversibly visible polygons; two dimensional space; windows in the edges; Approximation algorithms; Art; Computer graphics; Information science; Joining processes; Minimax techniques; Piecewise linear approximation; Piecewise linear techniques; Shape;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Graphics International, 1997. Proceedings

Conference_Location

Hasselt and Diepenbeek

Print_ISBN

0-7695-0185-0

Type

conf

DOI

10.1109/CGI.1997.601276

Filename

601276