A STUDY OF SOLVING LIMIT PROBLEMS BY USING MONOGENIC SURFACES. 1. Introduction

Size: px
Start display at page:

Download "A STUDY OF SOLVING LIMIT PROBLEMS BY USING MONOGENIC SURFACES. 1. Introduction"

Transcription

1 Analele Universităţii Oradea Fasc. Matematica, Tom XIV (2007), A STUDY OF SOLVING LIMIT PROBLEMS BY USING MONOGENIC SURFACES LIDIA ELENA KOZMA Abstract. In this paper, the possibility of solving limit problems by using monogenic surfaces is studied. The method opens new ways for approximate solving of limit problems. The approximation of the solution is analyzed by using the Bézier surfaces, and a theorem is formulated for the existence of approximate solution. The use of the Hermite surfaces is also remarked. 1. Introduction In my papers [1], [2], [3], I considered the bijective correspondence between the monogenic functions of the following form f(z) = f(x, y) = u(x, y) + iv(x, y), i 2 = 1, z D C, f C 2 (D) and the real surfaces of the form (1.1) (S) r = iy + ju(x, y) + kv(x, y), (1.2) where (i, j, k) are the Euclidian unit vectors and v(x, y) is the harmonic conjugate of function u(x, y), the same as in relation (1.1). Surface (1.2) was defined to be monogenic only if function (1.1) is monogenic. We state the properties of monogenic surface (S) : 2000 Mathematics Subject Classification. 32A38. Key words and phrases. Monogenic functions, Gauss curvature, Bézier surfaces, Hermite surfaces. 73

2 74 LIDIA ELENA KOZMA A. The total Gauss curvature of the monogenic surface is negative. B. The mean curvature of the monogenic surface is null (the surface (S) is minimal). The formulation of (Dirichlet) limit problem was given in [2] and [3] under the following form: Let a surface (S) be determined under the form (1.2), knowing that u = 0 in D, u C = R(x, y), where R(x, y) is a function given on the curve C, even (smooth) on portions. 2. The possibility of determining a monogenic surface by using Bézier surfaces Next, we analyze the possibility of determining surface (S) from (Dirichlet) limit problem, by using the Bézier surface. We state as in [4], a few information concerning Bézier surfaces: If the base B m, respectively B n, is the Bernstein polynomial base given by B m i (x) = C i m x i (1 x) m i, i = 0, m B n j (y) = C j n y j (1 y) n j, j = 0, n, (2.1) then the surface associated to a network of points b ij ; i = 0, m; j = 0, n will be s(x, y) = m n b ij Bi m (x)bj n (y), (x, y) [0, 1], (2.2) i=0 j=0 and it is called Bézier surface of grades (m, n) and the matrix of points (b ij ) is called control network of the Bézier surface. A surface polygonal on portions, meaning the reunion of all squares of tips b ii, b ij+1, b i+1j, b i+1j+1 ; i = 0, m 1; j = 0, n 1, called the control polyhedron of the Bézier surface, is associated to a Bézier surface.

3 A STUDY OF SOLVING LIMIT PROBLEMS 75 We justify the choice of Bézier surfaces for solving the formulated limit problem, because we know points (b ij ) in the Dirichlet problem (previously formulated). As we know the function u(x, y) on the curve C S, we can suppose that the points (b ij ) on the determined surface (S) are known. While determining the Bézier surfaces, the corner points of the control network interfere. While determining the surface (S) from the Dirichlet problem, the control points are placed continuously on the surface. In this situation it seems that we have a great variety of choices for points from the control network. We underline the followings: The abundance of points in the control network does not modify the form of the Bézier surface [4]. This observation concords with the identity principle which we extended [3] for monogenic surfaces. In [3] we proved the following result: If a monogenic surface r f (x, y) coincides with a surface r ϕ (x, y), on a line of points (x n, y n ) converging to point (x 0, y 0 ), then the two surfaces r f and r ϕ coincide in all the points of the domain where the function f(x, y) is monogenic. The conclusion of the above statements is that we can determine a Bézier surface with the network of points (b ij ), chosen from: a) knowing function u(x, y) on the frontier (C) of the domain D; b) determining function v(x, y), harmonic conjugate of function u(x, y), in each point (x, y) C (with approximation of an a- dditional constant). The vectors associated to a Bézier layer. The geometric characterization of the differentiable surface is done with the help of vectors r x, r y, r xy associated to each point of the surface. Let us take the particular case m = n = 3 (bi-cubic Bézier surface). The tangent vectors r x, r y in the network points b 00, b 0n, b m0, b mn n = m = 0, 1, 2, 3 will be:

4 76 LIDIA ELENA KOZMA r x (0, 0) = m(b 10 b 00 ) ; r x (1, 0) = m(b m0 b m 1,0 ) r x (0, 1) = m(b 1n b 0n ) ; r x (1, 1) = m(b mn b m 1,n ) r y (0, 0) = n(b 01 b 00 ) ; r y (0, 1) = n(b 0n b 0,n 1 ) r y (1, 0) = n(b m1 b m0 ) ; r y (1, 1) = n(b mn b m,n 1 ). (2.3) The vector r xy = 2 r, named in CAGD the twist vector, is of x y special interest 2 m 1 r x y = mn i=0 n j=0 11 b ij B m 1 i (x)b n 1 j (y), (2.4) where 11 b ij = b i+1 j+1 b i j+1 b i+1j b ij 2 r Example: When b 10 b 11 = b 00 b 01, the twist vector x y = 0. From the point of view of the monogenic surface (1.2), the solution to the above formulated Dirichlet problem, has the total Gauss curvature negative (condition A) and it is constant for a given movement model. The expression of the total curvature in [1] is: 2 2 f x y K = [ 1 + f 2 2 z ] f. (2.5) z Thus, result two conditions: Condition I, which is required from the Bézier surfaces as solution of the Dirichlet problem: choosing the points of the control network in such a way that K = constant, and 2 f x y = 2 r x y 0 in any point of the surface. Condition II, which we impose on the Bézier surface and is given by condition (B) of the monogenic surface. From the general theory of Bézier surfaces we know that a Bézier surface is the convex hull of its control points. We can choose the minimal

5 A STUDY OF SOLVING LIMIT PROBLEMS 77 surface, from all the Bézier surfaces with certain points of control (which also satisfy condition I) if this thing is possible. Analytically, condition (B) is equivalent to the Cauchy-Riemann conditions. It results that the points of the network will have to fulfill the condition r x r y = 0, or the vectors given by relation (2.3) should be perpendicular in every (b ij ) point of the chosen network. From the previously analyzed date, we express the following boundary problem: ( ) Let us determine a surface (S) of the shape: (S) r = iy + ju(x, y) + kv(x, y) with functions u(x, y); v(x, y) C 2 (D), D R 2, v(x, y) harmonically conjugated with function u(x, y) if we know: { u = 0 in D u P = R(x, y) where R(x, y) is a function given by the network of points P = {b ii, b ij+1, b i+1j, b i+1j+1 } ; i = 0, m; j = 0, n called control polyhedron. The above problem allows an approximate solution (Bézier surface) given by the following theorem: Theorem 2.1. Any solution of the boundary problem ( ) allows a Bézier surface (which follows the shape ) as approximate solution, if the following conditions are met: (i) 11 b ij = b i+1j+1 b ij+1 b i+1j b ij 0; i = 0, m; j = 0, n. (ii) r x r y = 0 for any vectors calculated in points b ij (Relation 2.3) The Bézier surface is of (m, n) level and has the form (2.2) Proof. Indeed, from condition (i) 11 b ij 0, there results the fact that the Bézier surface has the Gauss curvature: K < 0 (condition A).

6 78 LIDIA ELENA KOZMA Relation (ii) r x r y = 0 is equivalent both with the Cauchy-Riemann conditions for functions u(x, y) and v(x, y), but by [1], with condition (B) met by a monogenic surface. The quality of approximation. The Bézier surface thus obtained approximates the surface of the problem ( ) solution. We have in mind two aspects: (1) The quality of the approximation depends on the number of points considered in network (P ) (the control polyhedron). If the network (P ) of points make up a line of points convergent towards a point in the network, then according to the Identity Principle for monogenous surfaces in [3] (re-expressed in this paper), the determined Bézier surface coincides with the solution of the expressed boundary problem. (2) The determination of surface (S) depends both on function u(x, y) and on function v(x, y), the harmonic conjugate of u(x, y). It is known the function u(x, y) on the points b ij (the corner points), and thus we can determine v(x, y) with an approximation of an additive constant. For this reason, instead of the approximation of surface (S 1 ) (S 1 ) r = iy + ju + kv, we can obtain the approximation of surface (S 2 ): (S 2 ) r = iy + ju + k(v + c) where c = constant Surfaces (S 1 ) and (S 2 ) both meet the conditions in the existence theorem expressed above, even these do not coincide. From this point of view we consider the method as approximate. We can also notice the fact that the Bézier surface has an explicit equation z = F (x, y), and the surface required by problem ( ) has a vectorial form (1.2).

7 A STUDY OF SOLVING LIMIT PROBLEMS 79 In what follows, we intend to analyze the solution of the boundary problem ( ) for the determination of surface (S), by using Hermite surfaces. 3. Hermite surfaces and limit problems formulated with the help of monogenic surfaces We analyze the case of bi-cubic Hermite surface. Let us take (S) = ims, a bi-cubic parametric surface by 3 3 s(x, y) = a ij x i y j, (x, y) [0, 1] (3.1) i=0 j=0 Expressing the polynomial functions in Hermite base, leads us to a matrix (h ij ), which geometrically characterizes the surface, s(0, 0) s(0, 1) s y (0, 0) s y (0, 1) s(1, 0) s(1, 1) s y (1, 0) s y (1, 1) s x (0, 0) s x (0, 1) s xy (0, 0) s xy (0, 1) s x (1, 0) s x (1, 1) s xy (1, 0) s xy (1, 1) [ = B 00 B 01 B 10 B 11 ] (3.2) B 00 is a block of points from the surface, and the others are blocks of derivatives r x, r y, 2 r in the chosen corner points (tips) of the surface. x y Using conditions I and II, we will be able to determine the Hermite surface attached to the Dirichlet problem, H s(x, y) = [ H0(x) 3 H1(x) 3 H2(x) 3 H3(x) ] 0(y) 3 3 h ij H1(y) 3 H2(y) 3 (3.3) H3(y) 3 with (h ij ) the matrix h from relation (3.2). In applications to the Dirichlet type limit problems, the matrix (h ij ) will have to be calculated by using conditions I and II. In the applications

8 80 LIDIA ELENA KOZMA which use these models, the condition s xy 0 has to be imposed, unlike in the general model of approach in the CAGD (Computer Aided Geometric Design) graphics. This model is applicable only under the condition of knowing supplementary geometrical data referring to the solution surface (relation 3.2). For this reason, we recommend the use of the Bézier surfaces which only ask for the points on the surface to be known. We note that the Bézier surface does not pass through the b ij network of the given points, it only gets very close to them. Conclusion. The approximation of a surface of form (1.2) by means of a Bézier surface of the form (2.2) will provide an image graphically close to surface (1.2), although the means of transformation of surface (2.2) into (1.2) was not decided upon analytically. The model introduced in this paper may open new ways of graphic visualization of certain approximate solutions for the boundary problems. References [1] L.E. Kozma, A possible visual image of the extended monogeneous function, Bute and PAMM, Balaton Almady, May 2003, pg , Proceeding of PAMM conference). [2] L.E. Kozma, About the Dirichlet and Neumann boundary value problems expressed by means of monogenous quaternions, Carpathian Journal of Mathematics vol. 20 No. 2, 2004, pg [3] L.E. Kozma, About the use of monogeneous surfaces in solving Plaine Boundary Problems, in Proceedings of International Conference on Complex Analysis and Related Topics, Cluj-Napoca, august, 14-19, [4] Emilia Petrişor, Modelare Geometrică Algoritmică, colecţia Universitaria, Editura Tehnică, Bucureşti Received 8 November 2006 North University of Baia Mare, Department of Mathematics and Computer Science, Victoriei 76, Baia Mare, Romania address: kozma lidia@yahoo.com

Sung-Eui Yoon ( 윤성의 )

Sung-Eui Yoon ( 윤성의 ) CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and

More information

The Essentials of CAGD

The Essentials of CAGD The Essentials of CAGD Chapter 6: Bézier Patches Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/essentials-cagd c 2 Farin & Hansford The

More information

Math 814 HW 2. September 29, p. 43: 1,4,6,13,15, p. 54 1, 3 (cos z only). u(x, y) = x 3 3xy 2, u(x, y) = x/(x 2 + y 2 ),

Math 814 HW 2. September 29, p. 43: 1,4,6,13,15, p. 54 1, 3 (cos z only). u(x, y) = x 3 3xy 2, u(x, y) = x/(x 2 + y 2 ), Math 814 HW 2 September 29, 2007 p. 43: 1,4,6,13,15, p. 54 1, 3 (cos z only). u(x, y) = x 3 3xy 2, u(x, y) = x/(x 2 + y 2 ), p.43, Exercise 1. Show that the function f(z) = z 2 = x 2 + y 2 has a derivative

More information

Know it. Control points. B Spline surfaces. Implicit surfaces

Know it. Control points. B Spline surfaces. Implicit surfaces Know it 15 B Spline Cur 14 13 12 11 Parametric curves Catmull clark subdivision Parametric surfaces Interpolating curves 10 9 8 7 6 5 4 3 2 Control points B Spline surfaces Implicit surfaces Bezier surfaces

More information

Curves and Surfaces 1

Curves and Surfaces 1 Curves and Surfaces 1 Representation of Curves & Surfaces Polygon Meshes Parametric Cubic Curves Parametric Bi-Cubic Surfaces Quadric Surfaces Specialized Modeling Techniques 2 The Teapot 3 Representing

More information

Remark. Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 331

Remark. Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 331 Remark Reconsidering the motivating example, we observe that the derivatives are typically not given by the problem specification. However, they can be estimated in a pre-processing step. A good estimate

More information

Computer Graphics Curves and Surfaces. Matthias Teschner

Computer Graphics Curves and Surfaces. Matthias Teschner Computer Graphics Curves and Surfaces Matthias Teschner Outline Introduction Polynomial curves Bézier curves Matrix notation Curve subdivision Differential curve properties Piecewise polynomial curves

More information

Surface Parameterization

Surface Parameterization Surface Parameterization A Tutorial and Survey Michael Floater and Kai Hormann Presented by Afra Zomorodian CS 468 10/19/5 1 Problem 1-1 mapping from domain to surface Original application: Texture mapping

More information

Rational Bezier Curves

Rational Bezier Curves Rational Bezier Curves Use of homogeneous coordinates Rational spline curve: define a curve in one higher dimension space, project it down on the homogenizing variable Mathematical formulation: n P(u)

More information

Curves and Surfaces Computer Graphics I Lecture 9

Curves and Surfaces Computer Graphics I Lecture 9 15-462 Computer Graphics I Lecture 9 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] February 19, 2002 Frank Pfenning Carnegie

More information

Almost Curvature Continuous Fitting of B-Spline Surfaces

Almost Curvature Continuous Fitting of B-Spline Surfaces Journal for Geometry and Graphics Volume 2 (1998), No. 1, 33 43 Almost Curvature Continuous Fitting of B-Spline Surfaces Márta Szilvási-Nagy Department of Geometry, Mathematical Institute, Technical University

More information

A MATRIX FORMULATION OF THE CUBIC BÉZIER CURVE

A MATRIX FORMULATION OF THE CUBIC BÉZIER CURVE Geometric Modeling Notes A MATRIX FORMULATION OF THE CUBIC BÉZIER CURVE Kenneth I. Joy Institute for Data Analysis and Visualization Department of Computer Science University of California, Davis Overview

More information

Curves and Surfaces Computer Graphics I Lecture 10

Curves and Surfaces Computer Graphics I Lecture 10 15-462 Computer Graphics I Lecture 10 Curves and Surfaces Parametric Representations Cubic Polynomial Forms Hermite Curves Bezier Curves and Surfaces [Angel 10.1-10.6] September 30, 2003 Doug James Carnegie

More information

Parametric curves. Brian Curless CSE 457 Spring 2016

Parametric curves. Brian Curless CSE 457 Spring 2016 Parametric curves Brian Curless CSE 457 Spring 2016 1 Reading Required: Angel 10.1-10.3, 10.5.2, 10.6-10.7, 10.9 Optional Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics

More information

Curve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur

Curve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur Curve Representation ME761A Instructor in Charge Prof. J. Ramkumar Department of Mechanical Engineering, IIT Kanpur Email: jrkumar@iitk.ac.in Curve representation 1. Wireframe models There are three types

More information

Introduction to Computer Graphics

Introduction to Computer Graphics Introduction to Computer Graphics 2016 Spring National Cheng Kung University Instructors: Min-Chun Hu 胡敏君 Shih-Chin Weng 翁士欽 ( 西基電腦動畫 ) Data Representation Curves and Surfaces Limitations of Polygons Inherently

More information

On an approach for cubic Bézier interpolation

On an approach for cubic Bézier interpolation Second International Conference Modelling and Development of Intelligent Systems Sibiu - Romania, September 29 - October 02, 2011 On an approach for cubic Bézier interpolation Dana Simian, Corina Simian

More information

Need for Parametric Equations

Need for Parametric Equations Curves and Surfaces Curves and Surfaces Need for Parametric Equations Affine Combinations Bernstein Polynomials Bezier Curves and Surfaces Continuity when joining curves B Spline Curves and Surfaces Need

More information

CS3621 Midterm Solution (Fall 2005) 150 points

CS3621 Midterm Solution (Fall 2005) 150 points CS362 Midterm Solution Fall 25. Geometric Transformation CS362 Midterm Solution (Fall 25) 5 points (a) [5 points] Find the 2D transformation matrix for the reflection about the y-axis transformation (i.e.,

More information

Information Coding / Computer Graphics, ISY, LiTH. Splines

Information Coding / Computer Graphics, ISY, LiTH. Splines 28(69) Splines Originally a drafting tool to create a smooth curve In computer graphics: a curve built from sections, each described by a 2nd or 3rd degree polynomial. Very common in non-real-time graphics,

More information

ASSIGNMENT 1 INTRODUCTION TO CAD

ASSIGNMENT 1 INTRODUCTION TO CAD Computer Aided Design(2161903) ASSIGNMENT 1 INTRODUCTION TO CAD Theory 1. Discuss the reasons for implementing a CAD system. 2. Define computer aided design. Compare computer aided design and conventional

More information

Design considerations

Design considerations Curves Design considerations local control of shape design each segment independently smoothness and continuity ability to evaluate derivatives stability small change in input leads to small change in

More information

PARALLEL METHODS FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS. Ioana Chiorean

PARALLEL METHODS FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS. Ioana Chiorean 5 Kragujevac J. Math. 25 (2003) 5 18. PARALLEL METHODS FOR SOLVING PARTIAL DIFFERENTIAL EQUATIONS Ioana Chiorean Babeş-Bolyai University, Department of Mathematics, Cluj-Napoca, Romania (Received May 28,

More information

Review of Tuesday. ECS 175 Chapter 3: Object Representation

Review of Tuesday. ECS 175 Chapter 3: Object Representation Review of Tuesday We have learnt how to rasterize lines and fill polygons Colors (and other attributes) are specified at vertices Interpolation required to fill polygon with attributes 26 Review of Tuesday

More information

Digital Geometry Processing Parameterization I

Digital Geometry Processing Parameterization I Problem Definition Given a surface (mesh) S in R 3 and a domain find a bective F: S Typical Domains Cutting to a Disk disk = genus zero + boundary sphere = closed genus zero Creates artificial boundary

More information

Gauss curvature. curvature lines, needle plot. vertices of progenitor solid are unit size. Construction Principle. edge. edge. vertex. Patch.

Gauss curvature. curvature lines, needle plot. vertices of progenitor solid are unit size. Construction Principle. edge. edge. vertex. Patch. The Platonic Spheroids Jorg Peters and Leif Kobbelt Abstract. We present a gallery of simple curvature continuous surfaces that possess the topological structure of the Platonic solids. These spherelike

More information

Interactive Graphics Using Parametric Equations (Day 2)

Interactive Graphics Using Parametric Equations (Day 2) Interactive Graphics Using Parametric Equations (Day 2) Dr. Niels Lobo Computer Science Bezier Curves Google bezier curves`` Casselman's Bezier curves Andysspline Bezier Curves Bezier Photo: Automotive

More information

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10

Lecture 25: Bezier Subdivision. And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 Lecture 25: Bezier Subdivision And he took unto him all these, and divided them in the midst, and laid each piece one against another: Genesis 15:10 1. Divide and Conquer If we are going to build useful

More information

Linear Precision for Parametric Patches

Linear Precision for Parametric Patches Department of Mathematics Texas A&M University March 30, 2007 / Texas A&M University Algebraic Geometry and Geometric modeling Geometric modeling uses polynomials to build computer models for industrial

More information

Curves and Surfaces. Shireen Elhabian and Aly A. Farag University of Louisville

Curves and Surfaces. Shireen Elhabian and Aly A. Farag University of Louisville Curves and Surfaces Shireen Elhabian and Aly A. Farag University of Louisville February 21 A smile is a curve that sets everything straight Phyllis Diller (American comedienne and actress, born 1917) Outline

More information

Gardener s spline curve

Gardener s spline curve Annales Mathematicae et Informaticae 47 (017) pp. 109 118 http://ami.uni-eszterhazy.hu Gardener s spline curve Imre Juhász Department of Descriptive Geometry University of Miskolc agtji@uni-miskolc.hu

More information

BS-Patch: Constrained Bezier Parametric Patch

BS-Patch: Constrained Bezier Parametric Patch BS-Patch: Constrained Bezier Parametric Patch VACLAV SKALA, VIT ONDRACKA Department of Computer Science and Engineering University of West Bohemia Univerzitni 8, CZ 06 14 Plzen CZECH REPUBLIC skala@kiv.zcu.cz

More information

Isoparametric Curve of Quadratic F-Bézier Curve

Isoparametric Curve of Quadratic F-Bézier Curve J. of the Chosun Natural Science Vol. 6, No. 1 (2013) pp. 46 52 Isoparametric Curve of Quadratic F-Bézier Curve Hae Yeon Park 1 and Young Joon Ahn 2, Abstract In this thesis, we consider isoparametric

More information

COMPUTER AIDED ENGINEERING DESIGN (BFF2612)

COMPUTER AIDED ENGINEERING DESIGN (BFF2612) COMPUTER AIDED ENGINEERING DESIGN (BFF2612) BASIC MATHEMATICAL CONCEPTS IN CAED by Dr. Mohd Nizar Mhd Razali Faculty of Manufacturing Engineering mnizar@ump.edu.my COORDINATE SYSTEM y+ y+ z+ z+ x+ RIGHT

More information

Central issues in modelling

Central issues in modelling Central issues in modelling Construct families of curves, surfaces and volumes that can represent common objects usefully; are easy to interact with; interaction includes: manual modelling; fitting to

More information

Curves and Surfaces. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd

Curves and Surfaces. Computer Graphics COMP 770 (236) Spring Instructor: Brandon Lloyd Curves and Surfaces Computer Graphics COMP 770 (236) Spring 2007 Instructor: Brandon Lloyd 4/11/2007 Final projects Surface representations Smooth curves Subdivision Todays Topics 2 Final Project Requirements

More information

Fall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li.

Fall CSCI 420: Computer Graphics. 4.2 Splines. Hao Li. Fall 2014 CSCI 420: Computer Graphics 4.2 Splines Hao Li http://cs420.hao-li.com 1 Roller coaster Next programming assignment involves creating a 3D roller coaster animation We must model the 3D curve

More information

= f (a, b) + (hf x + kf y ) (a,b) +

= f (a, b) + (hf x + kf y ) (a,b) + Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals

More information

Parametric curves. Reading. Curves before computers. Mathematical curve representation. CSE 457 Winter Required:

Parametric curves. Reading. Curves before computers. Mathematical curve representation. CSE 457 Winter Required: Reading Required: Angel 10.1-10.3, 10.5.2, 10.6-10.7, 10.9 Parametric curves CSE 457 Winter 2014 Optional Bartels, Beatty, and Barsky. An Introduction to Splines for use in Computer Graphics and Geometric

More information

ECE 600, Dr. Farag, Summer 09

ECE 600, Dr. Farag, Summer 09 ECE 6 Summer29 Course Supplements. Lecture 4 Curves and Surfaces Aly A. Farag University of Louisville Acknowledgements: Help with these slides were provided by Shireen Elhabian A smile is a curve that

More information

Interactive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1

Interactive Graphics. Lecture 9: Introduction to Spline Curves. Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 9: Introduction to Spline Curves Interactive Graphics Lecture 9: Slide 1 Interactive Graphics Lecture 13: Slide 2 Splines The word spline comes from the ship building trade

More information

Splines. Parameterization of a Curve. Curve Representations. Roller coaster. What Do We Need From Curves in Computer Graphics? Modeling Complex Shapes

Splines. Parameterization of a Curve. Curve Representations. Roller coaster. What Do We Need From Curves in Computer Graphics? Modeling Complex Shapes CSCI 420 Computer Graphics Lecture 8 Splines Jernej Barbic University of Southern California Hermite Splines Bezier Splines Catmull-Rom Splines Other Cubic Splines [Angel Ch 12.4-12.12] Roller coaster

More information

08 - Designing Approximating Curves

08 - Designing Approximating Curves 08 - Designing Approximating Curves Acknowledgement: Olga Sorkine-Hornung, Alexander Sorkine-Hornung, Ilya Baran Last time Interpolating curves Monomials Lagrange Hermite Different control types Polynomials

More information

CS-184: Computer Graphics. Today

CS-184: Computer Graphics. Today CS-84: Computer Graphics Lecture #5: Curves and Surfaces Prof. James O Brien University of California, Berkeley V25F-5-. Today General curve and surface representations Splines and other polynomial bases

More information

The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a

The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a The goal is the definition of points with numbers and primitives with equations or functions. The definition of points with numbers requires a coordinate system and then the measuring of the point with

More information

Note. f 2 (-z. = f 1 (-z) f 1 () z f 2 () z = -f 1 (-z ) - f 2 (-z) = - f 1 (-z ) f 2 (-z. 7 Completed Riemann Zeta. 7.1 Even Function & Odd Function

Note. f 2 (-z. = f 1 (-z) f 1 () z f 2 () z = -f 1 (-z ) - f 2 (-z) = - f 1 (-z ) f 2 (-z. 7 Completed Riemann Zeta. 7.1 Even Function & Odd Function 7 Completed Riemann Zeta 7. Even Function & Odd Function Definition 7..0 Let f() be a function in the domain D. () When f() = f( -), f() is an even function. () When f() = -f(- ), f() is an odd function.

More information

Exact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( )

Exact discrete Morse functions on surfaces. To the memory of Professor Mircea-Eugen Craioveanu ( ) Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 469 476 Exact discrete Morse functions on surfaces Vasile Revnic To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. In this paper,

More information

3D Modeling Parametric Curves & Surfaces

3D Modeling Parametric Curves & Surfaces 3D Modeling Parametric Curves & Surfaces Shandong University Spring 2012 3D Object Representations Raw data Point cloud Range image Polygon soup Solids Voxels BSP tree CSG Sweep Surfaces Mesh Subdivision

More information

Free-Form Deformation (FFD)

Free-Form Deformation (FFD) Chapter 14 Free-Form Deformation (FFD) Free-form deformation (FFD) is a technique for manipulating any shape in a free-form manner. Pierre Bézier used this idea to manipulate large numbers of control points

More information

Pythagorean - Hodograph Curves: Algebra and Geometry Inseparable

Pythagorean - Hodograph Curves: Algebra and Geometry Inseparable Rida T. Farouki Pythagorean - Hodograph Curves: Algebra and Geometry Inseparable With 204 Figures and 15 Tables 4y Springer Contents 1 Introduction 1 1.1 The Lure of Analytic Geometry 1 1.2 Symbiosis of

More information

Curve and Surface Basics

Curve and Surface Basics Curve and Surface Basics Implicit and parametric forms Power basis form Bezier curves Rational Bezier Curves Tensor Product Surfaces ME525x NURBS Curve and Surface Modeling Page 1 Implicit and Parametric

More information

A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings

A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings Scientific Papers, University of Latvia, 2010. Vol. 756 Computer Science and Information Technologies 207 220 P. A Modified Spline Interpolation Method for Function Reconstruction from Its Zero-Crossings

More information

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces.

In what follows, we will focus on Voronoi diagrams in Euclidean space. Later, we will generalize to other distance spaces. Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery

More information

Math 213 Calculus III Practice Exam 2 Solutions Fall 2002

Math 213 Calculus III Practice Exam 2 Solutions Fall 2002 Math 13 Calculus III Practice Exam Solutions Fall 00 1. Let g(x, y, z) = e (x+y) + z (x + y). (a) What is the instantaneous rate of change of g at the point (,, 1) in the direction of the origin? We want

More information

SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS

SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS SUBDIVISION ALGORITHMS FOR MOTION DESIGN BASED ON HOMOLOGOUS POINTS M. Hofer and H. Pottmann Institute of Geometry Vienna University of Technology, Vienna, Austria hofer@geometrie.tuwien.ac.at, pottmann@geometrie.tuwien.ac.at

More information

09 - Designing Surfaces. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo

09 - Designing Surfaces. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo 9 - Designing Surfaces Triangular surfaces A surface can be discretized by a collection of points and triangles Each triangle is a subset of a plane Every point on the surface can be expressed as an affine

More information

Spline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1

Spline Curves. Spline Curves. Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1 Spline Curves Prof. Dr. Hans Hagen Algorithmic Geometry WS 2013/2014 1 Problem: In the previous chapter, we have seen that interpolating polynomials, especially those of high degree, tend to produce strong

More information

The Free-form Surface Modelling System

The Free-form Surface Modelling System 1. Introduction The Free-form Surface Modelling System Smooth curves and surfaces must be generated in many computer graphics applications. Many real-world objects are inherently smooth (fig.1), and much

More information

Lectures 19: The Gauss-Bonnet Theorem I. Table of contents

Lectures 19: The Gauss-Bonnet Theorem I. Table of contents Math 348 Fall 07 Lectures 9: The Gauss-Bonnet Theorem I Disclaimer. As we have a textbook, this lecture note is for guidance and supplement only. It should not be relied on when preparing for exams. In

More information

Name: Let the Catmull-Rom curve q(u) be defined by the following control points: p 1 = 0, 1 p 2 = 1, 1 p 3 = 1, 0. p 2. p 1.

Name: Let the Catmull-Rom curve q(u) be defined by the following control points: p 1 = 0, 1 p 2 = 1, 1 p 3 = 1, 0. p 2. p 1. Name: 2 1. Let the Catmull-Rom curve q(u) be defined by the following control points: p 0 = 0, 0 p 1 = 0, 1 p 2 = 1, 1 p 3 = 1, 0 p 4 = 2, 0 y p 1 p 2 p 0 p 3 p 4 x Thus, q(i) =p i for i =1, 2, 3. For

More information

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013

3D Modeling Parametric Curves & Surfaces. Shandong University Spring 2013 3D Modeling Parametric Curves & Surfaces Shandong University Spring 2013 3D Object Representations Raw data Point cloud Range image Polygon soup Surfaces Mesh Subdivision Parametric Implicit Solids Voxels

More information

Quasilinear First-Order PDEs

Quasilinear First-Order PDEs MODULE 2: FIRST-ORDER PARTIAL DIFFERENTIAL EQUATIONS 16 Lecture 3 Quasilinear First-Order PDEs A first order quasilinear PDE is of the form a(x, y, z) + b(x, y, z) x y = c(x, y, z). (1) Such equations

More information

An introduction to interpolation and splines

An introduction to interpolation and splines An introduction to interpolation and splines Kenneth H. Carpenter, EECE KSU November 22, 1999 revised November 20, 2001, April 24, 2002, April 14, 2004 1 Introduction Suppose one wishes to draw a curve

More information

A new 8-node quadrilateral spline finite element

A new 8-node quadrilateral spline finite element Journal of Computational and Applied Mathematics 195 (2006) 54 65 www.elsevier.com/locate/cam A new 8-node quadrilateral spline finite element Chong-Jun Li, Ren-Hong Wang Institute of Mathematical Sciences,

More information

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs

Advanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material

More information

CS-184: Computer Graphics

CS-184: Computer Graphics CS-184: Computer Graphics Lecture #12: Curves and Surfaces Prof. James O Brien University of California, Berkeley V2007-F-12-1.0 Today General curve and surface representations Splines and other polynomial

More information

Quasi-Quartic Trigonometric Bézier Curves and Surfaces with Shape Parameters

Quasi-Quartic Trigonometric Bézier Curves and Surfaces with Shape Parameters Quasi-Quartic Trigonometric Bézier Curves and Surfaces with Shape Parameters Reenu Sharma Assistant Professor, Department of Mathematics, Mata Gujri Mahila Mahavidyalaya, Jabalpur, Madhya Pradesh, India

More information

Shape Control of Cubic H-Bézier Curve by Moving Control Point

Shape Control of Cubic H-Bézier Curve by Moving Control Point Journal of Information & Computational Science 4: 2 (2007) 871 878 Available at http://www.joics.com Shape Control of Cubic H-Bézier Curve by Moving Control Point Hongyan Zhao a,b, Guojin Wang a,b, a Department

More information

2D Spline Curves. CS 4620 Lecture 13

2D Spline Curves. CS 4620 Lecture 13 2D Spline Curves CS 4620 Lecture 13 2008 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes [Boeing] that is, without discontinuities So far we can make things with corners

More information

Surfaces for CAGD. FSP Tutorial. FSP-Seminar, Graz, November

Surfaces for CAGD. FSP Tutorial. FSP-Seminar, Graz, November Surfaces for CAGD FSP Tutorial FSP-Seminar, Graz, November 2005 1 Tensor Product Surfaces Given: two curve schemes (Bézier curves or B splines): I: x(u) = m i=0 F i(u)b i, u [a, b], II: x(v) = n j=0 G

More information

Intro to Modeling Modeling in 3D

Intro to Modeling Modeling in 3D Intro to Modeling Modeling in 3D Polygon sets can approximate more complex shapes as discretized surfaces 2 1 2 3 Curve surfaces in 3D Sphere, ellipsoids, etc Curved Surfaces Modeling in 3D ) ( 2 2 2 2

More information

CAGD PACKAGE FOR MATHEMATICA AND ITS USAGE IN THE TEACHING

CAGD PACKAGE FOR MATHEMATICA AND ITS USAGE IN THE TEACHING 5. KONFERENCE O GEOMETRII A POČÍTAČOVÉ GRAFICE Bohumír Bastl CAGD PACKAGE FOR MATHEMATICA AND ITS USAGE IN THE TEACHING Abstract This talk presents a new package for Wolfram s Mathematica which provides

More information

Curves D.A. Forsyth, with slides from John Hart

Curves D.A. Forsyth, with slides from John Hart Curves D.A. Forsyth, with slides from John Hart Central issues in modelling Construct families of curves, surfaces and volumes that can represent common objects usefully; are easy to interact with; interaction

More information

A New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces

A New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces A New Class of Quasi-Cubic Trigonometric Bezier Curve and Surfaces Mridula Dube 1, Urvashi Mishra 2 1 Department of Mathematics and Computer Science, R.D. University, Jabalpur, Madhya Pradesh, India 2

More information

E-learning solutions in curve and surface design Corina DanaSimian

E-learning solutions in curve and surface design Corina DanaSimian First International Conference Modelling and Development of Intelligent Systems Sibiu - Romania, 22-25 October, 2009 Wasp based algorithms and applications Corina DanaSimian Abstract aim aim of this of

More information

2. Write the point-slope form of the equation of the line passing through the point ( 2, 4) with a slope of 3. (1 point)

2. Write the point-slope form of the equation of the line passing through the point ( 2, 4) with a slope of 3. (1 point) Parallel and Perpendicular Lines Unit Test David Strong is taking this assessment. Multiple Choice 1. Which construction is illustrated above? a segment congruent to a given segment an angle congruent

More information

G 2 Interpolation for Polar Surfaces

G 2 Interpolation for Polar Surfaces 1 G 2 Interpolation for Polar Surfaces Jianzhong Wang 1, Fuhua Cheng 2,3 1 University of Kentucky, jwangf@uky.edu 2 University of Kentucky, cheng@cs.uky.edu 3 National Tsinhua University ABSTRACT In this

More information

PS Geometric Modeling Homework Assignment Sheet I (Due 20-Oct-2017)

PS Geometric Modeling Homework Assignment Sheet I (Due 20-Oct-2017) Homework Assignment Sheet I (Due 20-Oct-2017) Assignment 1 Let n N and A be a finite set of cardinality n = A. By definition, a permutation of A is a bijective function from A to A. Prove that there exist

More information

Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry

Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry Introduction p. 1 What Is Geometric Modeling? p. 1 Computer-aided geometric design Solid modeling Algebraic geometry Computational geometry Representation Ab initio design Rendering Solid modelers Kinematic

More information

CHAPTER 6 Parametric Spline Curves

CHAPTER 6 Parametric Spline Curves CHAPTER 6 Parametric Spline Curves When we introduced splines in Chapter 1 we focused on spline curves, or more precisely, vector valued spline functions. In Chapters 2 and 4 we then established the basic

More information

MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS

MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 OVERVIEW OF CONTENTS AND SAMPLE PROBLEMS MAT203 covers essentially the same material as MAT201, but is more in depth and theoretical. Exam problems are often more sophisticated in scope and difficulty

More information

Until now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple

Until now we have worked with flat entities such as lines and flat polygons. Fit well with graphics hardware Mathematically simple Curves and surfaces Escaping Flatland Until now we have worked with flat entities such as lines and flat polygons Fit well with graphics hardware Mathematically simple But the world is not composed of

More information

Positivity Preserving Interpolation of Positive Data by Rational Quadratic Trigonometric Spline

Positivity Preserving Interpolation of Positive Data by Rational Quadratic Trigonometric Spline IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn:2319-765x. Volume 10, Issue 2 Ver. IV (Mar-Apr. 2014), PP 42-47 Positivity Preserving Interpolation of Positive Data by Rational Quadratic

More information

Mathematically, the path or the trajectory of a particle moving in space in described by a function of time.

Mathematically, the path or the trajectory of a particle moving in space in described by a function of time. Module 15 : Vector fields, Gradient, Divergence and Curl Lecture 45 : Curves in space [Section 45.1] Objectives In this section you will learn the following : Concept of curve in space. Parametrization

More information

MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces

MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces MA 323 Geometric Modelling Course Notes: Day 28 Data Fitting to Surfaces David L. Finn Today, we want to exam interpolation and data fitting problems for surface patches. Our general method is the same,

More information

Properties of Blending Functions

Properties of Blending Functions Chapter 5 Properties of Blending Functions We have just studied how the Bernstein polynomials serve very nicely as blending functions. We have noted that a degree n Bézier curve always begins at P 0 and

More information

CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside

CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside CS130 : Computer Graphics Curves (cont.) Tamar Shinar Computer Science & Engineering UC Riverside Blending Functions Blending functions are more convenient basis than monomial basis canonical form (monomial

More information

High Frequency Wave Scattering

High Frequency Wave Scattering High Frequency Wave Scattering University of Reading March 21st, 2006 - Scattering theory What is the effect of obstacles or inhomogeneities on an incident wave? - Scattering theory What is the effect

More information

February 23 Math 2335 sec 51 Spring 2016

February 23 Math 2335 sec 51 Spring 2016 February 23 Math 2335 sec 51 Spring 2016 Section 4.1: Polynomial Interpolation Interpolation is the process of finding a curve or evaluating a function whose curve passes through a known set of points.

More information

16.7 Surface Integrals

16.7 Surface Integrals 16 Vector Calculus 16.7 Surface Integrals Copyright Cengage Learning. All rights reserved. 1 Copyright Cengage Learning. All rights reserved. Surface Integrals The relationship between surface integrals

More information

OUTLINE. Quadratic Bezier Curves Cubic Bezier Curves

OUTLINE. Quadratic Bezier Curves Cubic Bezier Curves BEZIER CURVES 1 OUTLINE Introduce types of curves and surfaces Introduce the types of curves Interpolating Hermite Bezier B-spline Quadratic Bezier Curves Cubic Bezier Curves 2 ESCAPING FLATLAND Until

More information

COMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg

COMPUTER AIDED GEOMETRIC DESIGN. Thomas W. Sederberg COMPUTER AIDED GEOMETRIC DESIGN Thomas W. Sederberg January 31, 2011 ii T. W. Sederberg iii Preface This semester is the 24 th time I have taught a course at Brigham Young University titled, Computer Aided

More information

2D Spline Curves. CS 4620 Lecture 18

2D Spline Curves. CS 4620 Lecture 18 2D Spline Curves CS 4620 Lecture 18 2014 Steve Marschner 1 Motivation: smoothness In many applications we need smooth shapes that is, without discontinuities So far we can make things with corners (lines,

More information

Geometric Modeling of Curves

Geometric Modeling of Curves Curves Locus of a point moving with one degree of freedom Locus of a one-dimensional parameter family of point Mathematically defined using: Explicit equations Implicit equations Parametric equations (Hermite,

More information

Derivative. Bernstein polynomials: Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 313

Derivative. Bernstein polynomials: Jacobs University Visualization and Computer Graphics Lab : ESM4A - Numerical Methods 313 Derivative Bernstein polynomials: 120202: ESM4A - Numerical Methods 313 Derivative Bézier curve (over [0,1]): with differences. being the first forward 120202: ESM4A - Numerical Methods 314 Derivative

More information

G 2 Bezier Crust on Quad Subdivision Surfaces

G 2 Bezier Crust on Quad Subdivision Surfaces Pacific Graphics (2013) B. Levy, X. Tong, and K. Yin (Editors) Short Papers G 2 Bezier Crust on Quad Subdivision Surfaces paper 1348 Figure 1: Two examples of Bezier crust applied on Catmull-Clark subdivision

More information

Contents. I The Basic Framework for Stationary Problems 1

Contents. I The Basic Framework for Stationary Problems 1 page v Preface xiii I The Basic Framework for Stationary Problems 1 1 Some model PDEs 3 1.1 Laplace s equation; elliptic BVPs... 3 1.1.1 Physical experiments modeled by Laplace s equation... 5 1.2 Other

More information

Designing by a Quadratic Trigonometric Spline with Point and Interval Shape Control

Designing by a Quadratic Trigonometric Spline with Point and Interval Shape Control Int'l Conf. Scientific Computing CSC'18 195 Designing by a Quadratic Trigonometric Spline with Point and Interval Shape Control Shamaila Samreen Department of Mathematics University of Engineering & Technology,

More information

TO DUY ANH SHIP CALCULATION

TO DUY ANH SHIP CALCULATION TO DUY ANH SHIP CALCULATION Ship Calculattion (1)-Space Cuvers 3D-curves play an important role in the engineering, design and manufature in Shipbuilding. Prior of the development of mathematical and computer

More information

15.10 Curve Interpolation using Uniform Cubic B-Spline Curves. CS Dept, UK

15.10 Curve Interpolation using Uniform Cubic B-Spline Curves. CS Dept, UK 1 An analysis of the problem: To get the curve constructed, how many knots are needed? Consider the following case: So, to interpolate (n +1) data points, one needs (n +7) knots,, for a uniform cubic B-spline

More information