ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Visualization of color image quantization using pairwise clustering
Full text PdfPdf (233 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the fourteenth annual symposium on Computational geometry table of contents
Minneapolis, Minnesota, United States
Pages: 407 - 408  
Year of Publication: 1998
ISBN:0-89791-973-4
Authors
Luiz Velho  IMPA-Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina, 110, Rio de Janeiro, Brazil
Jonas Gomes  IMPA-Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina, 110, Rio de Janeiro, Brazil
Marcos Vinicius Rayol Sobreiro  IMPA-Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina, 110, Rio de Janeiro, Brazil and PUC-Rio, Pontifíca Universidade Católica, Rio de Janeiro, Brazil
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 23,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/276884.276931
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Spath. Cluster Analysis Algorithms. Halsted Press, 1980.
 
2
Luiz Vellao, Jonas Gomes, and Marcos R. Sobreiro. Color image quantization by pairwise clustering. In L. H. de Figueiredo and M. L. Netto, editors, X brazilian symposium of computer graphics and image processhtg, pages 203-210, Campos do Jordao, SP, October 1997. IEEE Computer Society, Los Alamitos, CA.
 
3
Steve J. Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153-174, 1987.

CITED BY  2
Y. Sirisathitkul , S. Auwatanamongkol , B. Uyyanonvara, Color image quantization using distances between adjacent colors along the color axis with highest color variance, Pattern Recognition Letters, v.25 n.9, p.1025-1043, 2 July 2004
Marshall Bern , David Eppstein, Optimized color gamuts for tiled displays, Proceedings of the nineteenth annual symposium on Computational geometry, June 08-10, 2003, San Diego, California, USA

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  I. Computing Methodologies
  I.3 COMPUTER GRAPHICS
      I.3.5 Computational Geometry and Object Modeling
          Subjects: Geometric algorithms, languages, and systems


General Terms:
Algorithms

Collaborative Colleagues:
Luiz Velho: colleagues
Jonas Gomes: colleagues
Marcos Vinicius Rayol Sobreiro: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player