Application of maximum--minimum distance circuits on hypercubes (to pseudo-color graphics displays)

Technical Report · Tue Aug 01 00:00:00 EDT 1978

OSTI ID:6643610

Simmons, G J

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.

• Research Organization: Sandia Labs., Albuquerque, NM (USA)
• DOE Contract Number: EY-76-C-04-0789
• OSTI ID: 6643610
• Report Number(s): SAND-77-1666
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
COMPUTER GRAPHICS
TOPOLOGICAL MAPPING
OPTIMIZATION
COLOR
LIMITING VALUES
MANY-DIMENSIONAL CALCULATIONS
TOPOLOGY
MATHEMATICS
OPTICAL PROPERTIES
ORGANOLEPTIC PROPERTIES
PHYSICAL PROPERTIES
TRANSFORMATIONS
990200* - Mathematics & Computers