Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.

Slides:



Advertisements
Similar presentations
Bicubic G1 interpolation of arbitrary quad meshes using a 4-split
Advertisements

Computer Graphics (Spring 2008) COMS 4160, Lecture 6: Curves 1
Active Contours, Level Sets, and Image Segmentation
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 14: Review / Subdivision Ravi Ramamoorthi Slides courtesy.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 10 Ravi Ramamoorthi
Discrete Geometry Tutorial 2 1
Boolean Operations on Subdivision Surfaces Yohan FOUGEROLLE MS 2001/2002 Sebti FOUFOU Marc Neveu University of Burgundy.
Q about GL to render polygon glBegin(GL_TRIANGLES) glVertex3f(0,0,0); glVertex3f(1,1,0); glVertex3f(1,0,0); glVertex3f(0,1,0); glEnd();
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
1Notes  Assignment 0 is due today!  To get better feel for splines, play with formulas in MATLAB!
CS Peter Schröder Subdivision I: The Basic Ideas.
Simulation and Rendering of Liquid Foams Hendrik Kück (UBC, Vancouver) Christian Vogelgsang (FAU Erlangen, Germany) Günther Greiner (FAU Erlangen, Germany)
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 12: Spline Curves (review) Ravi Ramamoorthi Most material.
Implicit Surfaces Tom Ouyang January 29, Outline Properties of Implicit Surfaces Polygonization Ways of generating implicit surfaces Applications.
1cs426-winter-2008 Notes  Assignment 0 is due today  MATLAB tutorial tomorrow 5-7 if you’re interested (see web-page for link)
Visualization and graphics research group CIPIC January 30, 2003Multiresolution (ECS 289L) - Winter MAPS – Multiresolution Adaptive Parameterization.
Subdivision Primer CS426, 2000 Robert Osada [DeRose 2000]
Introduction to Boolean Operations on Free-form Solids CS284, Fall 2004 Seung Wook Kim.
Disediakan oleh Suriati bte Sadimon GMM, FSKSM, UTM Graphics modeling.
COEN Computer Graphics I
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
1 Course 21: Manifolds and Modeling Monday 8:30-12:15 Cindy Grimm Media and Machines Lab Department of Computer Science and Engineering Washington University.
Informatik VIII Computer Graphics & Multimedia Martin Marinov and Leif Kobbelt Direct Quad-Dominated Anisotropic Remeshing Martin Marinov and Leif Kobbelt.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Spline curves 1/23 Curves and Surfaces.
Graphics Graphics Korea University cgvr.korea.ac.kr Creating Virtual World I 김 창 헌 Department of Computer Science Korea University
1 Background and definitions Cindy Grimm. 2 Siggraph 2005, 8/1/ Overview What does it mean to be.
Cindy Grimm Parameterization with Manifolds Cindy Grimm.
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Image Vectorization Cai Qingzhong 2007/11/01.
1 Adding charts anywhere Assume a cow is a sphere Cindy Grimm and John Hughes, “Parameterizing n-holed tori”, Mathematics of Surfaces X, 2003 Cindy Grimm,
1 Manifolds from meshes Cindy Grimm and John Hughes, “Modeling Surfaces of Arbitrary Topology using Manifolds”, Siggraph ’95 J. Cotrina Navau and N. Pla.
Constructive manifolds for surface modeling
Copyright © Curt Hill Visualization of 3D Worlds How are these images described?
Cindy Grimm Parameterizing N-holed Tori Cindy Grimm (Washington Univ. in St. Louis) John Hughes (Brown University)
Subdivision Surfaces Ref: Subdivision Surfaces in Character Animation, DeRose et. al, SIGGRAPH98.
Geometric Modeling using Polygonal Meshes Lecture 3: Discrete Differential Geometry and its Application to Mesh Processing Office: South B-C Global.
A construction of rational manifold surfaces of arbitrary topology and smoothness from triangular meshes Presented by: LiuGang
Lee Byung-Gook Dongseo Univ.
1 CS 430/585 Computer Graphics I 3D Modeling: Subdivision Surfaces & Solid Modeling Week 9, Lecture 17 David Breen, William Regli and Maxim Peysakhov Geometric.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.
Energy-minimizing Curve Design Gang Xu Zhejiang University Ouyang Building, 20-December-2006.
ECCV Tutorial Mesh Processing Discrete Exterior Calculus
Ship Computer Aided Design
Foundations of Computer Graphics (Spring 2012) CS 184, Lecture 12: Curves 1
Recent Progress in Mesh Parameterization Speaker : ZhangLei.
Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.
CS559: Computer Graphics Lecture 33: Shape Modeling Li Zhang Spring 2008.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
Introduction to Parametric Curve and Surface Modeling.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
Lecture 24: Surface Representation
Advanced Computer Graphics
Goals A high-order surface construction Desirable features
Introduction to Graphics Modeling
CSE 167 [Win 17], Lecture 9: Curves 1 Ravi Ramamoorthi
© University of Wisconsin, CS559 Fall 2004
© University of Wisconsin, CS559 Spring 2004
From Point Clouds To Trimmed NURBS
Lecture 27: Solid Modeling
Grimm and Hughes Input: arbitrary mesh
Implicit Functions Some surfaces can be represented as the vanishing points of functions (defined over 3D space) Places where a function f(x,y,z)=0 Some.
Mesh Parameterization: Theory and Practice
Grimm and Hughes Input: arbitrary mesh
Jeff Ballard Nick Rasmussen
Introduction to Parametric Curve and Surface Modeling
Jeff Ballard Nick Rasmussen
Presentation transcript:

Why manifolds?

Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains of nontrivial topology closed surfaces, configuration spaces, light fields … Manifolds: a tool for constructing algorithms do computations on planar domains then blend together; how to blend smoothly? Manifolds: a tool for understanding algorithms why do we see (or do not see) problems when computing with complex domains?

Domains Geometric modeling construct smooth surfaces Can get unique combinations of properties understand how to build smooth global parametrizations Animation smoothly interpolate motions represent config. spaces for motion editing Rendering assemble smooth lightfields from different views, represent BRDFs

Constructing smooth surfaces Can get unique combinations of properties: arbitrary smoothness, local support, flexibility; compare: even C2 subdivision is very difficult; add local charts anywhere you want

Parametrization Global parametrization Gives us tools to get smoothness everywhere Gu and Yau, 2003Ray, Li, Levy, Sheffer, Alliez, 2005

Parametrization Essential question: what is a smooth function on a mesh?

Parametrization Why this one global algorithm works better than another? parametrization derivative approximations Khodakovsky and Schröder

Examples Animation Configuration spaces are manifolds Rendering Light fields are manifolds Surface modeling and parameterization

Goals for surface modeling A high-order surface construction Important for geometric and numerical computation Desirable features or smoothness At least 3-flexibility at vertices Closed-form smooth local parameterizations Can handle arbitrary control meshes Good visual quality Easy to implement

Smoothness smoothness A standard goal in CAGD important for high-accuracy computation Computing surface properties : needed for normal : needed for curvatures, reflection lines; : needed for curvature variation;

Flexibility Ability to represent local geometry Property of basis function, instead of the surface Two-Flexibility: any desired curvature at any point 1-flexible2-flexible Todo: replace with shaded picture

Local Parameterization Explicit smooth local parameterization For any point, there is an explicit formula defining the surface in a neighborhood of this point Simplifies many tasks Defining functions on surfaces Integration over surfaces Surface-surface intersections Computing geodesics

Spline-based Approach Construct surface patch for each face Find smooth local parameterization for every point Difficult to guarantee smoothness for points on patch boundaries

Manifold-based Approach Construct overlapping charts covering the mesh Build local geometry approximating the mesh on each chart Find blending function for each chart Get the surface by blending local geometry ……

Previous Work High-order spline patches S-patches [Loop and DeRose 1989] DMS splines [Seidel 1994] Freeform splines [Prautzsch 1997] TURBS [Reif 1998] C2 flexible subdivision surfaces G2 subdivision [Prautzsch and Umlauf 1996] Manifold-based approach [Grimm and Hughes 1995] [Navau and Garcia 2000] [Grimm 2002] [Ying, Zorin 2004] [Qin, Gu, He, 2005] [Grimm 2005]