Application of Maximum--Minimum Distance Circuits on Hypercubes (To Pseudo-Color Graphics Displays)

摘要

The related questions of finding Hamilton circuits in the n-dimensional cube with d points on an edge which maximize the minimum ''taxicab'' distance between successive vertices and/or which maximize the sum of such distances over the entire circuit is investigated. A ''good'' bound for the first quantity and an achievable limit for the second are developed, and several optimal constructions, found. Both of these circuits are solutions to one formulation of the problem of designing pseudo-color graphics displays in which minimal grey scale differences become maximal color differences. 5 figures, 3 tables. (ERA citation 04:002130)