Distance Between a Catmull- Clark Subdivision Surface and Its Limit Mesh Zhangjin Huang, Guoping Wang Peking University, China.

Slides:



Advertisements
Similar presentations
Arc-length computation and arc-length parameterization
Advertisements

Lecture Notes #11 Curves and Surfaces II
Irina Vaviļčenkova, Svetlana Asmuss ELEVENTH INTERNATIONAL CONFERENCE ON FUZZY SET THEORY AND APPLICATIONS Liptovský Ján, Slovak Republic, January 30 -
Approximations of points and polygonal chains
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 10 Ravi Ramamoorthi
Overview June 9- B-Spline Curves June 16- NURBS Curves June 30- B-Spline Surfaces.
Jehee Lee Seoul National University
MIT EECS 6.837, Durand and Cutler Curves & Surfaces.
Classic Subdivision Schemes. Schemes Catmull-Clark (1978) Doo-Sabin (1978) Loop (1987) Butterfly (1990) Kobbelt (1996) Mid-edge (1996 / 1997)
On Triangle/Quad Subdivision Scott Schaefer and Joe Warren TOG 22(1) 28 – 36, 2005 Reporter: Chen zhonggui
Analysis techniques for subdivision schemes Joe Warren Rice University.
Subdivision Curves & Surfaces and Fractal Mountains. CS184 – Spring 2011.
CS CS 175 – Week 9 B-Splines Blossoming, Bézier Splines.
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.
Automatic Reconstruction of B-spline Surfaces of Arbitrary Topological Type Matthias Eck Hugues Hoppe Matthias Eck Hugues Hoppe University of Darmstadt.
Signal-Specialized Parameterization for Piecewise Linear Reconstruction Geetika Tewari, Harvard University John Snyder, Microsoft Research Pedro V. Sander,
A posteriori Error Estimate - Adaptive method Consider the boundary value problem Weak form Discrete Equation Error bounds ( priori error )
Offset of curves. Alina Shaikhet (CS, Technion)
Fractal Mountains, Splines, and Subdivision Surfaces Jordan Smith UC Berkeley CS184.
Normal based subdivision scheme for curve and surface design 杨勋年
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]
11/08/00 Dinesh Manocha, COMP258 Subdivision Curves & Surfaces Work of G. de Rham on Corner Cutting in 40’s and 50’s Work of Catmull/Clark and Doo/Sabin.
Adaptively Sampled Distance Fields (ADFs) A General Representation of Shape for Computer Graphics S. Frisken, R. Perry, A. Rockwood, T. Jones Richard Keiser.
Jorg Peters, SurfLab Generalized spline subdivision Polynomial Heritage Computing Moments Shape and Eigenvalues Jorg Peters SurfLab (Purdue,UFL)
1 University of Denver Department of Mathematics Department of Computer Science.
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.
Smooth Geometry Images Frank Losasso, Hugues Hoppe, Scott Schaefer, Joe Warren.
Improved Error Estimate for Extraordinary Catmull-Clark Subdivision Surface Patches Zhangjin Huang, Guoping Wang School of EECS, Peking University, China.
Curves and Surfaces (cont’) Amy Zhang. Conversion between Representations  Example: Convert a curve from a cubic B-spline curve to the Bézier form:
Smooth Spline Surfaces over Irregular Topology Hui-xia Xu Wednesday, Apr. 4, 2007.
Subdivision surfaces Construction and analysis Martin Reimers CMA/IFI, University of Oslo September 24th 2004.
Subdivision/Refinement Dr. S.M. Malaek Assistant: M. Younesi.
Subdivision Surfaces in Character Animation Tony DeRose Michael KassTien Truong Pixar Animation Studios Balaji KannanChen Shen.
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.
Signal-Specialized Parameterization for Piecewise Linear Reconstruction Geetika Tewari, Harvard University John Snyder, Microsoft Research Pedro V. Sander,
This Week Week Topic Week 1 Week 2 Week 3 Week 4 Week 5
V. Space Curves Types of curves Explicit Implicit Parametric.
Texture Mapping by Model Pelting and Blending
Introduction to Subdivision surfaces Martin Reimers CMA, University of Oslo.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Vector Norms and the related Matrix Norms. Properties of a Vector Norm: Euclidean Vector Norm: Riemannian metric:
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.
A construction of rational manifold surfaces of arbitrary topology and smoothness from triangular meshes Presented by: LiuGang
Artistic Surface Rendering Using Layout Of Text Tatiana Surazhsky Gershon Elber Technion, Israel Institute of Technology.
1 Subdivision Depth Computation for Catmull-Clark Subdivision Surfaces Fuhua (Frank) Cheng University of Kentucky, Lexington, KY Junhai Yong Tsinghua University,
Automatic Construction of Quad-Based Subdivision Surfaces using Fitmaps Daniele Panozzo, Enrico Puppo DISI - University of Genova, Italy Marco Tarini DICOM.
Rendering Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico 1 Angel:
Parametric Curves & Surfaces
ROBUSTNESS IN NUMERICAL COMPUTATION II VALIDATED ODE SOLVER KWANG HEE KO SCHOOL OF MECHATRONICS GWANGJU INSTITUTE OF SCIENCE AND TECHNOLOGY.
11/26/02(C) University of Wisconsin Last Time BSplines.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
Construction of Navau and Garcia. Basic steps Construction has two parameters: smoothness k and n > k, defining how closely the surface follows the control.
CS559: Computer Graphics Lecture 33: Shape Modeling Li Zhang Spring 2008.
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
Bi-3 C2 Polar Subdivision
Lecture 24: Surface Representation
Probability Theory and Parameter Estimation I
Curve & Surface.
LECTURE 09: BAYESIAN ESTIMATION (Cont.)
Advanced Computer Graphics
Daniil Rodin for CAGD course, 2016
The Variety of Subdivision Schemes
Grimm and Hughes Input: arbitrary mesh
Dynamic Data Structures for Simplicial Thickness Queries
Multiresolution Meshes for 3-D Object Description
Overview June 9- B-Spline Curves June 16- NURBS Curves
Presentation transcript:

Distance Between a Catmull- Clark Subdivision Surface and Its Limit Mesh Zhangjin Huang, Guoping Wang Peking University, China

 Generalization of uniform bicubic B-spline surface continuous except at extraordinary points  The limit of a sequence of recursively refined control meshes Catmull-Clark subdivision surface (CCSS) initial mesh step 1limit surface

CCSS patch: regular vs. extraordinary  Assume each mesh face in the control mesh a quadrilateral at most one extraordinary point (valence n is not 4)  An interior mesh face in the control mesh → a surface patch in the limit surface Regular patch: bicubic B-spline patches, 16 control points Extraordinary patch: not B-spline patches, 2n+8 control points Control meshLimit surface Blue: regular Red: extraordinary

Control mesh approximation and error  Control mesh is a piecewise linear approximation to a CCSS  Approximation error: the maximal distance between a CCSS and the control mesh  Distance between a CCSS patch and its mesh face (or control mesh) is defined as is unit square is Stam ’ s parametrization of over is bilinear parametrization of over

Distance bound for control mesh approximation  The distance between a CCSS patch and its control mesh is bounded as [Cheng et al. 2006] is a constant that only depends on valence n is the the second order norm of 2n+8 control points of For regular patches,

Limit mesh approximation  An interior mesh face → a limit face → a surface patch  We derive a bound on the distance between a patch and its limit face (or limit mesh) as means that the limit mesh approximates a CCSS better than the control mesh  Limit mesh : push the control points to their limit positions.  It inscribes the limit surface

Regular patches: how to estimate  Regular patch is a bicubic B-spline patch:  Limit face, then  It is not easy to estimate directly!

Transformation into bicubic Bézier forms  Both and can be transformed into bicubic Bézier form :

Regular patches: distance bound  Core idea: Measure through measuring

Regular patches: distance bound (cont.)  Bound with the second order norm, it follows that  Distance bound function of with respect to is Diagonal  By symmetry,

Regular patch: distance bound (cont.)  Theorem 1 The distance between a regular CCSS patch and the corresponding limit face is bounded by The distance between a regular patch and its corresponding mesh face is bounded as [Cheng et al 2006]

Extraordinary patches: parametrization  An extraordinary patch can be partitioned into an infinite sequence of uniform bicubic B-spline patches  Partition the unit square into tiles  Stam ’ s parametrization: Transformation maps the tile onto the unit square

Extraordinary patches: distance bound  Limit face can be partitioned into bilinear subfaces defined over :  Similar to the regular case, for  By solving 16 constrained minimization problems, we have

Extraordinary patch: distance bound function  Thus  is the distance bound function of with respect to :  The distance bound function of with respect to is defined as: Diagonal  By symmetry,

Extraordinary patches: distance bound  Theorem 2 The distance between an extra- ordinary CCSS patch and the corresponding limit face is bounded by  has the following properties:, attains its maximum in  Only needed to consider 2 subpatches and

Extraordinary patches: bound constant , , strictly decreases as n increases

Comparison of bound constants  First two lines are for control mesh approx.  Last line are for limit mesh approximation , n Cheng et al Huang et al Limit mesh

Application to adaptive subdivison Error tolerance Frog modelCar model Control meshLimit meshControl meshLimit mesh 0.125,64214,52714,7178, ,86426,48224,90514, ,159113,71397,70458,805 The number of faces decreases by about 30%

Application to CCSS intersection

Conclusion  Propose an approach to derive a bound on the distance between a CCSS and its limit mesh Our approach can be applied to other spline based subdivision surfaces  Show that a limit mesh may approximate a CCSS better than the corresponding control mesh

Thank you!