An efficient algorithm for partitioning parameterized polygons into rectangles

Tseng, I-Lun and Postula, Adam (2006). An efficient algorithm for partitioning parameterized polygons into rectangles. In: Z. Yan, Proceedings of the 2006 ACM Great Lakes Symposium on VLSI. 2006 ACM Great Lakes Symposium on VLSI (GLSVLSI), Philadelphia, U.S.A., (366-371). 30 April - 2 May, 2006.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads

Author Tseng, I-Lun
Postula, Adam
Title of paper An efficient algorithm for partitioning parameterized polygons into rectangles
Conference Paper Type Fully Published Paper
Conference name 2006 ACM Great Lakes Symposium on VLSI (GLSVLSI)    (ERA 2010 Rank A)
DOI 10.1145/1127908.1127992
Conference location Philadelphia, U.S.A.
Conference dates 30 April - 2 May, 2006
Proceedings title Proceedings of the 2006 ACM Great Lakes Symposium on VLSI
Editor Z. Yan
Place published USA
Publisher ACM
Publication date 2006
Volume number 1
Issue number 1
ISBN 1-59593-347-6
Start page 366
End page 371
Total pages 6
Collection year 2006
Language eng
Abstract/Summary In this paper, we propose an algorithm for partitioning parameterized orthogonal polygons into rectangles. The algorithm is based on the plane-sweep technique and can be used for partitioning polygons which contain holes. The input to the algorithm consists of the contour of a parameterized polygon to be partitioned and the constraints for those parameters which reside in the contour. The algorithm uses horizontal cuts only and generates a minimum number of rectangles whose union is the original orthogonal polygon. The proposed algorithm can be used as the basis to build corner stitching data structure for parameterized VLSI layouts and has been implemented in Java programming language. Copyright © 2010 ACM, Inc.
Subjects E1
290902 Integrated Circuits
700199 Computer software and services not elsewhere classified
0803 Computer Software
Keyword Algorithms
Corner stitching
Parameterized layouts
Parameterized polygons
Polygon decomposition
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status UQ

 
Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 3 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Access Statistics: 126 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Thu, 23 Aug 2007, 22:20:07 EST