DOCSLIB.ORG

Practical Linear Algebra: a Geometry Toolbox Fourth Edition Chapter 20: Curves

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Practical Linear Algebra: a Geometry Toolbox Fourth Edition Chapter 20: Curves Practical Linear Algebra: A Geometry Toolbox Fourth Edition Chapter 20: Curves Gerald Farin & Dianne Hansford A K Peters/CRC Press www.farinhansford.com/books/pla c 2021 Farin & Hansford Practical Linear Algebra 1 / 32 Outline 1 Introduction to Curves 2 Parametric Curves 3 Properties of B´ezier Curves 4 The Matrix Form 5 Derivatives 6 Composite Curves 7 The Geometry of Planar Curves 8 Moving along a Curve 9 WYSK Farin & Hansford Practical Linear Algebra 2 / 32 Introduction to Curves Focus of this chapter: cubic B´ezier curves Invented for car design — France early 1960s at R´enault and Citro¨en in Paris — Techniques still in use today — called Geometric Modeling or Computer-Aided Geometric Design Apply linear algebra and geometric concepts to the study of curves Farin & Hansford Practical Linear Algebra 3 / 32 Parametric Curves Straight line in parametric form: x(t) = (1 − t)a + tb ⇒ x(0) = a and x(1) = b Interpret t as time and x(t) as a moving point Coefficients (1 − t) and t are linear polynomials ⇒ linear interpolation A parametric curve: a curve that can be written as f (t) x(t)= g(t) where f (t) and g(t) are functions of the parameter t Linear interpolant: f (t) = (1 − t)a1 + tb1 and g(t) = (1 − t)a2 + tb2 In general: f and g can be any functions — polynomial, trig, exponential, ... Farin & Hansford Practical Linear Algebra 4 / 32 Parametric Curves Next: study motion along curves Cubic B´ezier curves: Start with four points in 2D or 3D b0, b1, b2, b3 B´ezier control points ⇒ B´ezier controls polygon — not assumed to be closed Farin & Hansford Practical Linear Algebra 5 / 32 Parametric Curves To create plots: evaluate the cubic curve at many t-parameters — t ∈ [0, 1] — Example: evaluate at 50 points t = 0, 1/50, 2/50,..., 49/50, 1 Evaluation points connected by straight line segments Choose enough t-parameters so the curve looks smooth ⇒ plotting a discrete approximation of the curve Two examples that differ in the location of b0 only Farin & Hansford Practical Linear Algebra 6 / 32 Parametric Curves Evaluation: the de Casteljau algorithm Generate one point — Pick a parameter value t ∈ [0, 1] — Linear interpolation on each leg 1 b0(t)=(1 − t)b0 + tb1 1 b1(t)=(1 − t)b1 + tb2 1 b2(t)=(1 − t)b2 + tb3 Repeat on new polygon 2 1 1 b0 = (1 − t)b0(t)+ tb1(t) 2 1 1 b1 = (1 − t)b1(t)+ tb2(t) Repeat 3 2 2 b0(t)=(1 − t)b0(t)+ tb1(t) ⇒ Point on the B´ezier curve Farin & Hansford Practical Linear Algebra 7 / 32 Parametric Curves j Points bi are called intermediate B´ezier points b0 1 b1 b0 1 2 Schematic b2 b1 b0 1 2 3 b3 b2 b1 b0 stage : 1 2 3 Except for (input) B´ezier polygon each point is a function of t Farin & Hansford Practical Linear Algebra 8 / 32 Parametric Curves Example: de Casteljau algorithm at t = 1/2 4 0 8 8 b = b = b = b = 0 4 1 8 2 8 3 0 1 1 2 b1 = b + b = 0 2 0 2 1 6 1 1 4 b1 = b + b = 1 2 1 2 2 8 1 1 8 b1 = b + b = 2 2 2 2 3 4 1 1 3 b2 = b1 + b1 = 0 2 0 2 1 7 1 1 6 b2 = b1 + b1 = 1 2 1 2 2 6 9 3 1 2 1 2 2 b0 = b0 + b1 = 13 2 2 2 Farin & Hansford Practical Linear Algebra 9 / 32 Parametric Curves Equation for a cubic B´ezier curve 3 2 2 Expand: b0(t) = (1 − t)b0(t)+ tb1(t) 3 2 2 b0 = (1 − t)b0 + tb1 1 1 1 1 = (1 − t) (1 − t)b0 + tb1 + t (1 − t)b1 + tb2 = (1 − t) [(1 − t) [(1 − t)b0 + tb1]+ t [(1 − t)b1 + tb2]] + t [(1 − t) [(1 − t)b1 + tb2]+ t [(1 − t)b2 + tb3]] Collect terms with the same bi 3 3 2 2 3 b0(t) = (1 − t) b0 + 3(1 − t) tb1 + 3(1 − t)t b2 + t b3 General form of a cubic B´ezier curve 3 b0(t) traces out a curve as t traces out values between 0 and 1 3 Shorter notation: b(t) instead of b0(t) Farin & Hansford Practical Linear Algebra 10 / 32 Parametric Curves Cubic polynomials — degree 3 Bernstein basis functions 3 3 B0 (t) = (1 − t) 3 2 B1 (t) = 3(1 − t) t 3 3 3 2 B0 B3 B2 (t) = 3(1 − t)t 3 3 B3 (t)= t 3 3 3 3 3 b0(t)= B0 (t)b0 + B1 (t)b1 B1 B2 3 3 + B2 (t)b2 + B3 (t)b3 All cubic polynomials can be expressed in terms of Bernstein polynomials ⇒ form a basis for all cubic polynomials Farin & Hansford Practical Linear Algebra 11 / 32 Parametric Curves Subdivision A subset of intermediate B´ezier points form two cubic polygons — Mimic the curve’s shape 3 Curve segment from b0 to b0(t) 1 2 3 b0, b0, b0, b0 3 Curve segment from b0(t) to b3 3 2 1 b0, b1, b2, b3 Identify polygons in schematic b0 1 b1 b0 1 2 b2 b1 b0 1 2 3 b3 b2 b1 b0 Farin & Hansford Practical Linear Algebra 12 / 32 Properties of B´ezier Curves Endpoint interpolation: b(0) = b0 and b(1) = b3 Affine invariance: affine map of the control polygon then curve undergoes the same transformation ⇒ Bernstein polynomials sum to one (1 − t)3 + 3(1 − t)2t + 3(1 − t)t2 + t3 = [(1 − t)+ t]3 = 1 Every point on the curve is a barycentric combination of the control points Farin & Hansford Practical Linear Algebra 13 / 32 Properties of B´ezier Curves Bernstein polynomials are nonnegative for t ∈ [0, 1] ⇒ Every point on the curve is a convex combination of the control points ⇒ Convex hull property: for t ∈ [0, 1] the curve lies in the convex hull of the control polygon Extrapolation: evaluate the curve for t-values outside of [0, 1] — Can no longer predict the shape of the curve convexhull minmaxbox The convex hull lies inside the minmax box Farin & Hansford Practical Linear Algebra 14 / 32 The Matrix Form B´ezier curve expressed using dot products: (1 − t)3 3(1 − t)2t b(t)= b b b b 0 1 2 3 3(1 − t)t2 t3 Most well-known: cubic polynomials as combinations of the monomials: 1, t, t2, t3 Rewrite the B´ezier curve: 2 3 b(t)= b0 + 3t(b1 − b0) + 3t (b2 − 2b1 + b0)+ t (b3 − 3b2 + 3b1 − b0) ⇒ Matrix form of a B´ezier curve 1 −3 3 −1 1 0 3 −6 3 t b(t)= b b b b 0 1 2 3 0 0 3 −3 t2 00 0 1 t3 Farin & Hansford Practical Linear Algebra 15 / 32 The Matrix Form A curve in monomial form: 2 3 b(t)= b0 + 3t(b1 − b0) + 3t (b2 − 2b1 + b0)+ t (b3 − 3b2 + 3b1 − b0) 2 3 = a0 + a1t + a2t + a3t Geometrically: a0 = b0 is a point a1, a2, a3 are vectors Using the dot product form: 1 t b(t)= a a a a 0 1 2 3 t2 t3 ⇒ the monomial ai are defined as 1 −3 3 −1 0 3 −6 3 a a a a = b b b b 0 1 2 3 0 1 2 3 0 0 3 −3 00 0 1 Farin & Hansford Practical Linear Algebra 16 / 32 The Matrix Form The inverse process: Given a curve in monomial form, how to write it as a B´ezier curve? −1 1 −3 3 −1 0 3 −6 3 b b b b = a a a a 0 1 2 3 0 1 2 3 0 0 3 −3 00 0 1 A matrix inversion is all that is needed here! — Matrix is nonsingular ⇒ Any cubic curve can be written in either B´ezier or monomial form Farin & Hansford Practical Linear Algebra 17 / 32 Derivatives Cubic B´ezier curve: two (in 2D) or three (in 3D) cubic equations in t 3 3 2 2 3 b0(t) = (1 − t) b0 + 3(1 − t) tb1 + 3(1 − t)t b2 + t b3 First derivative vector: derivative in each of the components db(t) = −3(1 − t)2b − 6(1 − t)tb + 3(1 − t)2b dt 0 1 1 2 2 − 3t b2 + 6(1 − t)tb2 + 3t b3 db(t) ˙ Rearrange and use abbreviation dt = b(t) 2 2 b˙(t) = 3(1 − t) [b1 − b0] + 6(1 − t)t[b2 − b1] + 3t [b3 − b2] ⇒ Derivative curve is degree two ⇒ Derivative curve has control vectors Farin & Hansford Practical Linear Algebra 18 / 32 Derivatives One very nice feature of the de Casteljau algorithm: intermediate B´ezier points lead to simple expression of the derivative ˙ 2 2 b(t) = 3 b1(t) − b0(t) Very simple form at the endpoints ˙ ˙ b(0) = 3[b1 − b0] b(1) = 3[b3 − b2] Control polygon is tangent to the curve at the curve’s endpoints Farin & Hansford Practical Linear Algebra 19 / 32 Derivatives Example: Compute first derivative vector for t = 1/2 Evaluate the direct equation 1 1 0 4 b˙ =3 · − 2 4 8 4 1 8 0 +6 · − 4 8 8 1 8 8 9 +3 · − = 4 0 8 −3 Use intermediate control points 1 1 1 b˙ =3 b2 − b2 2 1 2 0 2 6 3 9 =3 − = 6 7 −3 Farin & Hansford Practical Linear Algebra 20 / 32 Derivatives The derivative of a curve is a vector — It is tangent to the curve Can interpret it as a velocity vector — Interpret parameter t as time then arrive at b(t) at time t with velocity b˙(t) — Large magnitude of the tangent vector ⇒ moving fast If we rotate the control polygon, the curve will follow — And so will all of its derivative vectors In calculus: a “horizontal tangent” has a special meaning — It indicates an extreme value of a function — Notion of an extreme value is meaningless for parametric curves ⋄ Term “horizontal tangent” depends on the curve’s orientation ⋄ Not a property of the curve itself Farin & Hansford Practical Linear Algebra 21 / 32 Derivatives Second derivative vector: may interpret as acceleration 2 2 b˙ (t) = 3(1 − t) [b1 − b0]+6(1 − t)t[b2 − b1]+3t [b3 − b2] ¨ b(t)= −6(1 − t)[b1 − b0] − 6t[b2 − b1]+6(1 − t)[b2 − b1]+6t[b3 − b2] = 6(1 − t)[b2 − 2b1 + b0]+6t[b3 − 2b2 + b1] Via the de Casteljau algorithm: ¨ 1 1 1 b(t) = 6 b2(t) − 2b1(t)+ b0(t) Simple form at endpoints: b¨(0) = 6[b2 − 2b1 + b0] Farin & Hansford Practical Linear Algebra 22 / 32 Composite Curves For “real” shapes need to use many cubic B´ezier curves — Smooth overall curve ⇒ pieces must join smoothly The letter “D” as a collection of cubic B´ezier curves — Only one B´ezier polygon of many is shown Farin & Hansford Practical Linear Algebra 23 / 32 Composite Curves Smoothly joining B´ezier curves Two B´ezier curves: b0, b1, b2, b3 and c0, c1, c2, c3 Common point b3 = c0 Same tangent vector direction: c1 − c0 = c[b3 − b2] For some positive real number c ⇒ b2, b3 = c0, c1 collinear Farin & Hansford Practical Linear Algebra 24 / 32 The Geometry of Planar Curves Imagine driving with constant speed Curviness of road proportional to turning of steering wheel Sample tangents at various points — Successive tangents differ significantly ⇒ curvature is high — Successive tangents
Load more

Recommended publications
  • Relative Curve Orientation in the Alignment of Inconsistent Linear Datasets
    Relative Curve Orientation in the Alignment of Inconsistent Linear Datasets David N. Siriba, Daniel Eggert, Monika Sester Institute of Cartography and Geoinformatics (IKG), Leibniz University of Hannover, Germany Appelstraße 9a, 30167 Hannover, Germany. E-mail: {david.siriba, daniel.eggert, monika.sester}@ikg.uni-hannover.de ABSTRACT An approach for the alignment of a linear dataset of inconsistent positional accuracy with a more accurate one is presented. The approach consists of two main steps: path-matching and alignment based on relative curve orientations of the corresponding feature followed by a non-rigid transformation based on Thin plate Splines (TPS). The results obtained with this approach on two experimental cases show significant improvement in alignment and geometric accuracy of the lower accuracy datasets. 1. INTRODUCTION Geometric alignment of spatial features is one of the typical problems of data integration and usually carried out so that spatial features from two datasets that describe the same object coincide. It is achieved through point-based transformation that utilizes corresponding point features, which represent either some identified point landmarks or nodes mainly in a road network. Point-based transformation is adequate only for simple cases where positional discrepancies between the datasets are low and almost evenly distributed. In case the discrepancies are high and unevenly distributed, point-based approaches are not sufficient for aligning linear and polygonal features as they only guarantee that the control points will coincide. This problem is often encountered when integrating legacy datasets that contain large positional distortions with more geometrically accurate and newer datasets. Therefore corresponding linear features could be used to determine a more suitable geometric transformation between the datasets, in addition to point features.
    [Show full text]
  • (Iso19107) of the Open Geospatial Consortium
    Technical Report A Java Implementation of the OpenGIS™ Feature Geometry Abstract Specification (ISO 19107 Spatial Schema) Sanjay Dominik Jena, Jackson Roehrig {[email protected], [email protected]} University of Applied Sciences Cologne Institute for Technology in the Tropics Version 0.1 July 2007 ABSTRACT The Open Geospatial Consortium’s (OGC) Feature Geometry Abstract Specification (ISO/TC211 19107) describes a geometric and topological data structure for two and three dimensional representations of vector data. GeoAPI, an OGC working group, defines inter- face APIs derived from the ISO 19107. GeoTools provides an open source Java code library, which implements (OGC) specifications in close collaboration with GeoAPI projects. This work describes a partial but serviceable implementation of the ISO 19107 specifi- cation and its corresponding GeoAPI interfaces considering previous implementations and related specifications. It is intended to be a first impulse to the GeoTools project towards a full implementation of the Feature Geometry Abstract Specification. It focuses on aspects of spatial operations, such as robustness, precision, persistence and performance. A JUnit Test Suite was developed to verify the compliance of the implementation with the GeoAPI. The ISO 19107 is discussed and proposals for improvement of the GeoAPI are presented. II © Copyright by Sanjay Dominik Jena and Jackson Roehrig 2007 ACKNOWLEDGMENTS Our appreciation goes to the whole of the GeoTools and GeoAPI communities, in par- ticular to Martin Desruisseaux, Bryce Nordgren, Jody Garnett and Graham Davis for their extensive support and several discussions, and to the JTS developers, the JTS developer mail- ing list and to those, who will make use of and continue the implementation accomplished in this work.
    [Show full text]
  • Analytic Rasterization of Curves with Polynomial Filters
    EUROGRAPHICS ’0x / N.N. and N.N. Volume 0 (1981), Number 0 (Editors) Analytic Rasterization of Curves with Polynomial Filters Josiah Manson and Scott Schaefer Texas A&M University Figure 1: Vector graphic art of butterflies represented by cubic curves, scaled by the golden ratio. The images were analytically rasterized using our method with a radial filter of radius three. Abstract We present a method of analytically rasterizing shapes that have curved boundaries and linear color gradients using piecewise polynomial prefilters. By transforming the convolution of filters with the image from an integral over area into a boundary integral, we find closed-form expressions for rasterizing shapes. We show that a poly- nomial expression can be used to rasterize any combination of polynomial curves and filters. Our rasterizer also handles rational quadratic boundaries, which allows us to evaluate circles and ellipses. We apply our technique to rasterizing vector graphics and show that our derivation gives an efficient implementation as a scanline rasterizer. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism—Color, shading, shadowing, and texture 1. Introduction Although many shapes are stored in vector format, dis- plays are typically raster devices. This means that vector im- There are two basic ways of representing images: raster ages must be converted to pixel intensities to be displayed. graphics and vector graphics. Raster graphics are images that A major benefit of vector images is that they can be drawn are stored as an array of pixel values, whereas vector graph- accurately at different resolutions.
    [Show full text]
  • UNIT 2. Curvatures of a Curve
    UNIT 2. Curvatures of a Curve ========================================================================================================= ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Convergence of k-planes, the osculating k-plane, curves of general type in Rn, the osculating flag, vector fields, moving frames and Frenet frames along a curve, orientation of a vector space, the standard orientation of Rn, the distinguished Frenet frame, Gram-Schmidt orthogonalization process, Frenet formulas, curvatures, invariance theorems, curves with prescribed curvatures. ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- One of the most important tools of analysis is linearization, or more generally, the approximation of general objects with easily treatable ones. E.g. the derivative of a function is the best linear approximation, Taylor’s polynomials are the best polynomial approximations
    [Show full text]
  • Vector-Valued Functions
    12 Vector-Valued Functions 12.1 Vector-Valued Functions Copyright © Cengage Learning. All rights reserved. Copyright © Cengage Learning. All rights reserved. Objectives ! Analyze and sketch a space curve given by a vector-valued function. ! Extend the concepts of limits and continuity to vector-valued functions. Space Curves and Vector-Valued Functions 3 4 Space Curves and Vector-Valued Functions Space Curves and Vector-Valued Functions A plane curve is defined as the set of ordered pairs (f(t), g(t)) This definition can be extended naturally to three-dimensional together with their defining parametric equations space as follows. x = f(t) and y = g(t) A space curve C is the set of all ordered triples (f(t), g(t), h(t)) together with their defining parametric equations where f and g are continuous functions of t on an interval I. x = f(t), y = g(t), and z = h(t) where f, g and h are continuous functions of t on an interval I. A new type of function, called a vector-valued function, is introduced. This type of function maps real numbers to vectors. 5 6 Space Curves and Vector-Valued Functions Space Curves and Vector-Valued Functions Technically, a curve in the plane or in space consists of a A collection of points and the defining parametric equations. Two different curves can have the same graph. For instance, each of the curves given by r(t) = sin t i + cos t j and r(t) = sin t2 i + cos t2 j has the unit circle as its graph, but these equations do not represent the same curve—because the circle is traced out in different ways on the graphs.
    [Show full text]
  • A Closed-Form Solution for the Flat-State Geometry of Cylindrical Surface Intersections Bounded on All Sides by Orthogonal Planes
    A closed-form solution for the flat-state geometry of cylindrical surface intersections bounded on all sides by orthogonal planes Michael P. May Dec 12, 2013 Presented herein is a closed-form mathematical solution for the construction of an orthogonal cross section of intersecting cylinder surface geometry created from a single planar section. The geometry in its 3-dimensional state consists of the intersection of two cylindrical surfaces of equal radii which is bounded on all four sides by planes orthogonal to the primary cylinder axis. A multivariate feature of the geometry includes two directions of rotation of a secondary cylinder with respect to a primary cylinder about their intersecting axes. See Figs. 1 and 2 for the definition of the two variable directions of rotation of the secondary cylinder with respect to the primary cylinder. Primary cylinder θ Secondary cylinder Fig 1: Primary direction θ of the rotation of the secondary cylinder section with respect to the primary cylinder section (top view) 1 Secondary cylinder Primary cylinder ω Fig 2: Secondary direction ω of the rotation of the secondary cylinder section with respect to the primary cylinder section (front view) For convenience in forming the 3-dimensional geometry from its plane state, each cylindrical surface section will include a short section of planar wall on one side of the cylinder surface that is tangent to the cylinder along its longitudinal axis. It will later be shown that this short section of flat wall is expedient for producing the three-dimensional geometry from its flat state via rolling and bending operations that follow the profiling of the geometry in its flat state.
    [Show full text]
  • About Invalid, Valid and Clean Polygons
    About Invalid, Valid and Clean Polygons Peter van Oosterom, Wilko Quak and Theo Tijssen Delft University of Technology, OTB, section GIS technology, Jaffalaan 9, 2628 BX Delft, The Netherlands. Abstract Spatial models are often based on polygons both in 2D and 3D. Many Geo-ICT products support spatial data types, such as the polygon, based on the OpenGIS ‘Simple Features Specification’. OpenGIS and ISO have agreed to harmonize their specifications and standards. In this paper we discuss the relevant aspects related to polygons in these standards and compare several implementations. A quite exhaustive set of test polygons (with holes) has been developed. The test results reveal significant differ- ences in the implementations, which causes interoperability problems. Part of these differences can be explained by different interpretations (defini- tions) of the OpenGIS and ISO standards (do not have an equal polygon definition). Another part of these differences is due to typical implementa- tion issues, such as alternative methods for handling tolerances. Based on these experiences we propose an unambiguous definition for polygons, which makes polygons again the stable foundation it is supposed to be in spatial modelling and analysis. Valid polygons are well defined, but as they may still cause problems during data transfer, also the concept of (valid) clean polygons is defined. 1 Introduction Within our Geo-Database Management Centre (GDMC), we investigate different Geo-ICT products, such as Geo-DBMSs, GIS packages and ‘geo’ middleware solutions. During our tests and benchmarks, we noticed subtle, but fundamental differences in the way polygons are treated (even in the 2D situation and using only straight lines).
    [Show full text]
  • 2-MANIFOLD RECONSTRUCTION from SPARSE VISUAL FEATURES Vadim Litvinov, Shuda Yu, Maxime Lhuillier
    2-MANIFOLD RECONSTRUCTION FROM SPARSE VISUAL FEATURES Vadim Litvinov, Shuda Yu, Maxime Lhuillier To cite this version: Vadim Litvinov, Shuda Yu, Maxime Lhuillier. 2-MANIFOLD RECONSTRUCTION FROM SPARSE VISUAL FEATURES. International Conference on 3D Imaging, Dec 2012, Liège, Belgium. hal- 01635468 HAL Id: hal-01635468 https://hal.archives-ouvertes.fr/hal-01635468 Submitted on 15 Nov 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 2-MANIFOLD RECONSTRUCTION FROM SPARSE VISUAL FEATURES Vadim Litvinov, Shuda Yu, and Maxime Lhuillier Institut Pascal, UMR 6602 CNRS/UBP/IFMA, Campus des Cezeaux,´ Aubiere,` France ABSTRACT graphic methods [1] and dense stereo methods which enforce smoothness or curvature constraints on the surface (e.g. [2]). The majority of methods for the automatic surface recon- The contributions of the paper are the following: we add struction of a scene from an image sequence have two steps: reconstructed curves to the input point cloud in [17], and Structure-from-Motion and dense stereo. From the complexity we experiment on both multiview image data with ground viewpoint, it would be interesting to avoid dense stereo and truth [14, 15] and omnidirectional video image sequences to generate a surface directly from the sparse features recon- (Ladybug).
    [Show full text]
  • Self-Approaching Paths in Simple Polygons
    Self-approaching paths in simple polygons Citation for published version (APA): Bose, P., Kostitsyna, I., & Langerman, S. (2020). Self-approaching paths in simple polygons. Computational Geometry, 87, [101595]. https://doi.org/10.1016/j.comgeo.2019.101595 DOI: 10.1016/j.comgeo.2019.101595 Document status and date: Published: 01/04/2020 Document Version: Accepted manuscript including changes made at the peer-review stage Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Surfaces Associated to a Space Curve: a New Proof of Fabricius-Bjerre's Formula
    Surfaces associated to a space curve: A new proof of Fabricius-Bjerre's Formula vorgelegt von M. Sc. Barbara Jab lo´nska Kamie´nPomorski (Polen) Von der Fakult¨atII - Mathematik und Naturwissenschaften der Technischen Universit¨atBerlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften Dr.rer.nat. genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. Fredi Tr¨oltzsch Berichter/Gutachter: Prof. John M. Sullivan, Ph.D. Berichter/Gutachter: Prof. Thomas Banchoff, Ph.D. Tag der wissenschaftlichen Aussprache: 23.05.2012 Berlin 2012 D 83 ii Abstract In 1962 Fabricius-Bjerre [16] found a formula relating certain geometric features of generic closed plane curves. Among bitangent lines, i.e., lines that are tangent to a curve at two points, distinguish two types: external - if the arcs of tangency lie on the same side of the line - and internal otherwise. Then, there is the following equality: the number of external bitangent lines equals the sum of the number of internal bitangent lines, the number of crossings and half of the number of inflection points of the plane curve. Two different proofs of the formula followed, by Halpern [20] in 1970 and Ban- choff [6] in 1974, as well as many generalizations. Halpern's approach is used here to provide a generalization from bitangent lines to parallel tangents pairs. The main result of this thesis is a new proof of Fabricius-Bjerre's Theorem, which uses new methods. The idea is to view a plane curve as a projection of a space curve. The proof establishes a connection between the generic plane curves and the projections of a certain class of generic closed space curves.
    [Show full text]
  • Mathematical Methods
    Mathematical Methods Li-Chung Wang December 10, 2011 Abstract Mathematical training is to teach students the methods of removing obstacles, especially the standard ones that will be used again and again. The more methods one has learned, the higher one’s skill and the more chances one may do some creative works in methematics. In this paper, we try to classify all the mathematical methods. Mathematical methods are too many to count. They look too diversified to manage. If we attempt to classify them by luck, it would be difficult as though we were lost in a maze and tried to get out. However, if we caredully study a method’s origins, development and functions, we may find some clues about our task by following along their texture. Studying methods helps us analyze patterns. In order to make a method’s essence outstanding, the setting must be simple. Using a method is like producing a product: A method can be divided into three stages: input, process, and output. Suppose we compare Method A with Method B. If the input of Method B is more than or equal to that of Method A and if both the process and the output of Method B are better than those of Method A, then we say that Method B is more productive than Method A. Here are some examples. Cases when the input is increased: The method given in the general case can be applied to specific cases. However, specific cases contain more resources, there may be more effective methods available for specific cases.
    [Show full text]
  • Apollonius Meets Pythagoras1
    Apollonius meets Pythagoras1 Ching-Shoei Chiang* and Christoph M. Hoffmann† * Soochow University, Taipei, Taipei, R.O.C. E-mail: [email protected] Tel/Fax: +886-2-2311-1531 ext. 3801 † Purdue University, West Lafayette, IN 47906, USA E-mail: [email protected] Tel: 1-765-494-6185 Abstract—Cyclographic maps are an important tool in rational Bézier curve. Section 4 illustrates the Apollonius Laguerre geometry that can be used to solve the problem of problem of 3 primitives, including ray, cycle, and oriented PH Apollonius. The cyclographic map of a planar boundary curve is curve. We conclude with results in the final section. a ruled surface that we call -map. A PH curve is a free form curve whose tangent and normal are polynomial. This implies that its cyclographic map has a parametric form. This paper considers the medial axis transform (MAT) of a PH curve with a II. DEFINITIONS AND THEOREMS ray and the MAT of a PH curve with a cycle. We transform the Pythagorean Hodograph(PH) has a property that is closely MAT finding problem into a surface intersection problem. Here, linked to the its cyclographic map. If a 2D curve has the PH the intersection curve is representable in rational Bezier form. property, that is, if its tangent is a polynomial, then the Furthermore, the generalized Apollonius problem concerning rays, cycles, and oriented PH curves is introduced. cyclographic map for the curve has a polynomial form. We define some key terms now, including the Pythagorean Hodograph curve and the cyclographic map. I. INTRODUCTION A.
    [Show full text]