Spacing Points in a Three Dimensional Convex Region for Maximum Separation: A Color-Space Application
Abstract
This report introduces a new method for solving the problem of optimally spacing points in a three-dimensional region so that their distances from each other are as great as possible. One application of the problem deals with color selection for aircraft displays where the colors are plotted as points in a three-dimensional color space and the distance between two points is directly related to the distinguishability of the two colors. The method itself is a heuristic algorithm very similar to one designed by Carter and Carter. The newer algorithm apparently yields similar solutions with fewer runs, but because it is more thorough, it is slower. The program was tested on problems as large as 23 points whose feasible region had seven faces. The major disadvantage of this new method is that, like Carter and Carter's, its solutions are not guaranteed to be optimal . As a result, the user must still perform several replications at various randomly selected starting locations in order to increase the chances of achieving an optimal solution. Algorithm, Color selection, Display, Maximin, Spacing, Color, CRT, Distance, Maximum, Color coding, Discrimination, Heuristic, Optimal
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1985
- Accession Number
- ADA272919
Entities
People
- Ross E. Roley