Title :
On optimal approximation of orthogonal polygons
Author :
Chen, Yao-Ping ; Wong, D.F.
Author_Institution :
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
Abstract :
The authors consider a problem in computational geometry which has applications in VLSI floorplan design and image processing. Given an orthogonal polygon P, i.e., edges are either vertical or horizontal, with n vertices and a positive integer m < n, determine an orthogonal polygon Q with less than or equal to m vertices such that ERROR(P,Q ) is minimized, where ERROR(P,Q) is defined as the area of the symmetric difference of the interiors of the two polygons. A polynomial time optimal algorithm is presented to solve this problem for convex orthogonal polygons. The algorithm is based on a transformation of the polygon approximation problem into a constrained shortest path problem
Keywords :
VLSI; circuit layout CAD; computational geometry; image processing; VLSI floorplan design; computational geometry; constrained shortest path problem; image processing; orthogonal polygons; polynomial time optimal algorithm; symmetric difference; vertices; Application software; Approximation algorithms; Circuits; Computational geometry; Image processing; Polynomials; Process design; Shape; Shortest path problem; Very large scale integration;
Conference_Titel :
Circuits and Systems, 1993., ISCAS '93, 1993 IEEE International Symposium on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-1281-3
DOI :
10.1109/ISCAS.1993.394281
