application: multiresolution curves jyun-ming chen spring 2001
DESCRIPTION
Curve Smoothing Construct an approximate curve with fewer control points Assume end-point interpolating cubic B- spline curve Discrete nature: –m = 4, 5, 7, 11, 19, … Trivially done using analysis filters Fast –Linear with banded LUTRANSCRIPT
![Page 1: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/1.jpg)
Application:Multiresolution Curves
Jyun-Ming ChenSpring 2001
![Page 2: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/2.jpg)
Introduction
• Plays fundamental roles in– Animation, 2D design, …– CAD: cross section design
• A good representation should support– Continuous level of
smoothing (fig)– Editing
• LOD; direct manipulation– Data fitting
• We use B-spline wavelets to develop multiresolution curve
• All algorithms are simple, fast and require no extra storage (we shall see)
![Page 3: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/3.jpg)
Curve Smoothing• Construct an approximate
curve with fewer control points
• Assume end-point interpolating cubic B-spline curve
• Discrete nature:– m = 4, 5, 7, 11, 19, …
• Trivially done using analysis filters
• Fast– Linear with banded LU
![Page 4: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/4.jpg)
Fractional-level Curve
• Resolving discrete nature
• Smoothing …• Editing (p.113-116)• Direct manipulation• Local change
![Page 5: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/5.jpg)
Example
![Page 6: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/6.jpg)
Direct Manipulation
![Page 7: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/7.jpg)
MR Editing
• Changing overall sweep• Alter detailed characterstic• (eq on p.113 is quite flexible, depending on j)
![Page 8: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/8.jpg)
MR Editing• Curve character library
Contains different detail functionsCan be extracted from hand-drawn strokes, or procedurally generated
![Page 9: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/9.jpg)
Application: Variational Modeling
![Page 10: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/10.jpg)
Introduction• In geometry design, instead
of direct manipulating the mathematical representation, sometimes we set up an objective function (typically as a minimization of some functional) and subject to some constraints; and let the computer determine the “best” shape satisfying the conditions
• Minimizing the integral is in the domain of variational calculus (and so named variational modeling)
• Wavelets are useful in speeding the computations required for variational modeling
![Page 11: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/11.jpg)
Example Problem
• Design a “smooth” curve that passes through some particular points
• The curve (here: a functional curve)
• Formulate “smoothness” as a variational problem• (minimize total curvature)
![Page 12: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/12.jpg)
Aside: for surface problems
• Smoothness/fairing– Energy-minimizing surface
![Page 13: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/13.jpg)
Solution Method: the finite-element method
• Choose a set of basis functions (called finite element)– discretize and parameterize
the problem space• Represent the unknown fu
nction as a linear combination of the finite elements
• Substitute back to the original problem
![Page 14: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/14.jpg)
Back to the Problem
• If we choose to represent the curve as a quartic function
![Page 15: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/15.jpg)
Problem (cont)
Ab
![Page 16: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/16.jpg)
Algebraic Manipulation
![Page 17: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/17.jpg)
The problem becomes …
• Problem in the form of quadratic programming• Use the method of Lagrange multipliers
– Works well for quadratic programming problems
![Page 18: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/18.jpg)
Discussion• In general, the matrix in the li
near system is quite large; therefore, iterative solvers (e.g., Gauss-Seidel or conjugate gradient) are used
• Unlike the previous demonstration, usually B-spline basis is chosen (instead of the monomial basis)– The computation result can be d
irectly used in geometric representation
• However, B-spline basis converges slowly in the iterative solver– compact support of the basi
s prohibits broad changes• Gortler and Cohen (1995)
uses B-spline wavelets for the finite element (instead of B-splines themselves) and works better
![Page 19: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/19.jpg)
• Mathematically, they solve
where W represents the wavelet transform and is the set of the wavelet coefficient for the solution
Gortler and Cohen (cont)• Intuitively, the wavelet
basis allows changes in the curve to propagate much more quickly from one region to another by allowing the effects to “bubble up” the hierarchy to basis functions with broader support and then descend back down to hierarchy to the narrower basis functions for the regions affected
x̂
![Page 20: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/20.jpg)
Application: Tiling
Skipped for now
![Page 21: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/21.jpg)
Tiling: The Problem• General requirement: matched (linked)
indentations• “correct” tiling: depends on the nature of the
problem
![Page 22: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/22.jpg)
Solution Methods
• Optimization– Formulate as graph
searching problem; solved by dynamic programming
– High complexity O(n2log n)
– Too expensive for interactive applications with thousands of vertices
• Greedy methods– Linear time– Do not work well
![Page 23: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/23.jpg)
Challenging Case (Contours from Human Brain)
Input:A pair of contours
Results from greedy algorithmsResults from
optimizing algorithm;Still require user
interaction
![Page 24: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/24.jpg)
Multiresolution Tiling Meyers et al. (1992)
![Page 25: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/25.jpg)
Details (MR Tiling)
![Page 26: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/26.jpg)
Compare: MR Tiling and Optimizing Method
MR Tiling Optimization
![Page 27: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/27.jpg)
Application:Surfaces
![Page 28: Application: Multiresolution Curves Jyun-Ming Chen Spring 2001](https://reader036.vdocuments.mx/reader036/viewer/2022081511/5a4d1b047f8b9ab059987e4f/html5/thumbnails/28.jpg)
• Polyhedral compression• continuous level-of-detail• progressive transmission• Multiresolution editig