09/16/02 Dinesh Manocha, COMP258 Surfaces Locally a 2D manifold: i.e. approximating a plane in the ngbd. of each point. A 2-parameter family of points.

Slides:



Advertisements
Similar presentations
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Advertisements

Splines I – Curves and Properties
Lecture Notes #11 Curves and Surfaces II
© University of Wisconsin, CS559 Spring 2004
Lecture 10 Curves and Surfaces I
Computer Aided Engineering Design
Anupam Saxena Associate Professor Indian Institute of Technology KANPUR
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 13: NURBs, Spline Surfaces Ravi Ramamoorthi Some material.
09/25/02 Dinesh Manocha, COMP258 Triangular Bezier Patches Natural generalization to Bezier curves Triangles are a simplex: Any polygon can be decomposed.
© University of Wisconsin, CS559 Spring 2004
Jehee Lee Seoul National University
08/30/00 Dinesh Manocha, COMP258 Hermite Curves A mathematical representation as a link between the algebraic & geometric form Defined by specifying the.
1 Curves and Surfaces. 2 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized.
Section 4: Implementation of Finite Element Analysis – Other Elements
Rational Bezier Curves
09/04/02 Dinesh Manocha, COMP258 Bezier Curves Interpolating curve Polynomial or rational parametrization using Bernstein basis functions Use of control.
09/18/02 Dinesh Manocha, COMP258 Parametric Patches Tensor product or rectangular patches are of the form: P(u,w) = u,w [0,1]. The number of control points.
1 Lecture 13 Modeling Curved Lines and Surfaces. 2 Types of Surfaces Ruled Surfaces B-Splines and Bezier Curves Surfaces of Revolution.
09/25/02 Dinesh Manocha, COMP258 Subdividing a Bezier Patch Subdivide separately along u and v parameters To subdivide along the u parameter, subdivide.
09/09/02 Dinesh Manocha, COMP258 Properties of Bezier Curves Invariance under affine parameter transformation P i B i,n (u) = P i B i,n ((u –a)/(b-a))
Curves Locus of a point moving with one degree of freedom
Geometric Modeling Surfaces Mortenson Chapter 6 and Angel Chapter 9.
Curves Mortenson Chapter 2-5 and Angel Chapter 9
Bezier and Spline Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico.
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.
ENDS 375 Foundations of Visualization Geometric Representation 10/5/04.
Introduction to Boolean Operations on Free-form Solids CS284, Fall 2004 Seung Wook Kim.
Bezier and Spline Curves and Surfaces CS4395: Computer Graphics 1 Mohan Sridharan Based on slides created by Edward Angel.
Chapter 10: Curves and Surfaces Part 1 E. Angel and D. Shreiner: Interactive Computer Graphics 6E © Addison-Wesley Mohan Sridharan Based on Slides.
1 Representing Curves and Surfaces. 2 Introduction We need smooth curves and surfaces in many applications: –model real world objects –computer-aided.
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.
Parts of Mortenson Chapter 6-9,
Curve Surfaces June 4, Examples of Curve Surfaces Spheres The body of a car Almost everything in nature.
Curves and Surfaces (cont’) Amy Zhang. Conversion between Representations  Example: Convert a curve from a cubic B-spline curve to the Bézier form:
Curve Modeling Bézier Curves
Curves and Surfaces CSE3AGR - Paul Taylor Polynomials of Degree n Degree is equal to the highest exponent of a term. Higher exponents result in.
Creating & Processing 3D Geometry Marie-Paule Cani
V. Space Curves Types of curves Explicit Implicit Parametric.
Introduction to Computer Graphics with WebGL
Quadratic Surfaces. SPLINE REPRESENTATIONS a spline is a flexible strip used to produce a smooth curve through a designated set of points. We.
University of Texas at Austin CS384G - Computer Graphics Fall 2008 Don Fussell Parametric surfaces.
Chapter VI Parametric Curves and Surfaces
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.
Curves and Surfaces Chapter 10. CS 480/680 2Chapter 9 -- Hierarchical Models Introduction: Introduction: Until now we have worked with flat entities such.
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.
Keyframing and Splines Jehee Lee Seoul National University.
CS 376 Introduction to Computer Graphics 04 / 25 / 2007 Instructor: Michael Eckmann.
Representation of Curves & Surfaces Prof. Lizhuang Ma Shanghai Jiao Tong University.
Curves: ch 4 of McConnell General problem with constructing curves: how to create curves that are “smooth” CAD problem Curves could be composed of segments.
Rendering Curves and Surfaces Ed Angel Professor of Computer Science, Electrical and Computer Engineering, and Media Arts University of New Mexico 1 Angel:
11/6/ :55 Graphics II Introduction to Parametric Curves and Surfaces Session 2.
Splines I – Curves and Properties based on: Michael Gleicher Curves, chapter 15 in Fundamentals of Computer Graphics, 3 rd ed. (Shirley & Marschner) Slides.
Computing & Information Sciences Kansas State University Lecture 31 of 42CIS 636/736: (Introduction to) Computer Graphics Lecture 32 of 42 Wednesday, 11.
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.
CS 325 Computer Graphics 04 / 30 / 2010 Instructor: Michael Eckmann.
Ship Computer Aided Design
Surface Modeling Parametric Surfaces Dr. S.M. Malaek Assistant: M. Younesi.
SIAM Conference on Geometric Desing & Computing Approximation of spatial data with shape constraints Maria Lucia Sampoli University of Siena, Italy.
Object Modeling: Curves and Surfaces CEng 477 Introduction to Computer Graphics.
Introduction to Parametric Curve and Surface Modeling.
Computer Graphics Lecture 38
Curve & Surface.
Representation of Curves & Surfaces
© University of Wisconsin, CS559 Fall 2004
Chapter XVII Parametric Curves and Surfaces
Implicit Functions Some surfaces can be represented as the vanishing points of functions (defined over 3D space) Places where a function f(x,y,z)=0 Some.
Parametric Line equations
Curves and Surfaces (I)
Presentation transcript:

09/16/02 Dinesh Manocha, COMP258 Surfaces Locally a 2D manifold: i.e. approximating a plane in the ngbd. of each point. A 2-parameter family of points Surface representations: used to construct, evaluate, analyze points and curves, to reveal special properties, demonstrate the relationship to other geometric objects Commonly used surface representations: explicit (parametric) or implicit (algebraic) Explicit formulations are bivariate parametric equations: tensor product, triangular patches or n-sided patches Procedural formulations: Generalized implicits, subdivision surfaces =

09/16/02 Dinesh Manocha, COMP258 Implicit Surfaces Implicit formulation:F(x,y,z) = 0, where F() is a polynomial in x,y and z of the form: If F() is irreducible polynomial, the degree of the surface is: i+j+k Geometrically the degree refers to the maximum number of intersections any line can have the surface (assuming finite intersections) Any rational parametric surface can be converted into algebraic (implicit) surface: implicitization

09/16/02 Dinesh Manocha, COMP258 Quadric Surfaces Given as F(x,y,z) = 0, where F() is a quadratic polynomial in x,y and z of the form: If A = B = C = -K = 1 & D = E = F = G = H = J = 0, then it produces a unit sphere at the origin. Also given in matrix form as: P Q P T = 0, where P = [x y z 1] & Q= ADFG DBEH FECJ GHJK

09/16/02 Dinesh Manocha, COMP258 Quadric Surfaces The coefficients of Q many have no direct physical or geometric meaning A rigid body transformation, can be directly applied to Q as: Q’ = T –1 Q [T –1 ] T Certain properties of the matrix of quadric equation are invariant under rigid transformation, including the determinants |Q| and |Q u |,where Q u is the matrix corresponding to the gradient (or normal) vectors

09/16/02 Dinesh Manocha, COMP258 Parametric Surfaces The most common mathematical element used to model a surface is a patch (equivalent to a segment of spline curve). A patch is a curve-bounded collection of points whose coordinates are given by continuous, bivariate, single-valued polynomials of the form P(u,w) = (x y z), where: x = X(u,w)y = Y(u,w)z = Z(u,w), where the parametric variables u and w are typically constrained to the intervals, u,w [0,1]. This generates a rectangular patch, though there are other topological variations (e.g. triangular or n-sided). Fixing the value of one of the parametric variables results in a curve on the patch in terms of the other variable. Or generate a curve net.

09/16/02 Dinesh Manocha, COMP258 Parametric Surfaces: Patches Each patch has a set of boundary conditions associated with it: four corner points (P(0,0), P(0,1), P(1,0), P(1,1)), four curves defining its edges (P(u,0), P(u,1), P(0,w), P(1,w)), tangent vectors or planes (P u (u,w), P w (u,w)) normal vectors (P u (u,w) X P w (u,w)) twist vectors defined at the corner points In practice, composite arrays are put together or assembled to represent complex surfaces (with some appropriate continuity conditions at the boundary) Commonly used patches: Hermite patch, Bezier patch, B-spline patch (or NURBS)

09/16/02 Dinesh Manocha, COMP258 Parametric Surfaces (NURBS): Drawbacks Division by zero (for the rational forms) Non-uniform parametrization of arcs (important in CAD/CAM) Many surfaces cannot be efficiently represented as NURBS(e.g. helicoidal surfaces) Irregular isoparametric surface meshes resulting from the use of nonuniform weights (for the rational forms) Ill-conditioned basis for surface fitting Lack of closure under geometric operations (composition, projection, intersection, offsets etc.)