Dismiss
InnovationQ will be updated on Sunday, Jan. 21, from 9am - 11am ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

# Optimized Point Selection Process

IP.com Disclosure Number: IPCOM000036841D
Original Publication Date: 1989-Nov-01
Included in the Prior Art Database: 2005-Jan-29
Document File: 3 page(s) / 27K

IBM

## Related People

Boorom, KF: AUTHOR

## Abstract

This invention relates to a method for obtaining a discrete, best-fit continuum color space using a two-pass process for ascertaining the closest one of a set of spatially distributed points to an arbitrary point. The coordinates of each point in the set and the arbitrary point are known a priori. The two-pass process permits (a) the sorting of points (coarse stage), and (b) executing a fast path to the minimal distance point (fine stage).

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 3

Optimized Point Selection Process

This invention relates to a method for obtaining a discrete, best-fit continuum color space using a two-pass process for ascertaining the closest one of a set of spatially distributed points to an arbitrary point. The coordinates of each point in the set and the arbitrary point are known a priori. The two-pass process permits
(a) the sorting of points (coarse stage), and (b) executing a fast path to the minimal distance point (fine stage).

In the coarse stage, the method attempts to select a predetermined point from the set of otherwise static points which is close to the arbitrary or objective point. In the fine stage, the method uses this selected point to determine the ultimate point closest to the arbitrary or objective point.

Given a point P, any other point not at point P can be said to be in a quadrant relative to point P. Graphically, this can be represented as follows:

(Image Omitted)

The numbering of the quadrants is the same as the numbering convention used in most mathematics texts.

Here, A and F are first quadrant points of P, B and E are second quadrant points of P, C is a third quadrant point of P, and D is a fourth quadrant point of P. Points are arbitrarily assigned on the coordinate axis to the quadrant immediately counterclockwise, so G is a first quadrant point of P.

Initialization: In the initialization stage, the routine examines each "static point" and searches for four other static points, one in each quadrant relative to the original static point, which are closest to the original static point. Thus, for a static point SP', the routine determines which other static point in the first quadrant relative to SP' is closest to SP'. It performs a similar operation for the three other quadrants.

The Coarse Stage: In the coarse stage, the routine attempts to locate a point near the "objective point". It does this with the following logic: (1) Assume that all static points have not yet been

examined.

(2) Begin with any static point SP'.

(3) Repeat the following until a point SP' is

encountered that has already been examined.

(a) Determine the quadrant "q" of the objective

point relat...