Browse Prior Art Database

Procedure for Windowing VLSI Graphics Data

IP.com Disclosure Number: IPCOM000064778D
Original Publication Date: 1985-Sep-01
Included in the Prior Art Database: 2005-Feb-19

Publishing Venue

IBM

Related People

Authors:
Downey, JH [+details]

Abstract

By means of a new graphics algorithm, partitioning of graphic layout data into arbitrary windows for checking purposes, while avoiding false errors which would otherwise be produced, is described. A graphics window is a symbolic polygon used to partition graphics data. Any graphics data which touches the window is the data which is to be analyzed. All other non-touching graphics data is disregarded by the windowing function. Present windowing solves the CPU time and region problems caused by the huge increase in data volume required in chip design of recent years, but it leaves "Jagged" edges which cause false error messages when VLSI checking programs are executed. The following illustrates a false error message induced by a "Jagged" edge. The groundrule states: Width of level A is 3 units.