CS 284: CAGD
Lecture #16 -- Mo 10/20, 2003.
PREVIOUS
< - - - - > CS
284 HOME < - - - - > CURRENT
< - - - - > NEXT
Preparation:
READ:
"Functional
Optimization for Fair Surface Design" by H. P. Moreton and C. H. Sequin.
Remarks on Homework: Designing a Genus-4 Smooth Surface
Great final results ! Thanks !
Some select examples of the models in stage 3, first some shapes
seen in previous rounds:
the
"organic" shape by Irena, the
complex design by Aleksey, the
tangible model by Young, and the very
symmetrical model by Hayley;
and a new intriguing shape by
Alan,
Side Remark: Triangular Surfaces Patches
A month ago we have encountered tensor-product patches,
e.g., cubic tensor-product Bezier patches;
they do in the "u" and in "v" directions what we have learned about
curves.
We can also deal with triangular patches, but need a different
interpolation scheme:
Barycentric coordinates: three numbers, but with constraint that they
must sum to 1.0.
DeCasteljau evaluation technique can also be applied to triangular
patches.
Functional Optimization
You probably don't have the time to read every paragraph of every assigned
paper,
but at least you should try to find answers to questions like these:
-
What is the overall goal ?
-
What is the high-level approach ?
-
What is novel, innovative, reusable in other contexts ?
-
What are the results obtained ?
-
What else should you remember about this paper ?
Curve Optimization
-
Desirable properties
-
Optimization functionals: MEC, MVC, Si-MEC, Si-MVC
-
Curve evolution to global minimum, and what slows it down
-
Curve representation: quintic hermite
-
Optimization procedure
-
What are the best "primitives"?
-
Does this work in 3D ?
Surface Optimization
-
What carries over from curve optimization ?
-
What are new issues ?
-
The surface functionals: MES, MVS, Si-MVS
-
The "ideal" zero-cost surfaces
-
Surface representations: bi-quintic hermite
-
Constraint initialization
-
Optimization procedure: first network, then paches
-
Results for unconstrained low genus surfaces
-
Can we do better ?
Start preparing your Project
Proposals --> Tentative Ideas due by Wednesday.
Current Homework Assignment: (to be done individually)
Re-read the four papers on subdivision surfaces, and try these schemes
and some other variants in a hands-on manner in a demonstration package
written by Jordan Smith.
Use the SLIDE file CS284/CODE/subdivision.slf
and test many of the subdivision schemes accessible from the menu that
do NOT have the word "SELECTIVE" in their name. In particular take a close
look at:
-
SLF_SUBDIVISION_DOO_SABIN
- Doo-Sabin quadratic, it must be a closed mesh.
-
SLF_SUBDIVISION_SHARP_CATMULL_CLARK
- Catmull-Clark cubic, anything goes including
sharp tags.
-
SLF_SUBDIVISION_CORNER_CUTTING
- All of the CORNER_... schemes generalize the
Loop topological split for arbitrary polygons
by creating a triangle at each corner
by connecting the two adjacent midpoints.
-
SLF_SUBDIVISION_CORNER_ROUNDING
-
SLF_SUBDIVISION_CORNER_ROUNDING_SHARP_LOOP
- Loop quartic scheme (if the input is all triangles),
sharp tags ok.
-
SLF_SUBDIVISION_CORNER_ROUNDING_BUTTERFLY
- Butterfly interpolating scheme, must be a closed
object.
-
SLF_SUBDIVISION_CORNER_ROUNDING_ZORIN
- Zorin's enhanced interpolating scheme, must
be a closed object.
-
SLF_SUBDIVISION_TRIANGLE_LOOP
- All of the TRIANGLE_... schemes are the same
as the CORNER_... schemes,
but they insert a vertex in the
center of non-triangles to triangulate them on the first step
and then they run the classic subdivision
schemes.
-
SLF_SUBDIVISION_TRIANGLE_BUTTERFLY
-
SLF_SUBDIVISION_TRIANGLE_ZORIN
Within this SLIDE program, compare the capabilities of the various schemes
to make smooth, evenly rounded objects with as few concavities as possible
for convex starting objects. One of the tougher test objets is "gHexPrism1"
because of the many coplanar facets and the sharp edges in the input net.
A.) Do a qualitative examination on three different objects, one
of which should be "gHexPrism1", given in the starter file.
You can activate different objets by "un-commenting" different instance
commands in lines 300-340 in the subdivision.slf file.
Pick a second object of your choice.
Check out the on-line SLIDE web
page on Tcl-Packages, the "slideui", and "geometry.tcl" to learn more
about these packages and the different objects.
The third test object should be your own design of a genus 4 object
(this is obviously non-convex -- how does this affect the various methods?)
Report your qualitative observations on these test runs, in
particular, which scheme performs the best, and what geometrical features
cause the most problems with what subdivision schemes.
B.) As a second way of focusing on the capabilities of the different
schemes -- and using very much what you learned from the four papers --
consider the following task:
Assume you have been given the 20 vertices of a regular
dodecahedron and would like to have a very finely tessellated, sphere-like,
subdivision surface that interpolates these 20 vertices exactly. Study
how to do this with two different subdivision schemes: an interpolating
one and an approximating one. Give SLIDE descriptions of the initial two
control meshes for the case there the 20 vertices lie on a sphere of radius
1.0.
-
Provide two images that show the initial control meshes and
-
(reasonably) smooth versions of the two resulting surfaces (don't push
SLIDE too far!).
-
Comment on the advantages and difficulties of the two methods, and on
the qualities of the final surfaces.
-
Bring your reports to class on Wednesday 10/22/2003.
Please place your "sphere" .slf files on your Windows account
(i.e. \\fileservice\cs284\fa03 in the directory ~/cs284/hw/pa6).
Next Reading Assignment:
"The
Surface Evolver" by Ken Brakke
You may skip Sections: 3.4, 3.5, 4.2, 4.8, 5.4, 5.5, 6.2, 6.7, 9, 10.
PREVIOUS
< - - - - > CS
284 HOME < - - - - > CURRENT
< - - - - > NEXT
Page Editor: Carlo H. Séquin