1 Three dimensional mosaics with variable- sized tiles Visual Comput 2008 報告者 : 丁琨桓.

Slides:



Advertisements
Similar presentations
Simulating Decorative Mosaics Alejo Hausner University of Toronto.
Advertisements

Simulating Decorative Mosaics Alejo Hausner University of Toronto [SIGGRAPH2001]
Three-dimensional Shapes (3D)
Definitions A circle is the set of all points in a plane that are equidistant from a given point called the center of the circle. Radius – the distance.
Definitions A circle is the set of all points in a plane that are equidistant from a given point called the center of the circle. Radius – the distance.
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Movement-Assisted Sensor Deployment Author : Guiling Wang, Guohong Cao, Tom La Porta Presenter : Young-Hwan Kim.
ATEC Procedural Animation Introduction to Procedural Methods in 3D Computer Animation Dr. Midori Kitagawa.
Extended Gaussian Images
Constructions Day 1. Now for some vocabulary  Angle: the union of two distinct rays that have a common end point  Vertex: the common end point of an.
Computer Graphics Viewing.
Circles Chapter 10.
Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.
Lecture 3 Jack Tanabe Old Dominion University Hampton, VA January 2011 Conformal Mapping.
Discrete geometry Lecture 2 1 © Alexander & Michael Bronstein
Particle Systems 1 Adapted from: E. Angel and D. Shreiner: Interactive Computer Graphics 6E © Addison-Wesley 2012.
Image Quilting for Texture Synthesis and Transfer Alexei A. Efros1,2 William T. Freeman2.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Jigsaw Image Mosaics - Junhwan Kim and Fabio Pellacini Junhwan Kim and Fabio Pellacini Cornell University.
1 University of Denver Department of Mathematics Department of Computer Science.
Tangents to Circles (with Circle Review)
GEOMETRY.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Shape Blending Joshua Filliater December 15, 2000.
In the name of God Computer Graphics Modeling1. Today Introduction Modeling Polygon.
Introduction Tracking the corners Camera model and collision detection Keyframes Path Correction Controlling the entire path of a virtual camera In computer.
Angles and Phenomena in the World
The Geometry of Solids Section 10.1.
Computer Graphics Lecture 1 July 11, Computer Graphics What do you think of? The term “computer graphics” is a blanket term used to refer to the.
Multiscale Moment-Based Painterly Rendering Diego Nehab and Luiz Velho
1 3D virtual mosaics: Opus Palladium and mixed styles Visual Comput 2009 報告者 : 丁琨桓.
Introduction to congruent angles
Scalable and Fully Distributed Localization With Mere Connectivity.
VIS Group, University of Stuttgart Tutorial T4: Programmable Graphics Hardware for Interactive Visualization Adaptive Terrain Slicing (Stefan Roettger)
A 3D Model Alignment and Retrieval System Ding-Yun Chen and Ming Ouhyoung.
Particle Filters for Shape Correspondence Presenter: Jingting Zeng.
Review of Two-Scale Particle Simulation Paper by: Barbara Solenthaler ETH Zurich Markus Gross ETH Zurich.
3D polygonal meshes watermarking using normal vector distributions Suk-Hawn Lee, Tae-su Kim, Byung-Ju Kim, Seong-Geun Kwon.
SACE Stage 1 Physics Electric Fields. Introduction Consider two charges, the force between the two charged bodies is inversely proportional to the square.
A survey of different shape analysis techniques 1 A Survey of Different Shape Analysis Techniques -- Huang Nan.
1 Surface mosaics Visual Comput 2006 報告者 : 丁琨桓. 2 Introduction Mosaics are an art form with a long history: many examples are known from Graeco- Roman.
Controlling a Virtual Camera Ross Ptacek University of Alabama Birmingham.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
CS 325 Introduction to Computer Graphics 03 / 29 / 2010 Instructor: Michael Eckmann.
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
Representation and modelling 3 – landscape specialisations 4.1 Introduction 4.2 Simple height field landscapes 4.3 Procedural modeling of landscapes- fractals.
12.1 Exploring Solids.
I go on and on in both directions What am I?. A line.
Attributes A quality that is characteristic of someone or something.
Single Pass Point Rendering and Transparent Shading Paper by Yanci Zhang and Renato Pajarola Presentation by Harmen de Weerd and Hedde Bosman.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Real Time Nonphotorealistic Rendering. How to achieve real time NPR? Economy of line: present a lot of information with very few strokes. Silhouettes.
Detection of closed sharp edges in point clouds Speaker: Liuyu Time:
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 10, 2015 TRIANGLE MESHES 3D MESHES MESH OPERATIONS.
1 L p Centroidal Voronoi Tessellation and its Applications Published in Siggraph 2010 報告者 : 丁琨桓.
Geometry. Points Lines Planes A ______ is an exact location in space. point.
GEOMETRY CHAPTER 11 SUMMARY. Three-dimensional figures, or solids, can be made up of flat or curved surfaces. Each flat surface is called a face. An edge.
Introduction to 3D Solids and Solids of Revolution Some 3D shapes can be formed by revolving a 2D shape around a line (called the axis of revolution).
Bigyan Ankur Mukherjee University of Utah. Given a set of Points P sampled from a surface Σ,  Find a Surface Σ * that “approximates” Σ  Σ * is generally.
Simulating Decorative Mosaics Based on SIGGRAPH ‘01 paper by Alejo Hausner Final Project.
Image-Guided Fracture David Mould University of Saskatchewan.
plane shape A shape in a plane that is formed by curves, line segments, or both. These are some plane figures 12.1.
Mingze Zhang, Mun Choon Chan and A. L. Ananda School of Computing
Bitmap Image Vectorization using Potrace Algorithm
Go Math Grade 3 Chapter 12 Two-Dimensional Shapes
Curl and Divergence.
CSC461: Lecture 23 Shading Computation
Presentation transcript:

1 Three dimensional mosaics with variable- sized tiles Visual Comput 2008 報告者 : 丁琨桓

2 Introduction Three dimensional mosaics, or surface mosaics, are a beautiful art form where a sculpture is made from putting together tiles on a given shape.

3 Previous work In computer graphics 2D mosaics have been fully explored. centroidal Voronoi diagram

4 Previous work 3D mosaics are much harder since the tiles have to be positioned on the surface of a non-planar object being decorated. If the shape is complex, adequate tile positioning is a real challenge.

5 Previous work [Surface mosaics,2006] addressed the problem of mosaics with tiles of the same size. Using the same tile size for the whole surface is not the best choice, since this size could be too big for some locations with high curvature.

6 Algorithm Step1: Tiles are initially distributed randomly over the surface Higher curvature places with higher density of bigger tiles Smaller curvature places with fewer bigger tiles Step2: relaxation procedure move tiles away from one another, leaving some gap for grout and avoiding collisions among tiles. Step3: rendering specific effects achieve a more realistic result

7 Evaluating curvatures using model vertex data [ Re-tiling polygonal surfaces, SIGGRAPH 1992 ] The method gives a good approximation of the exact curvature, using only the model’s polygonal data. For each vertex the method finds an associated curvature of this vertex with respect to all edges connected to it.

8 Evaluating curvatures using model vertex data Approximation of the curvature in 2D The radius of curvature r : r = tan(θ)|P-A|/2 Point C bisects the Angle APB In 3D the normal vector at P approximates the line segment PC. The term θ is estimated with the dot product between a normalized vector A – P and the normal vector at P.

9 Evaluating curvatures using model vertex data Radius of curvature (Rc) in the plane Red is mapped to vertices of higher curvature whereas blue is mapped to relatively flat regions

10 Mapping curvatures into tile size A : the total area of the object’s surface 2h : the average tile size and h is half this size N : user-specified number of tiles h : half the tile size r : the radius of the circle

11 Mapping curvatures into tile size Function for mapping curvatures into tile sizes

12 Distributing random points on the surface of a polyhedral model distributed randomly over the surface polygon capacity Ai : the area of polygon i rc i : the polygon radius of curvature f : the mapping function

13 Distributing random points on the surface of a polyhedral model Polygons with higher curvature, i.e., smaller radius of curvatures, will receive more tiles. distributed randomlydistributed with capacity function

14 Relaxation of points on the surface of the model move the tiles away from each other, to avoid intersections using a repulsive force repulsive force is proportional to tile size, such that small tiles will concentrate in strongly curved places, and big tiles will push smaller ones to curved regions f = K f * ( 1 – d/(r 1 + r 2 ))

15 Relaxation of points on the surface of the model f = K f * ( 1 – d/(r 1 + r 2 )) d is the distance between the particles r 1 and r 2 are the radii of the ideal circles around the tile. r : the radius of the circle

16 Relaxation of points on the surface of the model f = Kf * ( 1 – d/(r1 + r2)) dd r1r1 r2r2 r1r1 r2r2 f > 0f < 0

17 Adjusting the orientation of the tiles [ Texture Synthesis on Surfaces, SIGGRAPH 2001 ] Vector field

18 Rendering To make the results more visually appealing to the user, the final shape of the tiles may be controlled by four parameters Square tiles, turned into general quadrilateral tiles

19 Rendering Comparison of tiles with and without random variation in the shape. Random variables U1, U2, V1, and V2 with values between 85% and 115% of h

20 Result # of tiles :7000 Ts min : 0.4h Ts max : 3.15h Rc min : 0 Rc max : 25h

21 Result # of tiles :7000 Ts min : 0.1h Ts max : 2.3h Rc min : 0.5 Rc max : 20h

22 Result Effect of varying the size of tiles ( number of tiles : 4000)

23 Comparison Comparison with previous result from [surface mosaic] surface mosaicmosaics with variable-sized tiles

24 Conclusion This paper presented a solution efficiently computes the distribution, placement and rendering of tiles Author plan to extend this work by allowing tiles of variable shapes, not only squares.