Aspects of computational geometry in gamut mapping implementations

Dennis Küpper; Klaus Simon

doi:10.1117/12.838976

18 January 2010 Aspects of computational geometry in gamut mapping implementations

Dennis Küpper, Klaus Simon

Proceedings Volume 7528, Color Imaging XV: Displaying, Processing, Hardcopy, and Applications; 75280J (2010) https://doi.org/10.1117/12.838976
Event: IS&T/SPIE Electronic Imaging, 2010, San Jose, California, United States

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.

Citation Download Citation

Dennis Küpper and Klaus Simon "Aspects of computational geometry in gamut mapping implementations", Proc. SPIE 7528, Color Imaging XV: Displaying, Processing, Hardcopy, and Applications, 75280J (18 January 2010); https://doi.org/10.1117/12.838976

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available