Simulating Decorative Mosaics Alejo Hausner University of Toronto.

Slides:



Advertisements
Similar presentations
Generating Classic Mosaics with Graph Cuts Y. Liu, O. Veksler and O. Juan University of Western Ontario, Canada Ecole Centrale de Paris, France.
Advertisements

Simulating Decorative Mosaics Alejo Hausner University of Toronto [SIGGRAPH2001]
Lecture 8 Transparency, Mirroring
L1 sparse reconstruction of sharp point set surfaces
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Regional Processing Convolutional filters. Smoothing  Convolution can be used to achieve a variety of effects depending on the kernel.  Smoothing, or.
WSCG 2007 Hardware Independent Clipmapping A. Seoane, J. Taibo, L. Hernández, R. López, A. Jaspe VideaLAB – University of A Coruña (Spain)
KIM TAEHO PARK YOUNGMIN.  Curve Reconstruction problem.
Week 10 - Monday.  What did we talk about last time?  Global illumination  Shadows  Projection shadows  Soft shadows.
1 Texture Texture is a description of the spatial arrangement of color or intensities in an image or a selected region of an image. Structural approach:
CHAPTER 12 Height Maps, Hidden Surface Removal, Clipping and Level of Detail Algorithms © 2008 Cengage Learning EMEA.
Grape Detection in Vineyards Ishay Levi Eran Brill.
The Voronoi Diagram David Johnson. Voronoi Diagram Creates a roadmap that maximizes clearance –Can be difficult to compute –We saw an approximation in.
COMPUTER GRAPHICS CS 482 – FALL 2014 OCTOBER 6, 2014 TEXTURE MAPPING TEXTURES BUMP MAPPING ENVIRONMENT MAPPING PROCEDURAL TEXTURING.
Discrete geometry Lecture 2 1 © Alexander & Michael Bronstein
The Viola/Jones Face Detector (2001)
Technion Faculty of Electrical Engineering Project A Summer 2001 Israel Institute of Technology.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
Jigsaw Image Mosaics - Junhwan Kim and Fabio Pellacini Junhwan Kim and Fabio Pellacini Cornell University.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Adrian Ilie Jigsaw Image Mosaics Junhwan Kim, Fabio Pellacini (Cornell University) Siggraph 2002.
Circle Drawing algo..
Hidden Surface Removal
Filtering Approaches for Real-Time Anti-Aliasing /
1 Three dimensional mosaics with variable- sized tiles Visual Comput 2008 報告者 : 丁琨桓.
University of Illinois at Chicago Electronic Visualization Laboratory (EVL) CS 426 Intro to 3D Computer Graphics © 2003, 2004, 2005 Jason Leigh Electronic.
01/28/05© 2005 University of Wisconsin Last Time Improving Monte Carlo Efficiency.
Tilings of a plane Meenal Tayal.
Multiscale Moment-Based Painterly Rendering Diego Nehab and Luiz Velho
1 3D virtual mosaics: Opus Palladium and mixed styles Visual Comput 2009 報告者 : 丁琨桓.
10/26/04© University of Wisconsin, CS559 Fall 2004 Last Time Drawing lines Polygon fill rules Midterm Oct 28.
10-4 Surface Areas of Pyramids
Geometry, Patterns and Art
10-4 Surface Areas of Pyramids and Cones
Emerging Technologies for Games Alpha Sorting and “Soft” Particles CO3303 Week 15.
“Waterfall,” 1961 by M.C. Escher. Tessellations are designs featuring animals, shapes, birds, etc, which can fill the page, without over-lapping, to form.
Abstract Very important field of research in image processing is the ultrasound image processing. Because of the speckels, that are caused during the.
Tessellations A tessellation is the tiling of a plane using one or more geometric shapes. An important part of any tessellation is that there must be no.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
Vector Graphics Multimedia Technology. Object Orientated Data Types Created on a computer not by sampling real world information Details are stored on.
Voronoi Diagram (Supplemental)
1 Surface mosaics Visual Comput 2006 報告者 : 丁琨桓. 2 Introduction Mosaics are an art form with a long history: many examples are known from Graeco- Roman.
03/28/03© 2005 University of Wisconsin NPR Today “Comprehensible Rendering of 3-D Shapes”, Takafumi Saito and Tokiichiro Takahashi, SIGGRAPH 1990 “Painterly.
Section 12.3 Notes.
Stipple Placement using Distance in a Weighted Graph David Mould University of Saskatchewan.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Its now time to see the light…..  A lens is a curved transparent material that is smooth and regularly shaped so that when light strikes it, the light.
Computer Graphics Rendering 2D Geometry CO2409 Computer Graphics Week 2.
Duy & Piotr. How to reconstruct a high quality image with the least amount of samples per pixel the least amount of resources And preserving the image.
Lesson 9-R Chapter 9 Review. Objectives Review chapter 9 material.
Classification Course web page: vision.cis.udel.edu/~cv May 14, 2003  Lecture 34.
Convex hulls in 3D Maciej Kot. Finding convex hull Given a set of points, find a convex hull that contains all of them and is minimal.
Iteration The solution lies between 0 and 1. e.g. To find integer bounds for we can sketch and  0 and 1 are the integer bounds. We often start by finding.
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Processing Images and Video for An Impressionist Effect Automatic production of “painterly” animations from video clips. Extending existing algorithms.
Simulating Decorative Mosaics Based on SIGGRAPH ‘01 paper by Alejo Hausner Final Project.
Tessellations Starting slide….
Image-Guided Fracture David Mould University of Saskatchewan.
A Look Into Photorealistic and Non-Photorealistic Rendering
10-4 Surface Areas of Pyramids
Haim Kaplan and Uri Zwick
Real-time Rendering Shadow Maps
Diffusion Curves Dr. Scott Schaefer.
Clustering 77B Recommender Systems
10-4 Surface Areas of Pyramids
Distributed Ray Tracing
Reporter: Wenkai Cui Institution: Tsinghua University Date:
Volume 4, Issue 2, Pages (February 1996)
Presentation transcript:

Simulating Decorative Mosaics Alejo Hausner University of Toronto

Simulating Decorative Mosaics2 Mosaic Tile Simulation Reproduce mosaic tiles –long-lasting (graphics is ephemeral) –realism with very few pixels –pixels have orientation

Simulating Decorative Mosaics3 Real Tile Mosaics

Simulating Decorative Mosaics4 Real Mosaics II

Simulating Decorative Mosaics5 The Problem Square tiles cover the plane perfectly Variable orientation --> loose packing Opposing goals: –non-uniform grid –dense packing

Simulating Decorative Mosaics6 Previous Work Romans: algorithm? Relaxation (Haeberli90) –scatter points on image –voronoi region = tile –tiles not square

Simulating Decorative Mosaics7 Previous Work Escherization (Kaplan00) –regular tilings –use symmetry groups Stippling (Deussen01) –voronoi relaxation –round dots

Simulating Decorative Mosaics8 Voronoi Diagrams What are they –sites, and regions closest to each site How to compute them? –Divide & conquer (PS) –sweepline (Fortune) –incremental

Simulating Decorative Mosaics9 Voronoi Diagram

Simulating Decorative Mosaics10 Centroidal Voronoi Diagrams VD sites are not centroids Lloyds method (k-means) –move site to centroid, –recalculate VD –repeat

Simulating Decorative Mosaics11 Centroidal Voronoi Diagrams VD sites are not centroids Lloyds method (k-means) –move site to centroid, –recalculate VD –repeat

Simulating Decorative Mosaics12 Centroidal Voronoi Diagrams VD sites are not centroids Lloyds method (k-means) –move site to centroid, –recalculate VD –repeat

Simulating Decorative Mosaics13 Centroidal Voronoi Diagram

Simulating Decorative Mosaics14 CVD uses Nature: –honeycombs –giraffe spots Sampling –approximates Poisson-disk (low discrepancy) –can bias for filter function

Simulating Decorative Mosaics15 Hardware-assisted VDs SG99: Hoff et al –uses graphics hardware –draw cone at each site –orthogonal view from above –each region is single-coloured –can extend to non-point sites (curves) project

Simulating Decorative Mosaics16 Key idea Cone is distance function –radius = height Non-euclidean distance: –different kind of cone –eg square pyramid –can be non-isotropic (rotate pyramid around Z) r h h=|x-a|+|y-b| (a,b) (x,y) h

Simulating Decorative Mosaics17 Basic Tiling Algorithm Compute orientation field (details later) scatter points on image –use pyramids to get oriented tiles apply Lloyds method to spread sites evenly draw oriented tile at each site

Simulating Decorative Mosaics18 Details Lloyds method: –To compute centroid of each Voronoi region: 1: read back pixels, 2: get average (row,col) per colour 3: convert back to object coords.

Simulating Decorative Mosaics19 Lloyd Near Convergence

Simulating Decorative Mosaics20 Orientation Field Choose edges that need emphasis compute generalized VD for edges (Hoff99) get gradient vector of distance field –distance = z-buffer distance gradient orientation = tile orientation –points away from edges

Simulating Decorative Mosaics21 Orientation Field

Simulating Decorative Mosaics22 Edge Discrimination Must line up tiles on edges But both sides of edge oriented same –square tiles ==> 180 o rotational symmetry Use hardware –draw edge thick, different colour –voronoi regions move away from edges –leaves gap where edge is.

Simulating Decorative Mosaics23 Tiles Straddle Edge

Simulating Decorative Mosaics24 Thick Edge: Centroid Repelled

Simulating Decorative Mosaics25 After 10 Iterations

Simulating Decorative Mosaics26 Original Voronoi Diagram

Simulating Decorative Mosaics27 After 20 Iterations

Simulating Decorative Mosaics28 One Tile per Voronoi Region

Simulating Decorative Mosaics29 Thinner Tiles

Simulating Decorative Mosaics30 Round Tiles

Simulating Decorative Mosaics31 Rhomboidal Tiles

Simulating Decorative Mosaics32 Tiles are not Pixels 4000 pixels 4000 tiles

Simulating Decorative Mosaics33 More Pictures

Simulating Decorative Mosaics34 Painterly Rendering Tile = Paint stroke

Simulating Decorative Mosaics35 Summary New method for packing squares on curvilinear grid Minimizes sum of particle distances

Simulating Decorative Mosaics36 Further Work Reduce grout –final pass: adjust tile shapes currently dont use adjacency info –use divergence of orientation field · Improve colour –real tiles have fixed colour set: Dither? How?