Curves, Surfaces and Segments, Patches
|
|
- Elijah Arron Newman
- 5 years ago
- Views:
Transcription
1 Curves, Surfaces and Segments, atches The University of Texas at Austin
2 Conics: Curves and Quadrics: Surfaces Implicit form arametric form Rational Bézier Forms and Join Continuity Recursive Subdivision of Bézier Curve segments Recursive Subdivision of Bézier Surface patches The University of Texas at Austin 2
3 Conic Curves Conic Sections (Implicit form) Ellipse Hyperbola arabola x 2 a 2 + y2 b 2 = a,b > 0 x 2 a 2 y2 b 2 = a,b > 0 y 2 = 4ax a > 0 The University of Texas at Austin 3
4 Conic Sections (arametric form) Ellipse Hyperbola x(t) = a t2 + t 2 y(t) = b 2t ( < t < + ) + t2 x(t) = a + t2 t 2 y(t) = b 2t ( < t < + ) t2 The University of Texas at Austin 4
5 arabola x(t) = at 2 y(t) = 2at ( < t < + ) The University of Texas at Austin 5
6 Constructing Curve Segments Linear blend: Line segment from an affine combination of points 0 (t) = ( t) 0 + t t ( _ t ) 0 0 The University of Texas at Austin 6
7 Quadratic blend: Quadratic segment from an affine combination of line segments 0 (t) = ( t) 0 + t (t) = ( t) + t (t) = ( t) 0 (t) + t (t) The University of Texas at Austin 7
8 Cubic blend: Cubic segment from an affine combination of quadratic segments 0 (t) = ( t) 0 + t (t) = ( t) + t (t) = ( t) 0 (t) + t (t) 2 (t) = ( t) 2 + t 3 2 (t) = ( t) (t) + t 2 (t) 3 0 (t) = ( t)2 0 (t) + t2 (t) The University of Texas at Austin 8
9 The pattern should be evident for higher degrees 3 The University of Texas at Austin 9
10 Geometric view (de Casteljau Algorithm): Join the points i by line segments Join the t : ( t) points of those line segments by line segments Repeat as necessary The t : ( t) point on the final line segment is a point on the curve The final line segment is tangent to the curve at t 0 t 0 ( _ ) t _ ) ( t 0 2 t ( _ t) t The University of Texas at Austin 0
11 Expanding Terms (Basis olynomials): The original points appear as coefficients of Bernstein polynomials 0 0 (t) = 0 0 (t) = ( t) 0 + t 2 0 (t) = ( t) ( t)t + t (t) = ( t) ( t) 2 t + 3( t)t t 3 3 n n 0 (t) = i B n i (t) i=0 where B n i (t) = n! (n i)!i! ( t)n i t i = ( n i ) ( t) n i t i The Bernstein polynomials of degree n form a basis for the space of all degree-n polynomials The University of Texas at Austin
12 Recursive evaluation schemes: To obtain curve points (upward diagram): Start with given points and form successive, pairwise, affine combinations 0 i j i = i = ( t) j i + t j i+ The generated points j i are the decasteljau points To obtain basis polynomials (downward diagram): Start with and form successive, pairwise, affine combinations B 0 0 = B j i = ( t)b j i + tb j i+ where B s r = 0 when r < 0 or r > s The University of Texas at Austin 2
13 0 3 ( _ t) t 0 2 ( _ t) t ( _ t) 2 t 0 2 ( _ t) t ( _ t) ( _ t t) t The University of Texas at Austin 3
14 ( _ t) B0 0 t B0 B ( _ t) t ( _ t) t 2 B0 2 B ( _ t) t ( _ t) ( _ t t) 2 B 2 t 3 B B B 2 B 3 The University of Texas at Austin 4
15 Bernstein-Bézier (BB) Splines Bernstein-Bézier (BB) Curve Segments and their roperties Definition: A degree n (order n + ) Bernstein-Bézier curve segment is (t) = n i=0 i B n i (t) where the i are k-dimensional control points. The University of Texas at Austin 5
16 Rational Quadratic BB Forms Quadratic Rational BB Form: Homogeneous form x(t) y(t) w(t) = x 0 y 0 w 0 B 2 0 (t) + x y w B 2 (t) + x 2 y 2 w 2 B 2 2 (t) = x 0 B 2 0 (t) + x B 2 (t) + x 2B 2 2 (t) y 0 B 2 0 (t) + y B 2 (t) + y 2B 2 2 (t) w 0 B 2 0 (t) + w B 2 (t) + w 2B 2 2 (t) The University of Texas at Austin 6
17 Rational (projected) form [ x(t) ȳ(t) ] = x 0 B 0 2 (t)+x B2 (t)+x 2 B2 2 (t) w 0 B 0 2(t)+w B2 (t)+w 2 B2 2 (t) y 0 B 0 2 (t)+y B2 (t)+y 2 B2 2 (t) w 0 B 0 2(t)+w B2 (t)+w 2 B2 2 (t) = [ x0 y 0 ] B 2 0 (t) + [ x y ] B 2 (t) + [ x2 y 2 w 0 B 2 0 (t) + w B 2 (t) + w 2B 2 2 (t) ] B 2 2 (t) The University of Texas at Austin 7
18 Conversions: Conic parameterization elements in BB form 2t = B 2 (t) + 2B2 2 (t) t 2 = B 2 0 (t) + B2 (t) + t 2 = B 2 0 (t) + B2 (t) + 2B2 2 (t) t 2 = B 2 2 (t) The University of Texas at Austin 8
19 Conics as Rational Bézier Curves Conics as NURBS (Ellipse) Rational Bézier [ x(t) y(t) ] = [ a( t 2 ) b(2t) + t 2 ] = [ ab 2 0 (t) + ab2 (t) + 0B2 2 (t) 0B 2 0 (t) + bb2 (t) + b2b2 2 (t) B 2 0 (t) + B2 (t) + 2B2 2 (t) ] = [ a 0 ] [ ] [ ] a 0 B 2 0 (t) B 2 b (t) B 2 2 2b (t) B 2 0 (t) + B2 (t) + 2B2 2 (t) The University of Texas at Austin 9
20 which implies w 0 = x 0 = a y 0 = 0 w = x = a y = b w 2 = 2 x 2 = 0 y 2 = 2b The University of Texas at Austin 20
21 Conics as NURBS (Hyperbola) Rational Bézier [ x(t) y(t) ] = [ a( + t 2 ) b(2t) t 2 ] = [ ab 2 0 (t) + ab2 (t) + a2b2 2 (t) 0B 2 0 (t) + bb2 (t) + b2b2 2 (t) ] B 2 0 (t) + B2 (t) = [ a 0 ] [ a B 2 0 (t) b ] B 2 (t) [ 2a 2b B 2 0 (t) + B2 (t) + 0B2 2 (t) ] B 2 2 (t) which implies w 0 = x 0 = a y 0 = 0 w = x = a y = b w 2 = 0 x 2 = 2a y 2 = 2b The University of Texas at Austin 2
22 Conics as NURBS (arabola) Rational Bézier [ x(t) y(t) ] = [ a(t 2 ) a(2t) ] = [ 0B 2 0 (t) + 0B2 (t) + ab2 2 (t) 0B 2 0 (t) + ab2 (t) + a2b2 2 (t) ] B 2 0 (t) + B2 (t) + B2 2 (t) = [ 0 0 ] [ ] [ 0 a B 2 0 (t) B 2 a (t) 2a B 2 0 (t) + B2 (t) + B2 2 (t) ] B 2 2 (t) which implies w 0 = x 0 = 0 y 0 = 0 w = x = 0 y = a w 2 = x 2 = a y 2 = 2a The University of Texas at Austin 22
23 Not Unique x,y,w are not unique Numerator and denominator can be multiplied by a common (positive) factor The following example is a common alternative form: [ x(t) y(t) ] = [ x0 y 0 which derives from rewriting ] w 0 B 2 0 (t) + [ x y ] w B 2 (t) + [ x2 y 2 w 0 B 2 0 (t) + w B 2 (t) + w 2B 2 2 (t) x y w w x ȳ ] w 2 B 2 2 (t) The University of Texas at Austin 23
24 Bernstein-Bézier Curve roperties Convex Hull: n B n i (t) =, Bn i i=0 (t) 0 for t [0,] = (t) is a convex combination of the i for t [0,] = (t) lies within convex hull of i for t [0,] The University of Texas at Austin 24
25 Affine Invariance: A Bernstein-Bézier curve is an affine combination of its control points Any affine transformation of a curve is the curve of the transformed control points T ( n ) i B n i (t) = i=0 n T( i )B n i (t) i=0 This property does not hold for projective transformations! Interpolation: B n 0 (0) =,Bn n () =, n B n i (t) =,Bn i i=0 (t) 0 for t [0,] = B n i (0) = 0 if i 0,Bn i () = 0 if i n = (0) = 0,() = n The University of Texas at Austin 25
26 Derivatives: d dt Bn i (t) = n( B n i (t) Bn i (t) ) = (0) = n( 0 ), () = n( n n ) The University of Texas at Austin 26
27 Smoothly Joined Curve Segments (G continuity) Let n, n be the last two control points of one segment Let Q 0, Q be the first two control points of the next segment n = Q 0 ( n n ) = β(q Q 0 ) for some β > 0 n- n Q 0 Q The University of Texas at Austin 27
28 Recurrence, Subdivision: B n i (t) = ( t)bn i + tb n i (t) = decasteljau s algorithm: (t) = n o (t) k i (t) = ( t)k i (t) + t k i+ (t) 0 i = i Use to evaluate point at t, or subdivide into two new curves: 0 0, 0,...n 0 0 n, n,...n 0 are the control points for the left half are the control points for the right half The University of Texas at Austin 28
29 The University of Texas at Austin 29
30 Quadric Surfaces Implicit form Ellipsoid Hyperboloid Hyperbolic araboloid arabolic x 2 a 2 + y2 b 2 + z2 c 2 = a,b,c > 0 x 2 a 2 + y2 b 2 z2 c 2 = a,b,c > 0 x 2 a 2 y2 b 2 z2 c 2 = a,b,c > 0 y 2 = 4ax a > 0 arametric form The University of Texas at Austin 30
31 Ellipsoid x(s,t) = a s2 t 2 + s 2 + t 2 2s y(s, t) = b ( < s < + ) + s 2 + t2 2t z(s, t) = b ( < t < + ) + s 2 + t2 araboloid x(s,t) = a(s 2 + t 2 ) y(s,t) = as ( < s < + ) z(s,t) = at ( < t < + ) The University of Texas at Austin 3
32 Tensor roduct Bernstein-Bézier atches Tensor atches: The control polygon is the polygonal mesh with vertices i,j The patch basis functions are products of Bézier curve basis functions (s,t) = n i=0 n i,j B n i,j (s,t) j=0 where B n i,j (s,t) = Bn i (s)bn j (t) The University of Texas at Austin 32
33 The University of Texas at Austin 33
34 roperties: Tensor Bernstein-Bézier atch basis functions sume to one n i=0 n B n i (s)bn j (t) = j=0 atch basis functions are nonnegative on [0, ] [0, ] B n i (s)bn j (t) 0 for 0 s,t = Surface patch is in the convex hull of the control points = Surface patch is affinely invariant (Transform the patch by transforming the control points) Subdivision, Recursion, Evaluation: As for curves in each variable separately and independently Normals must be computed from partial derivatives The University of Texas at Austin 34
35 artial Derivatives: Ordinary derivative in each variable separately : s (s,t) = t (s,t) = n i=0 n i=0 n [ d i,j ds Bn i ]B (s) n j (t) j=0 n [ ] d i,j B n i (s) dt Bn j (t) j=0 Each of the above is a tangent vector in a parametric direction Surface is regular at each (s,t) where these two vectors are linearly independent The (unnormalized) surface normal is given at any regular point by ± [ s (s,t) ] t (s,t) (the sign dictates what is the outward pointing normal) The University of Texas at Austin 35
36 In particular, the cross-boundary tangent is given by (e.g., for the s = 0 boundary): n n i=0 n (,j 0,j )B n j (t) j=0 (and similarly for the other boundaries) The University of Texas at Austin 36
37 Smoothly Joined Tensor Bernstein-Bézier atches: 2 3 Q 02 0 Q Q 0 Q Q 20 Q 2 Q Q 3 32 Can be achieved by ensuring that ( i,n i,n ) = β(q i, Qi,0) for β > 0 (and correspondingly for other boundaries) The University of Texas at Austin 37
38 Rendering via Subdivision: Divide up into polygons:. By stepping s = 0,δ,2δ,..., t =,γ,2γ,..., and joining up sides and diagonals to produce a triangular mesh 2. By subdividing and rendering the control polygon The University of Texas at Austin 38
39 Barycentric Triangular Bernstein-Bézier atches de Casteljau Revisited Barycentrically: Linear blend expressed in barycentric terms ( t) 0 + t = r 0 + t where r + t = Higher powers and a symmetric form of the Bernstein polynomials: n ( ) n! (t) = i ( t) n i t i i!(n i)! i=0 = ( ) n! i t i r j where r + t = i!j! i+j=n i 0,j 0 = i+j=n i 0,j 0 ij B n ij (r,t) The University of Texas at Austin 39
40 Examples {B 0 00 (r,t)} = {} {B 0 (r,t),b 0 (r,t)} = {r,t} {B 2 02 (r,t),b2 (r,t),b2 20 (r,t)} = {r2,2rt,t 2 } {B 3 03 (r,t),b3 2 (r,t),b3 2 (r,t),b3 30 (r,t)} = {r3,3r 2 t,3rt 2,t 3 } The University of Texas at Austin 40
41 Surfaces Barycentric Blends on Triangles: Formulas (r,s,t) = i+j+k=n i 0,j 0,k 0 B n n! ijk (r,s,t) = i!j!k! ri s j t k ijk B n ijk (r,s,t) The University of Texas at Austin 4
42 Triangular Bézier Surface atches Triangular decasteljau: Join adjacently indexed ijk by triangles Find r : s : t barycentric point in each triangle Join adjacent points by triangles Repeat Final point is the surface point (r,s,t) final triangle is tangent to the surface at (r,s,t) Triangle up/down schemes become tetrahedral up/down schemes roperties: The University of Texas at Austin 42
43 Each boundary curve is a Bézier curve atches will be joined smoothly if pairs of boundary triangles are planar as shown Q Q Q 02 The University of Texas at Austin 43
44 Reading Assignment and News Before the next class please review Chapter 0 and its practice exercises, of the recommended text. (Recommended Text: Interactive Computer Graphics, by Edward Angel, Dave Shreiner, 6th edition, Addison-Wesley) lease track Blackboard for the most recent Announcements and roject postings related to this course. ( The University of Texas at Austin 44
The Essentials of CAGD
The Essentials of CAGD Chapter 4: Bézier Curves: Cubic and Beyond Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2000
More informationIntroduction to Curves. Modelling. 3D Models. Points. Lines. Polygons Defined by a sequence of lines Defined by a list of ordered points
Introduction to Curves Modelling Points Defined by 2D or 3D coordinates Lines Defined by a set of 2 points Polygons Defined by a sequence of lines Defined by a list of ordered points 3D Models Triangular
More informationM2R IVR, October 12th Mathematical tools 1 - Session 2
Mathematical tools 1 Session 2 Franck HÉTROY M2R IVR, October 12th 2006 First session reminder Basic definitions Motivation: interpolate or approximate an ordered list of 2D points P i n Definition: spline
More informationCSE 167: Lecture 11: Bézier Curves. Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012
CSE 167: Introduction to Computer Graphics Lecture 11: Bézier Curves Jürgen P. Schulze, Ph.D. University of California, San Diego Fall Quarter 2012 Announcements Homework project #5 due Nov. 9 th at 1:30pm
More informationArsène Pérard-Gayot (Slides by Piotr Danilewski)
Computer Graphics - Splines - Arsène Pérard-Gayot (Slides by Piotr Danilewski) CURVES Curves Explicit y = f x f: R R γ = x, f x y = 1 x 2 Implicit F x, y = 0 F: R 2 R γ = x, y : F x, y = 0 x 2 + y 2 =
More informationOn-Line Geometric Modeling Notes
On-Line Geometric Modeling Notes CUBIC BÉZIER CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview The Bézier curve representation
More informationBernstein polynomials of degree N are defined by
SEC. 5.5 BÉZIER CURVES 309 5.5 Bézier Curves Pierre Bézier at Renault and Paul de Casteljau at Citroën independently developed the Bézier curve for CAD/CAM operations, in the 1970s. These parametrically
More informationCMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier
CMSC427 Parametric curves: Hermite, Catmull-Rom, Bezier Modeling Creating 3D objects How to construct complicated surfaces? Goal Specify objects with few control points Resulting object should be visually
More informationCGT 511. Curves. Curves. Curves. What is a curve? 2) A continuous map of a 1D space to an nd space
Curves CGT 511 Curves Bedřich Beneš, Ph.D. Purdue University Department of Computer Graphics Technology What is a curve? Mathematical ldefinition i i is a bit complex 1) The continuous o image of an interval
More informationInterpolation and polynomial approximation Interpolation
Outline Interpolation and polynomial approximation Interpolation Lagrange Cubic Splines Approximation B-Splines 1 Outline Approximation B-Splines We still focus on curves for the moment. 2 3 Pierre Bézier
More informationApproximation of Circular Arcs by Parametric Polynomials
Approximation of Circular Arcs by Parametric Polynomials Emil Žagar Lecture on Geometric Modelling at Charles University in Prague December 6th 2017 1 / 44 Outline Introduction Standard Reprezentations
More informationLecture 23: Hermite and Bezier Curves
Lecture 23: Hermite and Bezier Curves November 16, 2017 11/16/17 CSU CS410 Fall 2017, Ross Beveridge & Bruce Draper 1 Representing Curved Objects So far we ve seen Polygonal objects (triangles) and Spheres
More informationMAT300/500 Programming Project Spring 2019
MAT300/500 Programming Project Spring 2019 Please submit all project parts on the Moodle page for MAT300 or MAT500. Due dates are listed on the syllabus and the Moodle site. You should include all neccessary
More informationIntroduction to Computer Graphics. Modeling (1) April 13, 2017 Kenshi Takayama
Introduction to Computer Graphics Modeling (1) April 13, 2017 Kenshi Takayama Parametric curves X & Y coordinates defined by parameter t ( time) Example: Cycloid x t = t sin t y t = 1 cos t Tangent (aka.
More informationComputergrafik. Matthias Zwicker Universität Bern Herbst 2016
Computergrafik Matthias Zwicker Universität Bern Herbst 2016 2 Today Curves Introduction Polynomial curves Bézier curves Drawing Bézier curves Piecewise curves Modeling Creating 3D objects How to construct
More informationCurves. Hakan Bilen University of Edinburgh. Computer Graphics Fall Some slides are courtesy of Steve Marschner and Taku Komura
Curves Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 Some slides are courtesy of Steve Marschner and Taku Komura How to create a virtual world? To compose scenes We need to define objects
More informationAn O(h 2n ) Hermite approximation for conic sections
An O(h 2n ) Hermite approximation for conic sections Michael Floater SINTEF P.O. Box 124, Blindern 0314 Oslo, NORWAY November 1994, Revised March 1996 Abstract. Given a segment of a conic section in the
More informationBézier Curves and Splines
CS-C3100 Computer Graphics Bézier Curves and Splines Majority of slides from Frédo Durand vectorportal.com CS-C3100 Fall 2017 Lehtinen Before We Begin Anything on your mind concerning Assignment 1? CS-C3100
More informationGeometric meanings of the parameters on rational conic segments
Science in China Ser. A Mathematics 005 Vol.48 No.9 09 09 Geometric meanings of the parameters on rational conic segments HU Qianqian & WANG Guojin Department of Mathematics, Zhejiang University, Hangzhou
More informationMA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs
MA 323 Geometric Modelling Course Notes: Day 07 Parabolic Arcs David L. Finn December 9th, 2004 We now start considering the basic curve elements to be used throughout this course; polynomial curves and
More informationLecture 20: Bezier Curves & Splines
Lecture 20: Bezier Curves & Splines December 6, 2016 12/6/16 CSU CS410 Bruce Draper & J. Ross Beveridge 1 Review: The Pen Metaphore Think of putting a pen to paper Pen position described by time t Seeing
More information1.1. The analytical denition. Denition. The Bernstein polynomials of degree n are dened analytically:
DEGREE REDUCTION OF BÉZIER CURVES DAVE MORGAN Abstract. This paper opens with a description of Bézier curves. Then, techniques for the degree reduction of Bézier curves, along with a discussion of error
More informationLecture 20: Lagrange Interpolation and Neville s Algorithm. for I will pass through thee, saith the LORD. Amos 5:17
Lecture 20: Lagrange Interpolation and Neville s Algorithm for I will pass through thee, saith the LORD. Amos 5:17 1. Introduction Perhaps the easiest way to describe a shape is to select some points on
More informationSmooth Path Generation Based on Bézier Curves for Autonomous Vehicles
Smooth Path Generation Based on Bézier Curves for Autonomous Vehicles Ji-wung Choi, Renwick E. Curry, Gabriel Hugh Elkaim Abstract In this paper we present two path planning algorithms based on Bézier
More informationRational Bézier Patch Differentiation using the Rational Forward Difference Operator
Rational Bézier Patch Differentiation using the Rational Forward Difference Operator Xianming Chen, Richard F. Riesenfeld, Elaine Cohen School of Computing, University of Utah Abstract This paper introduces
More informationLagrange Interpolation and Neville s Algorithm. Ron Goldman Department of Computer Science Rice University
Lagrange Interpolation and Neville s Algorithm Ron Goldman Department of Computer Science Rice University Tension between Mathematics and Engineering 1. How do Mathematicians actually represent curves
More informationPythagorean-hodograph curves
1 / 24 Pythagorean-hodograph curves V. Vitrih Raziskovalni matematični seminar 20. 2. 2012 2 / 24 1 2 3 4 5 3 / 24 Let r : [a, b] R 2 be a planar polynomial parametric curve ( ) x(t) r(t) =, y(t) where
More informationComputer Aided Design. B-Splines
1 Three useful references : R. Bartels, J.C. Beatty, B. A. Barsky, An introduction to Splines for use in Computer Graphics and Geometric Modeling, Morgan Kaufmann Publications,1987 JC.Léon, Modélisation
More informationMA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm
MA 323 Geometric Modelling Course Notes: Day 11 Barycentric Coordinates and de Casteljau s algorithm David L. Finn December 16th, 2004 Today, we introduce barycentric coordinates as an alternate to using
More informationSample Exam 1 KEY NAME: 1. CS 557 Sample Exam 1 KEY. These are some sample problems taken from exams in previous years. roughly ten questions.
Sample Exam 1 KEY NAME: 1 CS 557 Sample Exam 1 KEY These are some sample problems taken from exams in previous years. roughly ten questions. Your exam will have 1. (0 points) Circle T or T T Any curve
More informationIntroduction. Chapter Points, Vectors and Coordinate Systems
Chapter 1 Introduction Computer aided geometric design (CAGD) concerns itself with the mathematical description of shape for use in computer graphics, manufacturing, or analysis. It draws upon the fields
More informationMA 323 Geometric Modelling Course Notes: Day 12 de Casteljau s Algorithm and Subdivision
MA 323 Geometric Modelling Course Notes: Day 12 de Casteljau s Algorithm and Subdivision David L. Finn Yesterday, we introduced barycentric coordinates and de Casteljau s algorithm. Today, we want to go
More informationHome Page. Title Page. Contents. Bezier Curves. Milind Sohoni sohoni. Page 1 of 27. Go Back. Full Screen. Close.
Bezier Curves Page 1 of 27 Milind Sohoni http://www.cse.iitb.ac.in/ sohoni Recall Lets recall a few things: 1. f : [0, 1] R is a function. 2. f 0,..., f i,..., f n are observations of f with f i = f( i
More information1 Vectors and 3-Dimensional Geometry
Calculus III (part ): Vectors and 3-Dimensional Geometry (by Evan Dummit, 07, v..55) Contents Vectors and 3-Dimensional Geometry. Functions of Several Variables and 3-Space..................................
More informationKatholieke Universiteit Leuven Department of Computer Science
Interpolation with quintic Powell-Sabin splines Hendrik Speleers Report TW 583, January 2011 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A B-3001 Heverlee (Belgium)
More informationVisualizing Bezier s curves: some applications of Dynamic System Geogebra
Visualizing Bezier s curves: some applications of Dynamic System Geogebra Francisco Regis Vieira Alves Instituto Federal de Educação, Ciência e Tecnologia do Estado do Ceará IFCE. Brazil fregis@ifce.edu.br
More informationReading. w Foley, Section 11.2 Optional
Parametric Curves w Foley, Section.2 Optional Reading w Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics and Geometric Modeling, 987. w Farin. Curves and Surfaces for
More informationCS 536 Computer Graphics NURBS Drawing Week 4, Lecture 6
CS 536 Computer Graphics NURBS Drawing Week 4, Lecture 6 David Breen, William Regli and Maxim Peysakhov Department of Computer Science Drexel University 1 Outline Conic Sections via NURBS Knot insertion
More informationx = x y and y = x + y.
8. Conic sections We can use Legendre s theorem, (7.1), to characterise all rational solutions of the general quadratic equation in two variables ax 2 + bxy + cy 2 + dx + ey + ef 0, where a, b, c, d, e
More informationCubic Splines; Bézier Curves
Cubic Splines; Bézier Curves 1 Cubic Splines piecewise approximation with cubic polynomials conditions on the coefficients of the splines 2 Bézier Curves computer-aided design and manufacturing MCS 471
More informationHigh order parametric polynomial approximation of conic sections
High order parametric polynomial approximation of conic sections Gašper Jaklič a,b,c, Jernej Kozak a,b, Marjeta Krajnc a,b, Vito Vitrih c, Emil Žagar a,b, a FMF, University of Ljubljana, Jadranska 19,
More informationContinuous Curvature Path Generation Based on Bézier Curves for Autonomous Vehicles
Continuous Curvature Path Generation Based on Bézier Curves for Autonomous Vehicles Ji-wung Choi, Renwick E. Curry, Gabriel Hugh Elkaim Abstract In this paper we present two path planning algorithms based
More informationMath 234. What you should know on day one. August 28, You should be able to use general principles like. x = cos t, y = sin t, 0 t π.
Math 234 What you should know on day one August 28, 2001 1 You should be able to use general principles like Length = ds, Area = da, Volume = dv For example the length of the semi circle x = cos t, y =
More informationSubdivision Matrices and Iterated Function Systems for Parametric Interval Bezier Curves
International Journal of Video&Image Processing Network Security IJVIPNS-IJENS Vol:7 No:0 Subdivision Matrices Iterated Function Systems for Parametric Interval Bezier Curves O. Ismail, Senior Member,
More informationLinear precision for parametric patches Special session on Applications of Algebraic Geometry AMS meeting in Vancouver, 4 October 2008
Linear precision for parametric patches Special session on Applications of Algebraic Geometry AMS meeting in Vancouver, 4 October 2008 Frank Sottile sottile@math.tamu.edu 1 Overview (With L. Garcia, K.
More informationConversion of Quadrics into Rational Biquadratic Bézier Patches
Conversion of Quadrics into Rational Biquadratic Bézier Patches Lionel Garnier, Sebti Foufou, and Dominique Michelucci LEI, UMR CNRS 558 UFR Sciences, University of Burgundy, BP 7870, 078 Dijon Cedex,
More informationCG Basics 1 of 10. Mathematical Foundations: Vectors, Matrices, & Parametric Equations
CG Basics 1 of 10 ematical Foundations: Vectors, Matrices, & Parametric Equations William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://bit.ly/hgvxlh Course web
More informationThe Algebra and Geometry of Curve and Surface Inversion
Brigham Young University BYU ScholarsArchive All Faculty Publications 2002-01-01 The Algebra and Geometry of Curve and Surface Inversion Thomas W. Sederberg tom@cs.byu.edu Eng-Wee Chionh See next page
More informationComputing roots of polynomials by quadratic clipping
Computing roots of polynomials by quadratic clipping Michael Bartoň, Bert Jüttler SFB F013, Project 15 Johann Radon Institute for Computational and Applied Mathematics, Linz, Austria e-mail: Michael.Barton@oeaw.ac.at
More informationA Relationship Between Minimum Bending Energy and Degree Elevation for Bézier Curves
A Relationship Between Minimum Bending Energy and Degree Elevation for Bézier Curves David Eberly, Geometric Tools, Redmond WA 9852 https://www.geometrictools.com/ This work is licensed under the Creative
More informationOn the Normal Parameterization of Curves and Surfaces
On the Normal Parameterization of Curves and Surfaces Xiao-Shan Gao Institute of Systems Science, Academia Sinica, Beijing Shang-Ching Chou The University of Texas at Austin, Austin, Texas 78712 USA International
More informationNovel polynomial Bernstein bases and Bézier curves based on a general notion of polynomial blossoming
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/283943635 Novel polynomial Bernstein bases and Bézier curves based on a general notion of polynomial
More informationPortable Assisted Study Sequence ALGEBRA IIB
SCOPE This course is divided into two semesters of study (A & B) comprised of five units each. Each unit teaches concepts and strategies recommended for intermediate algebra students. The second half of
More informationSIAM Conference on Applied Algebraic Geometry Daejeon, South Korea, Irina Kogan North Carolina State University. Supported in part by the
SIAM Conference on Applied Algebraic Geometry Daejeon, South Korea, 2015 Irina Kogan North Carolina State University Supported in part by the 1 Based on: 1. J. M. Burdis, I. A. Kogan and H. Hong Object-image
More informationEXPLICIT ERROR BOUND FOR QUADRATIC SPLINE APPROXIMATION OF CUBIC SPLINE
J. KSIAM Vol.13, No.4, 257 265, 2009 EXPLICIT ERROR BOUND FOR QUADRATIC SPLINE APPROXIMATION OF CUBIC SPLINE YEON SOO KIM 1 AND YOUNG JOON AHN 2 1 DEPT OF MATHEMATICS, AJOU UNIVERSITY, SUWON, 442 749,
More informationExercises Chapter II.
Page 64 Exercises Chapter II. 5. Let A = (1, 2) and B = ( 2, 6). Sketch vectors of the form X = c 1 A + c 2 B for various values of c 1 and c 2. Which vectors in R 2 can be written in this manner? B y
More informationRational Bézier Patch Differentiation using the. Rational Forward Difference Operator
Rational Bézier Patch Differentiation using the Rational Forward Difference Operator Xianming Chen Richard Riesenfeld Elaine Cohen School of Computing University of Utah CGI 05 p.1/37 Introduction For
More informationDUALITY AND INSCRIBED ELLIPSES
DUALITY AND INSCRIBED ELLIPSES MAHESH AGARWAL, JOHN CLIFFORD, AND MICHAEL LACHANCE Abstract. We give a constructive proof for the existence of inscribed family of ellipses in convex n-gons for 3 n 5 using
More informationInterpolation and Deformations A short cookbook
Interpolation and Deformations A short cookbook 600.445 Fall 2000; Updated: 29 September 205 Linear Interpolation p ρ 2 2 = [ 40 30 20] = 20 T p ρ = [ 0 5 20] = 5 p 3 = ρ3 =? 0?? T [ 20 20 20] T 2 600.445
More informationarxiv: v1 [cs.na] 8 Sep 2014
Degree reduction of disk rational Bézier curves Mao Shi a a College of Mathematics and Information Science of Shaanxi Normal University,Xi an 7162, China arxiv:149.2455v1 [cs.na] 8 Sep 214 Abstract This
More informationax 2 + bx + c = 0 where
Chapter P Prerequisites Section P.1 Real Numbers Real numbers The set of numbers formed by joining the set of rational numbers and the set of irrational numbers. Real number line A line used to graphically
More informationMatrix Methods for the Bernstein Form and Their Application in Global Optimization
Matrix Methods for the Bernstein Form and Their Application in Global Optimization June, 10 Jihad Titi Jürgen Garloff University of Konstanz Department of Mathematics and Statistics and University of Applied
More informationGEOMETRIC MODELLING WITH BETA-FUNCTION B-SPLINES, I: PARAMETRIC CURVES
International Journal of Pure and Applied Mathematics Volume 65 No. 3 2010, 339-360 GEOMETRIC MODELLING WITH BETA-FUNCTION B-SPLINES, I: PARAMETRIC CURVES Arne Lakså 1, Børre Bang 2, Lubomir T. Dechevsky
More informationQ( t) = T C T =! " t 3,t 2,t,1# Q( t) T = C T T T. Announcements. Bezier Curves and Splines. Review: Third Order Curves. Review: Cubic Examples
Bezier Curves an Splines December 1, 2015 Announcements PA4 ue one week from toay Submit your most fun test cases, too! Infinitely thin planes with parallel sies μ oesn t matter Term Paper ue one week
More informationNonlinear Means in Geometric Modeling
Nonlinear Means in Geometric Modeling Michael S. Floater SINTEF P. O. Box 124 Blindern, 0314 Oslo, Norway E-mail: Michael.Floater@math.sintef.no Charles A. Micchelli IBM Corporation T.J. Watson Research
More informationBARYCENTRIC COORDINATES
Computer Graphics Notes BARYCENTRIC COORDINATES Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview If we are given a frame
More informationOHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1
OHSx XM521 Multivariable Differential Calculus: Homework Solutions 13.1 (37) If a bug walks on the sphere x 2 + y 2 + z 2 + 2x 2y 4z 3 = 0 how close and how far can it get from the origin? Solution: Complete
More informationPath Planning based on Bézier Curve for Autonomous Ground Vehicles
Path Planning based on Bézier Curve for Autonomous Ground Vehicles Ji-wung Choi Computer Engineering Department University of California Santa Cruz Santa Cruz, CA95064, US jwchoi@soe.ucsc.edu Renwick Curry
More informationTetrahedral C m Interpolation by Rational Functions
Tetrahedral C m Interpolation by Rational Functions Guoliang Xu State Key Laboratory of Scientific and Engineering Computing, ICMSEC, Chinese Academy of Sciences Chuan I Chu Weimin Xue Department of Mathematics,
More informationChapter 12 Review Vector. MATH 126 (Section 9.5) Vector and Scalar The University of Kansas 1 / 30
Chapter 12 Review Vector MATH 126 (Section 9.5) Vector and Scalar The University of Kansas 1 / 30 iclicker 1: Let v = PQ where P = ( 2, 5) and Q = (1, 2). Which of the following vectors with the given
More informationCALC 3 CONCEPT PACKET Complete
CALC 3 CONCEPT PACKET Complete Written by Jeremy Robinson, Head Instructor Find Out More +Private Instruction +Review Sessions WWW.GRADEPEAK.COM Need Help? Online Private Instruction Anytime, Anywhere
More informationMATH Final Review
MATH 1592 - Final Review 1 Chapter 7 1.1 Main Topics 1. Integration techniques: Fitting integrands to basic rules on page 485. Integration by parts, Theorem 7.1 on page 488. Guidelines for trigonometric
More informationCharacterization of Planar Cubic Alternative curve. Perak, M sia. M sia. Penang, M sia.
Characterization of Planar Cubic Alternative curve. Azhar Ahmad α, R.Gobithasan γ, Jamaluddin Md.Ali β, α Dept. of Mathematics, Sultan Idris University of Education, 59 Tanjung Malim, Perak, M sia. γ Dept
More informationDepartment of Computer Sciences Graphics Fall 2005 (Lecture 8) Fractals
Fractals Consider a complex number z = a + bi as a point (a, b) or vector in the Real Euclidean plane [1, i] with modulus z the length of the vector and equal to a 2 + b 2. Complex arithmetic rules: (a
More informationMath 302 Outcome Statements Winter 2013
Math 302 Outcome Statements Winter 2013 1 Rectangular Space Coordinates; Vectors in the Three-Dimensional Space (a) Cartesian coordinates of a point (b) sphere (c) symmetry about a point, a line, and a
More informationA rational parametrization of Bezier like curves
A rational parametrization of Bezier like curves Mohamed ALLAOUI and Aurélien GOUDJO arxiv:1804.10406v1 [cs.cg] 27 Apr 2018 Résumé Une classe de paramétrisation rationnelle a été développée puis utilisée
More informationCheck boxes of Edited Copy of Sp Topics (was 261-pilot)
Check boxes of Edited Copy of 10023 Sp 11 253 Topics (was 261-pilot) Intermediate Algebra (2011), 3rd Ed. [open all close all] R-Review of Basic Algebraic Concepts Section R.2 Ordering integers Plotting
More informationSKILL BUILDER TEN. Graphs of Linear Equations with Two Variables. If x = 2 then y = = = 7 and (2, 7) is a solution.
SKILL BUILDER TEN Graphs of Linear Equations with Two Variables A first degree equation is called a linear equation, since its graph is a straight line. In a linear equation, each term is a constant or
More information10.1 Review of Parametric Equations
10.1 Review of Parametric Equations Recall that often, instead of representing a curve using just x and y (called a Cartesian equation), it is more convenient to define x and y using parametric equations
More informationApplications. More Counting Problems. Complexity of Algorithms
Recurrences Applications More Counting Problems Complexity of Algorithms Part I Recurrences and Binomial Coefficients Paths in a Triangle P(0, 0) P(1, 0) P(1,1) P(2, 0) P(2,1) P(2, 2) P(3, 0) P(3,1) P(3,
More information1. The positive zero of y = x 2 + 2x 3/5 is, to the nearest tenth, equal to
SAT II - Math Level Test #0 Solution SAT II - Math Level Test No. 1. The positive zero of y = x + x 3/5 is, to the nearest tenth, equal to (A) 0.8 (B) 0.7 + 1.1i (C) 0.7 (D) 0.3 (E). 3 b b 4ac Using Quadratic
More informationMyMathLab for School Precalculus Graphical, Numerical, Algebraic Common Core Edition 2016
A Correlation of MyMathLab for School Precalculus Common Core Edition 2016 to the Tennessee Mathematics Standards Approved July 30, 2010 Bid Category 13-090-10 , Standard 1 Mathematical Processes Course
More informationLaplace Transforms Chapter 3
Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important
More informationMCPS Algebra 2 and Precalculus Standards, Categories, and Indicators*
Content Standard 1.0 (HS) Patterns, Algebra and Functions Students will algebraically represent, model, analyze, and solve mathematical and real-world problems involving functional patterns and relationships.
More informationAFFINE COMBINATIONS, BARYCENTRIC COORDINATES, AND CONVEX COMBINATIONS
On-Line Geometric Modeling Notes AFFINE COMBINATIONS, BARYCENTRIC COORDINATES, AND CONVEX COMBINATIONS Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University
More informationMultidimensional Geometry and its Applications
PARALLEL COORDINATES : VISUAL Multidimensional Geometry and its Applications Alfred Inselberg( c 99, ) Senior Fellow San Diego SuperComputing Center, CA, USA Computer Science and Applied Mathematics Departments
More informationMa 227 Review for Systems of DEs
Ma 7 Review for Systems of DEs Matrices Basic Properties Addition and subtraction: Let A a ij mn and B b ij mn.then A B a ij b ij mn 3 A 6 B 6 4 7 6 A B 6 4 3 7 6 6 7 3 Scaler Multiplication: Let k be
More informationCheck boxes of Edited Copy of Sp Topics (was 217-pilot)
Check boxes of Edited Copy of 10024 Sp 11 213 Topics (was 217-pilot) College Algebra, 9th Ed. [open all close all] R-Basic Algebra Operations Section R.1 Integers and rational numbers Rational and irrational
More informationComputer Graphics Keyframing and Interpola8on
Computer Graphics Keyframing and Interpola8on This Lecture Keyframing and Interpola2on two topics you are already familiar with from your Blender modeling and anima2on of a robot arm Interpola2on linear
More informationDecomposition of Screw-motion Envelopes of Quadrics
Decomposition of Screw-motion Envelopes of Quadrics Šárka Voráčová * Department of Applied Mathematics Faculty of Transportation, CTU in Prague Study and realization of the construction of the envelope
More informationGeometric Lagrange Interpolation by Planar Cubic Pythagorean-hodograph Curves
Geometric Lagrange Interpolation by Planar Cubic Pythagorean-hodograph Curves Gašper Jaklič a,c, Jernej Kozak a,b, Marjeta Krajnc b, Vito Vitrih c, Emil Žagar a,b, a FMF, University of Ljubljana, Jadranska
More informationHigh-speed cornering by CNC machines under prescribed bounds on axis accelerations and toolpath contour error
High-speed cornering by CNC machines under prescribed bounds on axis accelerations and toolpath contour error Charlie A. Ernesto and Rida T. Farouki Department of Mechanical and Aerospace Engineering,
More informationHermite Interpolation with Euclidean Pythagorean Hodograph Curves
Hermite Interpolation with Euclidean Pythagorean Hodograph Curves Zbyněk Šír Faculty of Mathematics and Physics, Charles University in Prague Sokolovská 83, 86 75 Praha 8 zbynek.sir@mff.cuni.cz Abstract.
More informationOutline. 1 Interpolation. 2 Polynomial Interpolation. 3 Piecewise Polynomial Interpolation
Outline Interpolation 1 Interpolation 2 3 Michael T. Heath Scientific Computing 2 / 56 Interpolation Motivation Choosing Interpolant Existence and Uniqueness Basic interpolation problem: for given data
More information2 The De Casteljau algorithm revisited
A new geometric algorithm to generate spline curves Rui C. Rodrigues Departamento de Física e Matemática Instituto Superior de Engenharia 3030-199 Coimbra, Portugal ruicr@isec.pt F. Silva Leite Departamento
More informationG-code and PH curves in CNC Manufacturing
G-code and PH curves in CNC Manufacturing Zbyněk Šír Institute of Applied Geometry, JKU Linz The research was supported through grant P17387-N12 of the Austrian Science Fund (FWF). Talk overview Motivation
More informationSymplectic integration with Runge-Kutta methods, AARMS summer school 2015
Symplectic integration with Runge-Kutta methods, AARMS summer school 2015 Elena Celledoni July 13, 2015 1 Hamiltonian systems and their properties We consider a Hamiltonian system in the form ẏ = J H(y)
More informationMathematics Precalculus: Academic Unit 7: Conics
Understandings Questions Knowledge Vocabulary Skills Conics are models of real-life situations. Conics have many reflective properties that are used in every day situations Conics work can be simplified
More informationAP Calculus BC Syllabus
AP Calculus BC Syllabus Course Overview and Philosophy This course is designed to be the equivalent of a college-level course in single variable calculus. The primary textbook is Calculus, 7 th edition,
More informationCONTROL POLYGONS FOR CUBIC CURVES
On-Line Geometric Modeling Notes CONTROL POLYGONS FOR CUBIC CURVES Kenneth I. Joy Visualization and Graphics Research Group Department of Computer Science University of California, Davis Overview B-Spline
More information