Optimized color gamuts for tiled displays

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2003, Pages 274-281

  Bern, Marshall ^a   Eppstein, David ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b Ringgold Standard Institution Informatics   (United States)

Author keywords

Additive color; Color gamuts; Gamut mapping; Geometric optimization; High resolution display systems; Quasiconvex programming; Tiled displays

Indexed keywords

ALGORITHMS; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING;

QUASICONVEX PROGRAMMING;

DISPLAY DEVICES;

EID: 0037700437     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/777792.777834     Document Type: Conference Paper

References (23)

1. P. K. Agarwal, S. Har-Peled, M. Sharir, and K. R. Varadarajan. Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44(4):567-584, July 1997.
2. P. K. Agarwal, M. Sharir, and S. Toledo. Applications of parametric searching in geometric optimization. J. Algorithms 17(3):292-318, 1994.
3. A. Aggarwal and J. Park. Notes on searching in multidimensional monotone arrays. Proc. 29th IEEE Symp. Foundations of Computer Science, pp. 497-512, 1988.
4. N. Amenta, M. W. Bern, and D. Eppstein. Optimal point placement for mesh smoothing. J. Algorithms 30(2):302-322, February 1999, arXiv:cs.CG/9809081.
5. M. W. Bern and D. Eppstein. Optimal Möbius transformations for information visualization and meshing. Proc. 7th Worksh. Algorithms and Data Structures, pp. 14-25. Springer-Verlag, Lecture Notes in Computer Science 2125, August 2001, arXiv:cs.CG/0101006.
6. J. E. Boyce, D. P. Dobkin, R. L. Drysdale, and L. J. Guibas. Finding extremal polygons. SIAM J. Computing 14(134-147), 1985.
7. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom. 10:377-409, 1993.
8. R. M. Dudley. Metric entropy of some classes of sets with differentiable boundaries. J. Approximation Theory 10:227-236, 1974.
9. D. Eppstein. Zonohedra and zonotopes. Mathematica in Education and Research 5(4):15-21, 1996.
10. J. Y. Hardeberg and F. Schmitt. Color printer characterization using a computational geometry approach. Proc. 5th Color Imaging Conf., pp. 96-99. Soc. for Imaging Science and Technology and Soc. for Information Display, November 1997, http://www-ima.enst.fr/̃hardeber/work/CIC1997/cicl997.html.
11. G. Humphreys and P. Hanrahan. A distributed graphics system for large tiled displays. Proc. IEEE Visualization '99, 1999, http://graphics.stanford.edu/papers/mural_design/mural_design.pdf.
12. M. Inaba, N. Katoh, and H. Imai. Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. Proc. 10th ACM Symp. Computational Geometry, pp. 332-339, 1994.
13. K. Li, H. Chen, Y. Chen, D. W. Clark, P. Cook, S. Damianakis, G. Essl, A. Finkelstein, T. Funkhouser, A. Klein, Z. Liu, E. Praun, R. Samanta, B. Shedd, J. P. Singh, G. Tzanetakis, and J. Zheng. Early experiences and challenges in building and using a scalable display wall system. IEEE Computer Graphics & Appl. 20(4):671-680, 2000, http://www.cs.princeton.edu/omnimedia/papers/cga00.pdf.
14. A. Majumder, Z. He, H. Towles, and G. Welch. Achieving color uniformity across multi-projector displays. Proc. IEEE Visualization 2000, 2000, http://www.cs.unc.edu/̃welch/media/pdf/vis00_color.pdf.
15. J. Matoušek, M. Sharir, and E. Welzl. A subexponential bound for linear programming. Algorithmica 16(4-5):498-516, 1996, http://www.math.tau.ac.il/̃sharir/subex.ps.
16. P. McMullen. The maximum number of faces of a convex polytope. Mathematika 17:179-184, 1970.
17. P. McMullen and G. C. Shephard. Convex polytopes and the upper bound conjecture. Cambridge Univ. Press, 1971.
18. J. L. Power, B. S. West, E. J. Stollnitz, and D. H. Salesin. Reproducing color images as duotones. Proc. SIGGRAPH '96, pp. 237-248. ACM, 1996, http://grail.cs.washington.edu/projects/duotone/.
19. R. Raskar, M. S. Brown, R. Yang, W.-C. Chen, G. Welch, H. Towles, B. Seales, and H. Fuchs. Multi-projector displays using camera-based registration. Proc. IEEE Visualization '99, 1999, http://www.cs.unc.edu/Research/ootf/stc/Seamless/.
20. R. Seidel. A convex hull algorithm optimal for point sets in even dimensions. Master's thesis, Univ. of British Columbia, Dept. of Computer Science, 1981.
21. M. Stokes, M. Anderson, S. Chandrasekar, and R. Motta. A standard default color space for the internet - sRGB, http://www.w3.org/Graphics/Color/sRGB.html. Version 1.10, November 1996.
22. M. C. Stone. Color and brightness appearance issues for tiled displays. IEEE Computer Graphics & Appl. 21(5):58-66, 2001, http://graphics.stanford.edu/papers/tileddisplays/.
23. L. Velho, J. Gomes, and M. V. R. Sobreiro. Visualization of color image quantization using pairwise clustering. Proc. 14th ACM Symp. Computational Geometry, pp. 407-408, 1998.