Share Email Print

Proceedings Paper

Aspects of computational geometry in gamut mapping implementations
Author(s): Dennis Küpper; Klaus Simon
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Even though gamut mapping (GM) is a three-dimensional polyhedron problem, algorithmically it is usually not treated as such. This is due to tight runtime constraints in practice, which suggest simple algorithms. We will show that basic geometric operations, like the intersection of a ray with the gamut surface, can be implemented very efficiently for typical GM applications that work with device gamuts. This opens up new possibilities to design algorithms without reducing their practicability.

Paper Details

Date Published: 18 January 2010
PDF: 10 pages
Proc. SPIE 7528, Color Imaging XV: Displaying, Processing, Hardcopy, and Applications, 75280J (18 January 2010); doi: 10.1117/12.838976
Show Author Affiliations
Dennis Küpper, EMPA (Switzerland)
Klaus Simon, EMPA (Switzerland)

Published in SPIE Proceedings Vol. 7528:
Color Imaging XV: Displaying, Processing, Hardcopy, and Applications
Reiner Eschbach; Gabriel G. Marcu; Shoji Tominaga; Alessandro Rizzi, Editor(s)

© SPIE. Terms of Use
Back to Top