Grimm and Hughes Input: arbitrary mesh

Slides:



Advertisements
Similar presentations
Symmetry in the Plane Chapter 8.
Advertisements

CSE554Extrinsic DeformationsSlide 1 CSE 554 Lecture 10: Extrinsic Deformations Fall 2014.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 10 Ravi Ramamoorthi
1 Siggraph 2006, 7/31/ Triangular Manifold Splines Xianfeng David Gu, Ying He, Hong Qin SMI 2005, “Manifold Splines” GMP 2006,
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
1 Computer Graphics Chapter 7 3D Object Modeling.
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.
Introduction to Subdivision Surfaces. Subdivision Curves and Surfaces 4 Subdivision curves –The basic concepts of subdivision. 4 Subdivision surfaces.
Smooth Spline Surfaces over Irregular Topology Hui-xia Xu Wednesday, Apr. 4, 2007.
Ziting (Vivien) Zhou1 Drawing Graphs By Computer Graph from
GEOMETRY SOL Geometry 1 What is this shape called?
COMP 175: Computer Graphics March 24, 2015
Subdivision/Refinement Dr. S.M. Malaek Assistant: M. Younesi.
11-1: Angle Relationships 4 ways to name angles –Use the vertex as the middle letter, and the point from each side (
C O M P U T E R G R A P H I C S Stuff Jian Chen January 15, 2010 Transformations 1/10 Describing Shape By Andries van Dam.
12.2 Nets and Surface Area.
1 Background and definitions Cindy Grimm. 2 Siggraph 2005, 8/1/ Overview What does it mean to be.
Unit 5 Vocab By: Mika Hamady. Acute Angle Definition: An acute angle is an angle that is less then 90 degrees. Examples: 1.A 43 degree angle is acute.
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.
Geometry 10-1 Solids Face: the flat side of a figure
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.
Review: Area of 2-D Shapes Keystone Geometry.
Constructive manifolds for surface modeling
Geometric Modeling. Volumetric o Collection device obtains regular grid of measurement values Examples: CT, MRI, PET, Ultrasound o Values are interpreted/visualized.
Unit 5 Vocab By: Gus Koza. Acute angle An angle that is less than 90 degrees.
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)
Solid Modeling. Solid Modeling - Polyhedron A polyhedron is a connected mesh of simple planar polygons that encloses a finite amount of space. A polyhedron.
A construction of rational manifold surfaces of arbitrary topology and smoothness from triangular meshes Presented by: LiuGang
By Eugene Adams.  Vertices  Edges  Faces  Polygons  Meshes  2D co-ordinates  3D co-ordinates.
CS418 Computer Graphics John C. Hart
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
Level3456 Angles I can identify right angles I can recognise, measure and draw acute and obtuse angles I know that the sum of the angles on a line is 180.
Lee Byung-Gook Dongseo Univ.
Manifolds or why a cow is a sphere
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.
Exploring Solids and Shapes. Basic Definitions Face: A flat surface on a solid figure. Edge: A line segment where two faces meet Vertex: A point where.
CS559: Computer Graphics Lecture 36: Subdivision Surfaces, Fractals, and Animation Li Zhang Spring 2008 Many slides from James Kuffner’s graphics class.
8.1 Building Blocks of Geometry Point: an exact location [notation] Line: a straight path with no thickness, extending forever in opposite directions [notation]
GEOMETRY!!!. Points  A point is an end of a line segment.  It is an exact location in space.   It is represented by a small dot. Point A A.
Geometry Review.  I am a 3D figure with no edges, no vertices or faces. I can only roll. What figure am I?
Subdivision Schemes. Center for Graphics and Geometric Computing, Technion What is Subdivision?  Subdivision is a process in which a poly-line/mesh is.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
Polygons and angles.
Constructing Objects in Computer Graphics
Bezier Triangles and Multi-Sided Patches
Angle Relationships By Mr. Q.
Types of Polygons Polygon- a flat closed figure made of straight line segments Circle the figures that are polygons. Cross out the figures 
that are.
Advanced Computer Graphics
Goals A high-order surface construction Desirable features
Daniil Rodin for CAGD course, 2016
GEOMETRY SOL 5.13.
Constructing Objects in Computer Graphics By Andries van Dam©
The Variety of Subdivision Schemes
Geometric Constructions
Symmetry and three-dimensional geometry
Grimm and Hughes Input: arbitrary mesh
Patch-based Tessellation for Dual Subdivision on GPU
Projective Transformations for Image Transition Animations
CSE 554 Lecture 10: Extrinsic Deformations
Jeff Ballard Nick Rasmussen
CHAPTER 2: Geometric Constructions
UNIT SELF-TEST QUESTIONS
Jeff Ballard Nick Rasmussen
Presentation transcript:

Grimm and Hughes Input: arbitrary mesh Subdivide once (Catmull-Clark) and take dual Mesh with vertices of valence 4 Charts One for each vertex, edge, face Overlaps Adjacent elements Eg., vertex with 4 faces, 4 edges Transition functions Affine (rotate, translate) or projective where possible Blend where not Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Motivation Maximize overlap Three chart blend better than two Co-cycle condition made > 3 hard Affine transformations (we got close) Generalize spline construction process Blend functions, not points Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Charts Vertex: Square Always valence 4 Edge: Diamond Diamond shape determined by number of sides of adjacent faces Face: N-sided unit polygon Shrunk slightly Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Overlaps Vertex-face: corners Vertex-edge: wedges Edge-face: triangle Edge-vertex: wedges Face-vertex: corner quad Face-edge: triangle Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Transition functions Edge-face: Affine Translate, rotate, translate Face-vertex: Projective Square->quadrilateral Edge-vertex: Composition Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

? Transition functions Edge-vertex: F1 Vertex F2 Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Transition functions C¥ continuous everywhere except blend area Ck in blend area (determined by blend function) At most three charts overlap anywhere Reflexive: Use identity function Symmetric: E-F, V-F both invertible Co-cycle condition satisfied by blend function Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Abstract manifold Barycentric coords “Glue” points that are related through transition functions Each point appears in (at most) one each of a vertex, edge, and face chart f f v e v e Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Adding geometry Blend and embed functions per chart Fit to subdivision surface 1-1 correspondence between manifold and dual mesh Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Blend functions Vertex: Spline surface basis function Edge/face: Spline basis function “spun” in a circle Inscribe Partition of unity formed by dividing by sum of non-zero basis functions Charts overlap sufficiently to guarantee sum non-zero Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Embed functions Spline patches Fit to subdivision surface One-to-one correspondence between dual mesh and charts Implies correspondence between dual mesh and points in the chart Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Plusses Embed functions simple, well-behaved Three-chart overlap Transition functions (mostly) simple Locality Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html

Minuses Blending composition function is ugly Difficult to analyze Large number of charts Siggraph 2005, 8/1/2005 www.cs.wustl.edu/~cmg/Siggraph2005/siggraph.html