Browse Prior Art Database

Method of Preparing a Set of Graphical Shapes for Quick Searching Based on Physical Proximity

IP.com Disclosure Number: IPCOM000040171D
Original Publication Date: 1987-Oct-01
Included in the Prior Art Database: 2005-Feb-02

Publishing Venue

IBM

Related People

Authors:
DeCamp, WF DeMaris, DL [+details]

Abstract

Efficient proximity searching is achieved by an array approach to shape classification based on a computed center point and radius for each shape. Thus, given any one shape, its nearest neighbors can be found very quickly. An array is allocated with the number of dimensions matching the number of shape dimensions, i.e., a two-dimensional array for a two- dimensional shape. Each element of the array is an address of one or (Image Omitted) more shapes. This address could be a disk address, a main memory address, or an array index. Optimal size of each dimension is computed from total size of the design, but at some fraction of the granularity. Thus, each element represents a physical area. As the program flowchart (Fig.