Application of maximum--minimum distance circuits on hypercubes (to pseudo-color graphics displays)
Abstract
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.
- Authors:
- Publication Date:
- Research Org.:
- Sandia Labs., Albuquerque, NM (USA)
- OSTI Identifier:
- 6643610
- Report Number(s):
- SAND-77-1666
- DOE Contract Number:
- EY-76-C-04-0789
- Resource Type:
- Technical Report
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 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
Citation Formats
Simmons, G J. Application of maximum--minimum distance circuits on hypercubes (to pseudo-color graphics displays). United States: N. p., 1978.
Web.
Simmons, G J. Application of maximum--minimum distance circuits on hypercubes (to pseudo-color graphics displays). United States.
Simmons, G J. 1978.
"Application of maximum--minimum distance circuits on hypercubes (to pseudo-color graphics displays)". United States.
@article{osti_6643610,
title = {Application of maximum--minimum distance circuits on hypercubes (to pseudo-color graphics displays)},
author = {Simmons, G J},
abstractNote = {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.},
doi = {},
url = {https://www.osti.gov/biblio/6643610},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Aug 01 00:00:00 EDT 1978},
month = {Tue Aug 01 00:00:00 EDT 1978}
}
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that may hold this item. Keep in mind that many technical reports are not cataloged in WorldCat.
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.