Dismiss
InnovationQ will be updated on Sunday, Oct. 22, from 10am ET - noon. You may experience brief service interruptions during that time.
Browse Prior Art Database

Nested Cell Measure

IP.com Disclosure Number: IPCOM000046086D
Original Publication Date: 1983-May-01
Included in the Prior Art Database: 2005-Feb-07
Document File: 2 page(s) / 52K

Publishing Venue

IBM

Related People

Boyle, DH: AUTHOR

Abstract

A computer program is disclosed for a computer-assisted design of an integrated circuit, for measuring the distance between points on the images of shapes which are replicated from a single data set for that shape, the locations of the shape images each being defined by a respective image reference point. The figures illustrate the sequence of steps in carrying out the program.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 56% of the total text.

Page 1 of 2

Nested Cell Measure

A computer program is disclosed for a computer-assisted design of an integrated circuit, for measuring the distance between points on the images of shapes which are replicated from a single data set for that shape, the locations of the shape images each being defined by a respective image reference point. The figures illustrate the sequence of steps in carrying out the program.

The purpose of the program is to measure the distance between any two given points on the graphics screen. The difference between this program and any which has gone before it is that the program has the capability of accessing shapes within a nested structure. Referring to the flow diagram of Fig. 4, after the program has been entered, the program then prompts the user in block 2 as to whether or not the shape to be measured is in a different structure. If it is not, then the program comes to block 12. Block 9 is a subroutine, called COORD, which computes which corner the user is trying to access. The subroutine picks the shape which is closest and computes which corner is closest to the spot indicated. This allows the user to indicate a corner on a very large scale. The program then increments the index block 10, and if this is the first time through the loop, it sets the first corner equal to a variable and branches back to the beginning.

The program will now go through the second loop which begins with block 3. If there is a null input, then the program terminates n...