Arthur D Gregory, Andrei State, Ming C Lin,

Slides:



Advertisements
Similar presentations
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Advertisements

3D Morphing using Multiplanar Representation
Extended Gaussian Images
UNC Chapel Hill M. C. Lin Polygon Triangulation Chapter 3 of the Textbook Driving Applications –Guarding an Art Gallery –3D Morphing.
Dual Marching Cubes: An Overview

Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra Arthur D Gregory Andrei State, Ming C Lin, Dinesh Manocha, Mark A.
Martin Isenburg University of North Carolina at Chapel Hill Triangle Fixer: Edge-based Connectivity Compression.
CS6500 Adv. Computer Graphics © Chun-Fa Chang, Spring 2003 Adv. Computer Graphics CS6500, Spring 2003.
Compressing Polygon Mesh Connectivity
Further Programming for 3D applications CE Introduction to Further Programming for 3D application Bob Hobbs Faculty of Computing, Engineering and.
Polygonal Meshes 3D Object Representation -Tyler Abrams.
Subdue Graph Visualizer by Gayathri Sampath, M.S. (CSE) University of Texas at Arlington.
Theodoros Athanasiadis Ioannis Fudos Department of Computer Science
4/19/2000Deepak Bandyopadhyay / COMP239 / inTouch1 Interactive Multiresolution Modeling and 3D Painting with a Haptic Interface Arthur D. Gregory, Stephen.
NUS CS 5247 David Hsu Minkowski Sum Gokul Varadhan.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
Computer Animation Algorithms and Techniques
Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 10: Computer Graphics Computer Science: An Overview Tenth Edition.
3D Morphing.
Computer Graphics Group Tobias Weyand Mesh-Based Inverse Kinematics Sumner et al 2005 presented by Tobias Weyand.
Computer-Aided Design and Manufacturing Laboratory: 3D Minkowski sum computation Sara McMains UC Berkeley.
Presented By Greg Gire Advised By Zoë Wood California Polytechnic State University.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Continuous Model Synthesis Paul Merrell and Dinesh Manocha In SIGGRAPH Asia 2008 발표 : 이성호.
Unstructured Volume Rendering Jian Huang, CS 594, Spring 2002 This set of slides reference slides developed by Prof. Torsten Moeller, SFU, Canada.
Computer Graphics Some slides courtesy of Pierre Alliez and Craig Gotsman Texture mapping and parameterization.
MIRALab Where Research means Creativity SVG Open 2005 University of Geneva 1 Converting 3D Facial Animation with Gouraud shaded SVG A method.
Andrew Nealen / Olga Sorkine / Mark Alexa / Daniel Cohen-Or SoHyeon Jeong 2007/03/02.
Subdivision Surfaces Ref: Subdivision Surfaces in Character Animation, DeRose et. al, SIGGRAPH98.
Geometric Modeling How to design a graphical model? How to create a digital description of a real-world object? Design Digitize.
3D Object Morphing CS5245 Vision and Graphics for Special Effects.
Course Introduction to virtual engineering Óbuda University John von Neumann Faculty of Informatics Institute of Applied Mathematics Lecture and laboratory.
Ramesh Raskar University of North Carolina at Chapel Hill Ramesh Raskar University of North Carolina at Chapel Hill Image Precision Silhouette Edges Michael.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 7. Speed-up Techniques Presented by SooKyun Kim.
6.1 - Solid Shapes & Spatial Relationships
Chapter Area, Pythagorean Theorem, and Volume 14 Copyright © 2013, 2010, and 2007, Pearson Education, Inc.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Local Illumination and Shading
Section 12-1 Exploring Solids. Polyhedron Three dimensional closed figure formed by joining three or more polygons at their side. Plural: polyhedra.
6.1 - Solid Shapes & Spatial Relationships.
11-1 Space Figures and Cross Sections Objectives To recognize polyhedra and their parts To visualize cross sections of space figures.
N u 1 u 2 u Canonical Decomposition. V 8 V 7 V 6 V 5 V 4 V 3 V 2 V 1 n u 1 u 2 u.
3-D Mesh Morphing By Newton Der.
Solid Shapes. The basics ♥Polygon – 2 space ♥Polyhedron = 3 space ♥Polyhedra or Polyhedrons = plural ♥ A Polyhedron is a closed figure, made up of polygons.
Graphics Pipeline Bringing it all together. Implementation The goal of computer graphics is to take the data out of computer memory and put it up on the.
Opportunities in Map-Making Alan Saalfeld. April 20-22, 2007Computational and Conformal Geometry2 Cartographers can make maps that: Preserve all angles.
Image Morphing © Zooface Many slides from Alexei Efros, Berkeley.
POLYGON MESH Advance Computer Graphics
VideoTrace: Interactive 3d modelling for all
CSc 8820 Advanced Graphics Algorithms
Lecture 18 Fasih ur Rehman
CS475 3D Game Development Level Of Detail Nodes (LOD)
The Graphics Rendering Pipeline
Real-time Computer Graphics Overview
Models and Architectures
Suggestive Contours with Geometry Shader
Cache-Efficient Layouts of BVHs and Meshes
Sounding Liquids: Automatic Sound Synthesis from Fluid Simulations
Day 05 Shader Basics.
Young J. Kim Ming C. Lin Dinesh Manocha
Projective Transformations for Image Transition Animations
Chapter XVIII Surface Tessellation
Vertical Angles Vertical angles are across from each other and are created by intersecting lines.
Automated Layout and Phase Assignment for Dark Field PSM
DryadInc: Reusing work in large-scale computations
Chap 10. Geometric Level of Detail
14 Chapter Area, Pythagorean Theorem, and Volume
Relation (a set of ordered pairs)
Presentation transcript:

Feature-based Surface Decomposition for Correspondence and Morphing between Polyhedra Arthur D Gregory, Andrei State, Ming C Lin, Dinesh Manocha, Mark A Livingston University of North Carolina at Chapel Hill http://www.cs.unc.edu/~geom/3Dmorphing {gregory,andrei,lin,dm,livingst}@cs.unc.edu

Highlights Empower animators to create a visually pleasing morph Simple user interface General

Previous Work Kanai et al. [1997] DeCarlo and Gallier [1996] Galin and Akkouche [1996] Lazarus and Verroust [1994] Kent, Carlson, and Parent [1992] Kaul and Rossignac [1991] Wyvill [1990]

Overview Two Input Polyhedra Edit trajectories User Interpolate Morphing sequence Specify Correspondence Compute merged polyhedron

Correspondence Specification

Correspondence Computation Feature-Nets decompose input polyhedra into morphing patches For each corresponding Morphing Patch pair: map both onto a 2D polygon merge the vertex-edge graphs reconstruct the facets

Correspondence Computation A (Igloo) B (House)

Correspondence Computation Patch A Patch B Extremal Vertices

Mapping Patch A Patch B

Mapping Desiderata

Merging Patch A Patch B

Reconstruction

Completed Correspondence

Morphing Trajectory Specification

Analysis Computation time = O(K*[m+n]) K = max{log Q,Q} m = vertices in A n = vertices in B

Implementation Implemented in C++ Uses OpenGL and Tcl/Tk libraries for display and user interface. Interactive user interface on SGI and PC systems

Performance Models Igloo-House Triceratops-Human Human Heads Donut-Cup Triangles 82 40 5,660 17,528 3,426 4,020 4,096 8,452 Output Triangles Morphing Patches User Time Time to Compute Merged Polyhedron 214 97,900 32,520 61,701 10 86 67 50 ~5min ~6 hours ~3 hours ~4 hours <1sec 2.5min 30 sec 1 min

Ongoing Efforts Remove restriction that the chains of the feature net must lie on edges of the models Do not require the user to specify a connected feature net Provide better control of the model’s shape during the morph

Ongoing Efforts Remove restriction that models must be homeomorphic models can change topology during the morph Extend to include textured objects currently interpolate only normals and vertex color

System Architecture

Conclusion Empower animators to create a visually pleasing morph Simple user interface Compute correspondence through surface decomposition General