Continuous Model Synthesis Paul Merrell and Dinesh Manocha In SIGGRAPH Asia 2008 발표 : 이성호.

Slides:



Advertisements
Similar presentations
Wang Tiles for Image and Texture Generation
Advertisements

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
Autonomic Systems Justin Moles, Winter 2006 Enabling autonomic behavior in systems software with hot swapping Paper by: J. Appavoo, et al. Presentation.
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
ENS 207 engineering graphics
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
CHAPTER 12 Height Maps, Hidden Surface Removal, Clipping and Level of Detail Algorithms © 2008 Cengage Learning EMEA.
1 Enviromatics Spatial database systems Spatial database systems Вонр. проф. д-р Александар Маркоски Технички факултет – Битола 2008 год.
1.  Texturing is a core process for modeling surface details in computer graphics applications › Texture mapping › Surface texture synthesis › Procedural.
Localization of Piled Boxes by Means of the Hough Transform Dimitrios Katsoulas Institute for Pattern Recognition and Image Processing University of Freiburg.
Orthogonal Projection and Multiview Representation
XHTML1 Tables and Lists. XHTML2 Objectives In this chapter, you will: Create basic tables Structure tables Format tables Create lists.
Polygonal Mesh – Data Structure and Smoothing
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Content Subdivision First some basics (control point polygon, mesh)
IE433 CAD/CAM Computer Aided Design and Computer Aided Manufacturing Part-4 Computer Graphics- CAD Software Dr. Abdulrahman M. Al-Ahmari Industrial Engineering.
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
Texture Synthesis from Multiple Sources Li-Yi Wei Stanford University (was) NVIDIA Corporation (now)
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Image Editing Work Pixel-based Methods  Adobe Photoshop, GIMP, SuperGoo.
IE433 CAD/CAM Computer Aided Design and Computer Aided Manufacturing Part-4 Computer Graphics- CAD Software Industrial Engineering Program King Saud University.
Chapter 13 Section Views.
CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.
Fast Texture Synthesis Tree-structure Vector Quantization Li-Yi WeiMarc Levoy Stanford University.
University of Texas at Austin CS 378 – Game Technology Don Fussell CS 378: Computer Game Technology Beyond Meshes Spring 2012.
MS. WILLIAMS Anatomy of a 3D Model. 3D Model 3D Models are one of the essential building blocks of 3D computer graphics. Without them there would be no.
3-D Modeling Concepts V part 2.
V part 2 Obtained from a Guildford County workshop- Summer, 2014.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Clipping Apart from clipping to the view volume, clipping is a basic operation in many other algorithms –Breaking space up into chunks –2D drawing and.
1 Three dimensional mosaics with variable- sized tiles Visual Comput 2008 報告者 : 丁琨桓.
Efficient Editing of Aged Object Textures By: Olivier Clément Jocelyn Benoit Eric Paquette Multimedia Lab.
An Algebraic Model for Parameterized Shape Editing Martin Bokeloh, Stanford Univ. Michael Wand, Saarland Univ. & MPI Hans-Peter Seidel, MPI Vladlen Koltun,
Volumetric Illustration: Designing 3D Models with Internal Textures Shigeru Owada Frank Nielsen Makoto Okabe Takeo Igarashi The University of Tokyo Sony.
SOFTWARE DESIGN AND ARCHITECTURE LECTURE 21. Review ANALYSIS PHASE (OBJECT ORIENTED DESIGN) Functional Modeling – Use case Diagram Description.
Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces.
Part 6: Graphics Output Primitives (4) 1.  Another useful construct,besides points, straight line segments, and curves for describing components of a.
Terrain Synthesis by Digital Elevation Models Howard Zhou, Jie Sun, Greg Turk, and James M. Rehg
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Tinoosh Mohsenin and Bevan M. Baas VLSI Computation Lab, ECE Department University of California, Davis Split-Row: A Reduced Complexity, High Throughput.
MATH 306 Chapter 1.
1 Rendering Geometry with Relief Textures L.Baboud X.Décoret ARTIS-GRAVIR/IMAG-INRIA.
7.1 Three- Dimensional Figures I can classify and draw three-dimensional figures.
Synthesis of Compact Textures for real-time Terrain Rendering Nader Salman 22 juin 2007 Encadrant : Sylvain Lefebvre.
TextureAmendment Reducing Texture Distortion in Constrained Parameterizations Yu-Wing TaiNational University of Singapore Michael S. BrownNational University.
Lapped Solid Textrues Filling a Model with Anisotropic Textures
Towards Real-Time Texture Synthesis With the Jump Map Steve Zelinka Michael Garland University of Illinois at Urbana-Champaign Thirteenth Eurographics.
1 Bounding Iterated Function Systems Orion Sky Lawlor CS 497jch November 14, 2002.
Mesh Quilting For Geometric Texture Synthesis Kun Zhou et al. In SIGGRAPH 2006 발표 이성호 2009 년 4 월 15 일.
Representation and modelling 3 – landscape specialisations 4.1 Introduction 4.2 Simple height field landscapes 4.3 Procedural modeling of landscapes- fractals.
2D Texture Synthesis Instructor: Yizhou Yu. Texture synthesis Goal: increase texture resolution yet keep local texture variation.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
Discontinuous Displacement Mapping for Volume Graphics, Volume Graphics 2006, July 30, Boston, MA Discontinuous Displacement Mapping for Volume Graphics.
Geometry Synthesis Ares Lagae Olivier Dumont Philip Dutré Department of Computer Science Katholieke Universiteit Leuven 10 August, 2004.
Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.
Enhancing Image-Based Aging Approaches Olivier Clément Eric Paquette.
Learning Photographic Global Tonal Adjustment with a Database of Input / Output Image Pairs.
Data-driven Architectural texture mapping Texture mapping Un-textured 3D sceneTextured output Textured Architectures 由于建筑物的3D model和 textures均属于structured.
Raster Data Models: Data Compression Why? –Save disk space by reducing information content –Methods Run-length codes Raster chain codes Block codes Quadtrees.
7.1 Three- Dimensional Figures I can classify and draw three-dimensional figures.
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).
3-D Modeling Concepts V part 2.
Graphcut Textures:Image and Video Synthesis Using Graph Cuts
3-D Modeling Concepts V part 2.
10-1: Introduction to Solids
3-D Modeling Concepts V part B.
Lecture 13 Clipping & Scan Conversion
3-D Modeling Concepts V part 2.
3-D Modeling Concepts Part 2.
Presentation transcript:

Continuous Model Synthesis Paul Merrell and Dinesh Manocha In SIGGRAPH Asia 2008 발표 : 이성호

Abstract Input: 3D polyhedral model –Exploits the connectivity between the adjacent boundary features of the input model Output: –A model that has similar connected features and resembles the input Algorithm proceeds automatically Our algorithm –Is simple to implement –Can generate a variety of complex shapes

Introduction Automatically modeling complex shapes –3D CAD and modeling tools limited in terms of generating complex models can be cumbersome to use Procedural modeling techniques –shape grammars, scripting languages, L- systems, fractals, or solid texturing limited to a specific class of models require considerable user input or guidance

Approach Enumerates multiple configurations of –each vertex, edge, and face –discards any configurations that do not satisfy the constraints Runtime performance –depends on the number of distinct normal directions of the input faces

Benefits Simplicity –Simple to use –Proceeds automatically Generality –Can generate a wide variety of complex shapes Architectural buildings, landscapes, terrains and fractal shapes Efficiency –Generates complex shapes in only a few minutes

Related work L-systems Prusinkievicz et al. 2001

Fractals Musgrave et al. 1989

Split grammars Wonka et al. 2003

Creating truss structures Smith et al. 2002

Cellular texturing Legakis 2001

Texture synthesis Efros and Leung 1999; Wei and Levoy 2000; Efros and Freeman 2001; Kwatra et al –What a sophisticated! Doretto et al. 2003; Kwatra et al –Time-varying textures Kopf et al –3D solid textures

Model synthesis Merrell 2007

Algorithm

Adjacency Constraint

Finding valid states Lines parallel to the input shape (a), divide the plane into faces, edges, and vertices (c). The output shape (d) is formed within the parallel lines. The set of acceptable vertex and edges states in the output (d) can be found by dividing the input along parallel lines (b).

Backtracking issue Incorrect assignment –possible assignments C(m) to become empty –It must backtrack –Modify small parts of the space as shown in Figure 7 Modifying volume of 10 x 10 x 10 or smaller –our algorithm almost always succeeds A solution can always be found

Generating 3D models

Figure 11: From the input example model (left) many arches are synthesized (right). The output contains interesting new variations not found in the input such as structures with multiple arches and arches passing over arches (insets).

Synthesis time

Analysis and comparison Shape grammars –[Muller et al. 2006, Wonka et al. 2003] –user must specific –and adjust many production rules Our approach –user only needs to specify an input model

Limitations time and memory requirements –If m parallel planes are generated –for each of n distinct normals, –O(n 3 m 3 ) vertices Difficult to generate objects at different scales –Creating many architectural details Unable to control –could be improved by imposing additional constraints The size and distribution of the objects –An object must have a particular width or height

Conclusion and future work Automatically modeling large complex shapes –Resemble simple models provided by the user The input model need not be axis aligned Not handled properly –More than three faces intersecting at a vertex –Constrain some objects To be a fixed discrete size