Aspects of computational geometry in gamut mapping implementations

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.