- APPROXIMATION OF CONVEX POLYGONS
- APPROXIMATION OF CONVEX POLYGONS
- ㆍ 저자명
- Lee. Young-Soo
- ㆍ 간행물명
- Journal of applied mathematics & computing
- ㆍ 권/호정보
- 2002년|10권 1호|pp.245-250 (6 pages)
- ㆍ 발행정보
- 한국전산응용수학회
- ㆍ 파일정보
- 정기간행물|ENG| PDF텍스트
- ㆍ 주제분야
- 기타
Consider the Convex Polygon Pm={Al , A2, ‥‥, Am} With Vertex points A$\_$i/ = (a$\_$i/, b$\_$i/),i : 1,‥‥, m, interior P$^$0/$\_$m/, and length of perimeter denoted by L(P$\_$m/). Let R$\_$n/ = {B$_1$,B$_2$,‥‥,B$\_$n/), where B$\_$i/=(x$\_$i/,y$\_$I/), i =1,‥‥, n, denote a regular polygon with n sides of equal length and equal interior angle. Kaiser[4] used the regular polygon R$\_$n/ to approximate P$\_$m/, and the problem examined in his work is to position R$\_$n/ with respect to P$\_$m/ to minimize the area of the symmetric difference between the two figures. In this paper we give the quality of a approximating regular polygon R$\_$n/ to approximate P$\_$m/.