Grimm and Hughes Input: arbitrary mesh

Slides:



Advertisements
Similar presentations
TESSELLATIONS Oleh : Sulistyana SMP N 1 Wonosari.
Advertisements

Symmetry in the Plane Chapter 8.
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,
Rüdiger Westermann Lehrstuhl für Computer Graphik und Visualisierung
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.
CS CS 175 – Week 4 Triangle Mesh Smoothing Discrete Differential Geometry.
Introduction to Subdivision Surfaces. Subdivision Curves and Surfaces 4 Subdivision curves –The basic concepts of subdivision. 4 Subdivision surfaces.
Angles Triangles, Quadrilaterals, Polygons. Remember Angles around a single point add up to
Abner And Shae. Complementary angles: Two angles whose measures have a sum of 90 degrees. Supplementary Angles: Two angles whose measures have a sum of.
Smooth Spline Surfaces over Irregular Topology Hui-xia Xu Wednesday, Apr. 4, 2007.
1 Course 13: Manifolds and Modeling Monday 8:30-12:15 Cindy Grimm Media and Machines Lab Department of Computer Science and Engineering Washington University.
Ziting (Vivien) Zhou1 Drawing Graphs By Computer Graph from
Subdivision surfaces Construction and analysis Martin Reimers CMA/IFI, University of Oslo September 24th 2004.
GEOMETRY SOL Geometry 1 What is this shape called?
Tessellations 5.9 Pre-Algebra.
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 (
12.2 Nets and Surface Area.
1 Background and definitions Cindy Grimm. 2 Siggraph 2005, 8/1/ Overview What does it mean to be.
The mathematical study of the properties, measurements, and relationships of points, lines, planes, surfaces, angles, and solids. Geometry.
Cindy Grimm Parameterization with Manifolds Cindy Grimm.
CHAPTER 24 Polygons. Polygon Names A POLYGON is a shape made up of only STRAIGHT LINES.
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.
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.
Tessellations *Regular polygon: all sides are the same length (equilateral) and all angles have the same measure (equiangular)
(page ) Indicator  G2: Properties of 2- dimensional figures.
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.
Geometry. Triangles Triangle angle sum theorem: the sum of the angles in any triangle is 180° Triangle inequality theorem: the sum of the lengths of any.
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.
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.
Manifolds or why a cow is a sphere
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 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.
Chapter13-6 Similar and Congruent Figures
Polygons and angles.
Bezier Triangles and Multi-Sided Patches
Angle Relationships By Mr. Q.
Tessellations A tessellation is made by reflecting, rotating or translating a shape. A shape will tessellate if it can be used to completely fill a space.
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
Chapter 4.2 Notes: Apply Congruence and Triangles
Grimm and Hughes Input: arbitrary mesh
CSE 554 Lecture 10: Extrinsic Deformations
Jeff Ballard Nick Rasmussen
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 2006, 7/31/2006 www.cs.wustl.edu/~cmg

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 2006, 7/31/2006 www.cs.wustl.edu/~cmg

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 2006, 7/31/2006 www.cs.wustl.edu/~cmg

Overlaps Vertex-face: corners Vertex-edge: wedges Edge-face: triangle Edge-vertex: wedges Face-vertex: corner quad Face-edge: triangle Siggraph 2006, 7/31/2006 www.cs.wustl.edu/~cmg

Transition functions Edge-face: Affine Translate, rotate, translate Face-vertex: Projective Square->quadrilateral Edge-vertex: Composition Siggraph 2006, 7/31/2006 www.cs.wustl.edu/~cmg

Transition functions Edge-vertex: Blend transition functions Siggraph 2006, 7/31/2006 www.cs.wustl.edu/~cmg

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 2006, 7/31/2006 www.cs.wustl.edu/~cmg

Adding geometry Blend function per chart “Bump” covering chart Partition of unity by dividing by sum of overlapping Embed function is a spline Fit to subdivision surface 1-1 correspondence between manifold and dual mesh Siggraph 2006, 7/31/2006 www.cs.wustl.edu/~cmg

Plusses Embed functions simple, well-behaved Three-chart overlap Transition functions (mostly) simple Locality Siggraph 2006, 7/31/2006 www.cs.wustl.edu/~cmg

Minuses Blending composition function is ugly Difficult to analyze Large number of charts Siggraph 2006, 7/31/2006 www.cs.wustl.edu/~cmg