University of Illinois Urbana-Champaign

Incremental algorithms for General Purpose Layout System

Cynn, Myong Heon

This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.

Permalink

https://hdl.handle.net/2142/23034

Description

Title
Incremental algorithms for General Purpose Layout System
Author(s)
Cynn, Myong Heon
Issue Date
1994
Doctoral Committee Chair(s)
Kang, Sung Mo
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
  • Engineering, Electronics and Electrical
  • Computer Science
Language
eng
Abstract
  • General Purpose Layout System (GPLS) is proposed as a bidirectional layout conversion system. GPLS can translate layout to stick diagram, stick diagram to layout, layout to layout, mixed input to layout. To achieve these goals, the input format should accept both layout and stick diagram. The corner stitch data structure is used to represent the unified input and output. A new algorithm for area updating of the corner stitch data structure is presented using non-recursive area enumeration. The system consists of three stages: node extraction, constraint generation, and resolution. As a result, the system can be used to apply the new design rules to the existing layouts and to extract the stick diagram from the final layout, as well as to translate the stick diagram into the final layout.
  • Incremental Layout System is proposed to utilize the previous calculation results for the minor changes in design cycles. In order to limit the search space, the plane generation algorithm is presented. Each stage of GPLS includes incremental algorithms. The incremental approach takes advantage of the maximal horizontal property of the data structure to generate the necessary constraint graph.
Type of Resource
text
Permalink
http://hdl.handle.net/2142/23034
Copyright and License Information
Copyright 1994 Cynn, Myong Heon

Owning Collections

Graduate Dissertations and Theses at Illinois PRIMARY
Graduate Theses and Dissertations at Illinois
Dissertations and Theses - Computer Science
Dissertations and Theses from the Dept. of Computer Science