Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.

Slides:



Advertisements
Similar presentations
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 14: Review / Subdivision Ravi Ramamoorthi Slides courtesy.
Advertisements

Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 10 Ravi Ramamoorthi
CS 445/645 Fall 2001 Hermite and Bézier Splines. Specifying Curves Control Points –A set of points that influence the curve’s shape Knots –Control points.
Jehee Lee Seoul National University
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
1 Curves and Surfaces. 2 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized.
Distance Between a Catmull- Clark Subdivision Surface and Its Limit Mesh Zhangjin Huang, Guoping Wang Peking University, China.
Classic Subdivision Schemes. Schemes Catmull-Clark (1978) Doo-Sabin (1978) Loop (1987) Butterfly (1990) Kobbelt (1996) Mid-edge (1996 / 1997)
Analysis techniques for subdivision schemes Joe Warren Rice University.
Subdivision Curves & Surfaces and Fractal Mountains. CS184 – Spring 2011.
1 Computer Graphics Chapter 7 3D Object Modeling.
CS Peter Schröder Subdivision I: The Basic Ideas.
Surfaces Chiew-Lan Tai. Surfaces 2 Reading Required Hills Section Hearn & Baker, sections 8.11, 8.13 Recommended Sections 2.1.4, , 3D Computer.
INFORMATIK Differential Coordinates for Interactive Mesh Editing Yaron Lipman Olga Sorkine Daniel Cohen-Or David Levin Tel-Aviv University Christian Rössl.
Fractal Mountains, Splines, and Subdivision Surfaces Jordan Smith UC Berkeley CS184.
CS CS 175 – Week 8 Bézier Curves Definition, Algorithms.
1cs426-winter-2008 Notes  Assignment 0 is due today  MATLAB tutorial tomorrow 5-7 if you’re interested (see web-page for link)
Geometric Modeling Surfaces Mortenson Chapter 6 and Angel Chapter 9.
1 Subdivision Surfaces CAGD Ofir Weber. 2 Spline Surfaces Why use them?  Smooth  Good for modeling - easy to control  Compact (complex objects are.
Subdivision Primer CS426, 2000 Robert Osada [DeRose 2000]
Modelling: Curves Week 11, Wed Mar 23
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Curves Week 13, Mon 24 Nov 2003.
COEN Computer Graphics I
CS Subdivision I: The Univariate Setting Peter Schröder.
Subdivision Analysis via JSR We already know the z-transform formulation of schemes: To check if the scheme generates a continuous limit curve ( the scheme.
Splines III – Bézier Curves
Curves and Surfaces (cont’) Amy Zhang. Conversion between Representations  Example: Convert a curve from a cubic B-spline curve to the Bézier form:
Curve Modeling Bézier Curves
Chapter 10: Image Segmentation
Subdivision surfaces Construction and analysis Martin Reimers CMA/IFI, University of Oslo September 24th 2004.
11/19/02 (c) 2002, University of Wisconsin, CS 559 Last Time Many, many modeling techniques –Polygon meshes –Parametric instancing –Hierarchical modeling.
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.
4/15/04© University of Wisconsin, CS559 Spring 2004 Last Time More modeling: –Hierarchical modeling –Instancing and Parametric Instancing –Constructive.
Creating & Processing 3D Geometry Marie-Paule Cani
V. Space Curves Types of curves Explicit Implicit Parametric.
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,
Why manifolds?. Motivation We know well how to compute with planar domains and functions many graphics and geometric modeling applications involve domains.
Introduction to Subdivision surfaces Martin Reimers CMA, University of Oslo.
Splines Vida Movahedi January 2007.
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.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Parametric Curves.
Non-Uniform Rational B-Splines NURBS. NURBS Surfaces NURBS surfaces are based on curves. The main advantage of using NURBS surfaces over polygons, is.
Cindy Grimm Parameterizing N-holed Tori Cindy Grimm (Washington Univ. in St. Louis) John Hughes (Brown University)
Parametric Surfaces Define points on the surface in terms of two parameters Simplest case: bilinear interpolation s t s x(s,t)x(s,t) P 0,0 P 1,0 P 1,1.
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
Ship Computer Aided Design MR 422. Geometry of Curves 1.Introduction 2.Mathematical Curve Definitions 3.Analytic Properties of Curves 4.Fairness of Curves.
Lee Byung-Gook Dongseo Univ.
Greg Humphreys CS445: Intro Graphics University of Virginia, Fall 2003 Subdivision Surfaces Greg Humphreys University of Virginia CS 445, Fall 2003.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Subdivision surfaces.
Ship Computer Aided Design
Rendering Bezier Curves (1) Evaluate the curve at a fixed set of parameter values and join the points with straight lines Advantage: Very simple Disadvantages:
Curves University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2013 Tamara Munzner.
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.
Curve & Surface.
Advanced Computer Graphics
Goals A high-order surface construction Desirable features
© University of Wisconsin, CS559 Spring 2004
The Variety of Subdivision Schemes
Grimm and Hughes Input: arbitrary mesh
Grimm and Hughes Input: arbitrary mesh
Three-Dimensional Object Representation
Introduction to Parametric Curve and Surface Modeling
Presentation transcript:

Construction of Navau and Garcia

Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control mesh We consider the case k = 2 (C2 surfaces), and n = 3 The number of charts grows with n, so smaller is better for most applications Steps subdivide using Catmull-Clark 3 times define 1 quad chart for each regular vertex not adjacent to irregular, 2 quad charts for some adjacent, K quad charts for vertices of valence K define 1 basis function per chart assign a 1 control point per vertex

Step 1: Subdivide Subdivide 3 times (use Catmull-Clark) charts will (more or less) correspond to 2- neighborhoods of vertices in the refined mesh subdivide enough so that if charts overlap they can contain only one irregular vertex

Step 2: Define charts If 2-neighborhood has no irregular vertices simply map part of the mesh to a square

Step 2: Define charts Regular vertices close to irregular (within 2 ring) make a curved star mapping 4-nbhd of irregular vertex to the plane; irregular vertex splits into K. sweep the outer curve of the curved 2-nbhd to get a chart

Step 2: Define charts Regular vertices diagonal from irregular and irregular for these vertices, the outer boundary has multiple segments; use multiple charts

Step 3: basis functions One control point assigned per vertex several charts may share a control point similar to splines, weighted blend of control points Basis functions are tensor product splines of degree k+1, remapped to the charts Quad charts make the definition easy

Step 4: transition maps Transition maps are affine for charts containing irregular vertices (these charts always share the same star) affine for regular to regular chart polynomial for regular to irregular

Summary of properties smoothness: C k flexibility: unknown at irregular charts shape: all quads charts are associated with vertices, multiple charts for some vertices number of charts: large; approx. 4^(subdiv steps) * # of vertices for C 2, 3 subdiv. steps, i.e. 64* # of vertices flexibility: unknown embedding functions: constants (1 control point/chart) blending functions: tensor-product B-splines remapped transition functions: linear or polynomial of degree k+1 reduce to splines of degree k+1 for regular control meshes

Construction of Ying and Zorin

Charts and Transition Maps Building local geometry for one-ring neighborhood is easy How to blend them together smoothly ? The transition map must be smooth ? Smooth

Charts and Transition Maps Charts One for each vertex Map only depends on valence Transition maps Conformal, thus Easy to compute Alternatives transition map smooth

Local Geometry Maps Needs to be smooth and 3-flexible at center vertex Use monomials as basis for local geometry High order splines can also be used Needs to provide good visual quality Make it close to an existing surface with good quality Use Catmull-Clark subdivision surface

Local Geometry Maps Constraints: 3d positions Positions in chart Basis Monomials in chart Unknowns Monomial coefficients Least square fitting Catmull-Clark subdivision Pseudo-inverse can be pre-computed Dyadic points Fitting

Blending Functions Need to be a partition of unity Need to be smooth in each chart tensor product rotate and copy map

Evaluation Procedure Find correspondent positions in each chart Evaluate local geometry by local chart position Compute blending function in each chart Blend local geometry to get surface position

Local Parameterization Local parameterization around extraordinary vertex Magnitude of derivatives Our surface Catmull-Clark 1 st order2 nd order3 rd order

High-order smoothness Reflection lines Curvature behavior Catmull-Clark Our surface

Surface Examples

Summary of Features charts: star-shaped, depend on vertex valence one chart per vertex embedding functions: polynomials or splines blending functions: compositions of conformal and polynomial transition functions: conformal C 1 or C k smooth for a prescribed k At least 3-flexible at vertices Explicit local parameterizations exist for any point