TY - GEN

T1 - Boundary representation with lines and circular arcs using boundary split-and-merge method

AU - Sohn, Kwanghoon

AU - Alexander, W. E.

AU - Nilsson, A. A.

AU - Kim, Jung H.

AU - Park, Eui H.

AU - Ntuen, C. A.

AU - Yoon, Sung H.

N1 - Copyright:
Copyright 2004 Elsevier B.V., All rights reserved.

PY - 1991

Y1 - 1991

N2 - A method of finding critical (or corner) points and describing a two-dimensional closed boundary is presented. The method uses a split-and-merge technique. It first splits a closed boundary in half until the boundary is approximated by a line within a given error bound to find critical points and all the control points are linked by lines, that is, linearly approximated. Next, by finding some breaking points which have sharp angles between three critical points, a closed boundary is divided by some intervals. Within each interval, a merging technique based on an LMS (least-mean-square) error is used to reduce the number of critical points and segments. Then, each shape is represented by an ordered sequence of line segments and circular arc segments with control points as vertex points. The resulting description is a good approximation of the original in the sense that it makes interesting points explicit and achieves significant data compression.

AB - A method of finding critical (or corner) points and describing a two-dimensional closed boundary is presented. The method uses a split-and-merge technique. It first splits a closed boundary in half until the boundary is approximated by a line within a given error bound to find critical points and all the control points are linked by lines, that is, linearly approximated. Next, by finding some breaking points which have sharp angles between three critical points, a closed boundary is divided by some intervals. Within each interval, a merging technique based on an LMS (least-mean-square) error is used to reduce the number of critical points and segments. Then, each shape is represented by an ordered sequence of line segments and circular arc segments with control points as vertex points. The resulting description is a good approximation of the original in the sense that it makes interesting points explicit and achieves significant data compression.

UR - http://www.scopus.com/inward/record.url?scp=0025803208&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025803208&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025803208

SN - 0780300335

T3 - Conference Proceedings - IEEE SOUTHEASTCON

SP - 707

EP - 711

BT - Conference Proceedings - IEEE SOUTHEASTCON

PB - Publ by IEEE

T2 - IEEE Proceedings of the SOUTHEASTCON '91

Y2 - 8 April 1991 through 10 April 1991

ER -