skip to main content
10.1145/383259.383327acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
Article

Simulating decorative mosaics

Published:01 August 2001Publication History

ABSTRACT

This paper presents a method for simulating decorative tile mosaics. Such mosaics are challenging because the square tiles that comprise them must be packed tightly and yet must follow orientations chosen by the artist. Based on an existing image and user-selected edge features, the method can both reproduce the image's colours and emphasize the selected edges by placing tiles that follow the edges. The method uses centroidal voronoi diagrams which normally arrange points in regular hexagonal grids. By measuring distances with an manhattan metric whose main axis is adjusted locally to follow the chosen direction field, the centroidal diagram can be adapted to place tiles in curving square grids instead. Computing the centroidal voronoi diagram is made possible by leveraging the z-buffer algorithm available in many graphics cards.

References

  1. 1.Deussen O., Hiller, S., va Overveld, C. and Strothotte T. Floating Points: A Method for Computing Stipple Drawings. Eurographics 00 19:3.Google ScholarGoogle Scholar
  2. 2.Du, Q., Faber, V. and Gunzburger, M. Centroidal Voronoi Tessellations: Applications and Algorithms. SIAM Review 41 (1999): 637-676. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Finkelstein, A. and Range, M., Image Mosaics, in Roger D. Hersch, Jacques Andre, and Heather Brown (eds.), Electronic Publishing, Artistic Imaging and Digital Typography, Proceedings of the EP98 and RIDT'98 Conferences, St Malo: March 30 - April 3, 1998, Lecture Notes in Computer Science Series, number 1375, Heidelberg: Springer-Verlag 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Haeberli, P. Paint by Numbers. SIGGRAPH '90 207-214. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Hertzmann, A. Painterly Rendering with Curved Brush Strokes of Multiple Sizes. SIGGRAPH 98: 453-460. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Hoff, K., Keyser, J., Lin, M., Manocha, D. and Culver, T. Fast Computation of Generalized Voronoi Diagrams Using Graphics Hardware. SIGGRAPH 99: 277-286. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.Kaplan, C. and Salesin, D. Escherization. SIGGRAPH 00: 499-510. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.Hetherington, P. Mosaics London: Paul Hamlyn, 1967.Google ScholarGoogle Scholar
  9. 9.Li, Z. and Milenkovic, V. Compaction and Separation Algorithms for Nonconvex Polygons and Their Applications. European Journal of Operations Research 84(1995): 539-561.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.Lloyd, S. Least Square Quantization in PCM. IEEE Transactions on Information Theory 28(1982): 129-137.Google ScholarGoogle ScholarCross RefCross Ref
  11. 11.Milenkovic, V. Rotational Polygon Containment and Minimum Enclosure. Proceedings of the 14th Annual Symposium on Computational Geometry, (June 1998): 1-8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.Silvers, R. and Hawley, M. Photomosaics, New York: Henry Holt, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.Szeliski, R. and Tonnesen, D. Surface modeling with oriented particle systems. SIGGRAPH 92: 185-194. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Simulating decorative mosaics

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques
        August 2001
        600 pages
        ISBN:158113374X
        DOI:10.1145/383259

        Copyright © 2001 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 August 2001

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        SIGGRAPH '01 Paper Acceptance Rate65of300submissions,22%Overall Acceptance Rate1,822of8,601submissions,21%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader