DOCSLIB.ORG

The Average of a Set of Compatible Curves and Surfaces

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Average of a Set of Compatible Curves and Surfaces THE AVERAGE OF A SET OF COMPATIBLE CURVES AND SURFACES A Thesis Presented to The Academic Faculty By Mukul Sati In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Interactive Computing Georgia Institute of Technology August 2019 Copyright c Mukul Sati 2019 THE AVERAGE OF A SET OF COMPATIBLE CURVES AND SURFACES Approved by: Dr. Jarek Rossignac, Advisor Dr. Thomas Kurfess School of Interactive Computing School of Mechanical Engineering Georgia Institute of Technology Georgia Institute of Technology Dr. Greg Turk Dr. Karen Liu School of Interactive Computing School of Interactive Computing Georgia Institute of Technology Georgia Institute of Technology Dr. Concettina Guerra Date Approved: April 18, 2019 School of Interactive Computing Georgia Institute of Technology ACKNOWLEDGEMENTS Words cannot convey my appreciation for my advisor Dr. Jarek Rossignac, but I will try. Dr. Rossignac has been a mentor and guide for both research method and research philosophy. He allowed me the freedom and luxury of working at my pace and owning my learning. Very importantly, he made me comfortable asking questions. Working with him exposed me to a variety of research problems and, while I grappled with each of them to varying levels of success, Dr. Rossignac always motivated me to strive to understand the essence of the problem. Thank you, dear sir, for making me fall in love (again) with geometry and math – a fascination that I am sure will last a life-time. I would like to thank Dr. Thomas Kurfess for introducing me to, and encouraging me to get practical experience with manufacturing. Thanks also, to Dr. Roby Lynn for being ever-willing to answer my incessant, basic questions about machining, mechatronics and control. Also, I would like to thank Dr. Tommy Tucker and Dr. Chris Saldana for insights and assistance on the CNC control work that funded a significant portion of my graduate studies. My interactions with people in the M.E. department at Georgia Tech have significantly influenced my research interests. I would like to thank my committee members, Dr. Greg Turk, Dr. Concettina Guerra, and Dr. Karen Liu for their valuable inputs and for their service. Along with my advisor, Dr. Turk and Dr. Liu were ever present during my doctoral education, were exemplary teachers, and model researchers. I was continually inspired by both their technical skills, and their calm and poised demeanor. Thanks are also due to members of the graphics group at Georgia Tech for stimulating discussions. I would also like to thank my friends Sandeep and Aishwarya for non-remote counsel. Finally, I would like to thank all of my family for their blessings, support and guidance. Especially, Meghna for lovingly putting up with me, my parents for their uncon- ditional love, and, my brother Saurabh for always being a willing listening ear. iii TABLE OF CONTENTS Acknowledgments . iii List of Tables . ix List of Figures . .xviii Chapter 1: Introduction . 1 1.1 Thesis overview . 1 1.2 Thesis structure . 7 Chapter 2: Background . 10 2.1 A motivating example: The shoe fitting problem . 10 2.2 Preliminaries: Averaging numbers and points . 11 Chapter 3: Averaging vectors, lines and planes . 15 3.1 Averaging a set of unit vectors in 2D . 15 3.2 Averaging a set of unit vectors in 3D . 16 3.3 Averaging a set of lines in 2D . 17 3.3.1 Zero-set average line (zAL) . 18 3.3.2 Valley-set average line (vAL) . 19 3.4 Averaging a set of planes in 3D . 23 iv 3.4.1 Zero-set average plane (zAP) . 23 3.4.2 Valley-set average plane (vAP) . 24 3.5 Averaging a set of lines in 3D . 25 3.6 Weighted average of a set of lines in 2D . 29 3.6.1 Weighted zero-set average line (weighted zAL) . 29 3.6.2 Weighted valley-set average line (weighted vAL) . 29 3.7 Properties of the average line and the average plane . 30 3.8 Geometric interpretations . 30 Chapter 4: Prior art . 33 4.1 Averaging . 33 4.2 Averaging shapes . 34 4.2.1 Establishing correspondence . 34 4.2.2 Extracting features from a scalar field . 37 4.2.3 Medial axis and ball morph . 41 4.2.4 Staggered, iterative optimization . 42 4.2.5 Guaranteed homeomorphic approximations . 43 4.3 Relation of our contributions to prior-art . 43 Chapter 5: Averaging closed, compatible planar curves . 46 5.1 Snapping for curves in the plane . 46 5.2 Projecting onto the average line . 47 5.2.1 Projecting on the zAL . 48 5.2.2 Projecting on the vAL . 48 v 5.3 Tracing: Accelerated Snap . 50 5.4 Experimental results . 52 5.5 Application: Mixing shapes via weighted averaging . 53 Chapter 6: Details and discussion of the Snap method . 55 6.1 The asymmetry drawback of closest projection correspondences . 56 6.2 Ball-map: symmetric center-curve and closest projection correspondences for 2 curves . 59 6.3 Scalar fields for averaging for n curves . 60 6.3.1 Zero-set of summed signed distance function . 60 6.3.2 Valley-set of summed squared distance function . 63 6.3.3 General approach to averaging using scalar fields . 64 6.4 Snapping using tangent lines . 65 6.4.1 Compatibility conditions for a set of input curves . 66 6.4.2 Implicit clipping of the valley-set by Snap . 70 6.4.3 Convergence of Snap . 72 6.4.4 Symmetry properties of the average . 76 6.4.5 Incremental averaging . 77 6.5 Beyond compatible configurations . 77 6.5.1 Gap relative projection (GRP) . 77 6.5.2 Tracing: implicit GRP . 78 6.5.3 Constructing a set of compatible curves from the input-set . 79 6.6 Checking validity of the average . 81 vi Chapter 7: Averaging a set of compatible surfaces . 82 7.1 Snapping for surfaces . 82 7.2 SymmetricSnap: Snapping by moving parallel to the local average normal . 83 7.3 NormalSnap: Snapping by moving along a seed surface’s normal . 85 7.4 Implementation details . 86 7.4.1 Tracing for surfaces . 88 7.5 Experimental results . 89 7.5.1 Validity checking . 90 7.5.2 Symmetry: Invariance to seed mesh . 92 7.5.3 Convergence properties . 92 Chapter 8: Averaging closed, compatible non-planar curves . 93 8.1 Snapping for curves in 3D . 93 8.2 Moving to the local average line . 96 8.3 Implementation details . 98 8.3.1 Computational optimizations: RestrictedSnap . 99 8.4 Experimental results . 101 8.5 Applications . 104 Chapter 9: Experiments on averaging curve segments . 113 9.1 Background and motivation . 113 9.2 OpenSnap: Snapping for roughly parallel curve-segments . 113 9.3 OpenSnap details: Clipped correspondences, geometry and field modifica- tions . 117 vii 9.3.1 ClippedClosestProjection: Selecting active curves . 118 9.3.2 Join curve specification using field and geometry modifications . 119 9.4 Average curve for parallel curve-segments using OpenSnap . 120 9.5 DirectionalOpenSnap: Average curve-network from non-parallel inputs . 121 9.6 Conclusion . 122 Chapter 10:Averaging tool-paths for analyzing systemic error and noise in a CNC machining process . 124 10.1 Background and motivation . 124 10.2 Description of the tool-path data acquisition system . 127 10.2.1 PocketNC and MachineKit . 127 10.2.2 SculptPrint . 128 10.2.3 Trajectory generation . 129 10.2.4 Encoder feedback . 130 10.3 Experimental results . 131 10.3.1 Experiment description . 131 10.3.2 Data analysis . 131 References . 140 viii LIST OF TABLES 6.1 For different configuration of two circles with an annular gap, for a set of n n samples p on a seed circle, the value max( Move (p); p1 Move (p); p2 ) f g k k−k k – the maximum absolute value of the difference in distances between the n−1 ‘moved’ to point Move (p) and its closest points p1 and p2 on the two circles at the start of the nth Move iteration. 72 6.2 For different configuration of 3 and 4 circles with an annular gap, the max- imum (over all seed samples being Snapped) of the length of the Move vector during the nth Move iteration. 74 7.1 The variation, and its rate of change, between evolving surfaces resulting from applying Snap to different seed meshes in a family. For a set of in- put triangle mesh families, the second column reports the maximum of the mean Hausdorff distance (sampled) over all pairs of meshes in each family. Subsequent columns report the maximum mean Hausdorff distance over all resulting triangle-meshes for a particular Move iteration, for increasing Move iteration count, first for SymmetricSnap’s Move iterations, and, then, for NormalSnaps’ Move iterations. Each Hausdorff distance is normalized by the diagonal of the bounding box of the pair of meshes under consideration. 89 7.2 The Snap procedure is performed for each vertex of a triangle mesh in the family, and the average and max distances moved by the image of the vertex under successive Move iterations is noted. This is done with each triangle mesh in the family serving as the seed, and, the summary statistics reported above are the maximum of the average and mean distances moved. The distances are normalized with the average max mean Hausdorff distance reported for the family as reported in Table 7.1. 89 8.1 For different sets of 3D curves, the maximum (over all seed samples being Snapped) of the length of the Move vector during the nth Move iteration. 102 ix LIST OF FIGURES 1.1 What is the average of a set of curves? .
Load more

Recommended publications
  • Toponogov.V.A.Differential.Geometry
    Victor Andreevich Toponogov with the editorial assistance of Vladimir Y. Rovenski Differential Geometry of Curves and Surfaces A Concise Guide Birkhauser¨ Boston • Basel • Berlin Victor A. Toponogov (deceased) With the editorial assistance of: Department of Analysis and Geometry Vladimir Y. Rovenski Sobolev Institute of Mathematics Department of Mathematics Siberian Branch of the Russian Academy University of Haifa of Sciences Haifa, Israel Novosibirsk-90, 630090 Russia Cover design by Alex Gerasev. AMS Subject Classification: 53-01, 53Axx, 53A04, 53A05, 53A55, 53B20, 53B21, 53C20, 53C21 Library of Congress Control Number: 2005048111 ISBN-10 0-8176-4384-2 eISBN 0-8176-4402-4 ISBN-13 978-0-8176-4384-3 Printed on acid-free paper. c 2006 Birkhauser¨ Boston All rights reserved. This work may not be translated or copied in whole or in part without the writ- ten permission of the publisher (Birkhauser¨ Boston, c/o Springer Science+Business Media Inc., 233 Spring Street, New York, NY 10013, USA) and the author, except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and re- trieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed in the United States of America. (TXQ/EB) 987654321 www.birkhauser.com Contents Preface ....................................................... vii About the Author .............................................
    [Show full text]
  • Arxiv:1605.06950V4 [Stat.ML] 12 Apr 2017 Racy of RAND Depends on the Diameter of the Network, 1 X Which Motivated Cohen Et Al
    A Sub-Quadratic Exact Medoid Algorithm James Newling Fran¸coisFleuret Idiap Research Institute & EPFL Idiap Research Institute & EPFL Abstract network analysis. In clustering, the Voronoi iteration K-medoids algorithm (Hastie et al., 2001; Park and Jun, 2009) requires determining the medoid of each of We present a new algorithm trimed for ob- K clusters at each iteration. In operations research, taining the medoid of a set, that is the el- the facility location problem requires placing one or ement of the set which minimises the mean several facilities so as to minimise the cost of connect- distance to all other elements. The algorithm ing to clients. In network analysis, the medoid may is shown to have, under certain assumptions, 3 d represent an influential person in a social network, or expected run time O(N 2 ) in where N is R the most central station in a rail network. the set size, making it the first sub-quadratic exact medoid algorithm for d > 1. Experi- ments show that it performs very well on spa- 1.1 Medoid algorithms and our contribution tial network data, frequently requiring two A simple algorithm for obtaining the medoid of a set orders of magnitude fewer distance calcula- of N elements computes the energy of all elements and tions than state-of-the-art approximate al- selects the one with minimum energy, requiring Θ(N 2) gorithms. As an application, we show how time. In certain settings Θ(N) algorithms exist, such trimed can be used as a component in an as in 1-D where the problem is solved by Quickse- accelerated K-medoids algorithm, and then lect (Hoare, 1961), and more generally on trees.
    [Show full text]
  • Robust Geometry Estimation Using the Generalized Voronoi Covariance Measure Louis Cuel, Jacques-Olivier Lachaud, Quentin Mérigot, Boris Thibert
    Robust Geometry Estimation using the Generalized Voronoi Covariance Measure Louis Cuel, Jacques-Olivier Lachaud, Quentin Mérigot, Boris Thibert To cite this version: Louis Cuel, Jacques-Olivier Lachaud, Quentin Mérigot, Boris Thibert. Robust Geometry Estimation using the Generalized Voronoi Covariance Measure. SIAM Journal on Imaging Sciences, Society for In- dustrial and Applied Mathematics, 2015, 8 (2), pp.1293-1314. 10.1137/140977552. hal-01058145v2 HAL Id: hal-01058145 https://hal.archives-ouvertes.fr/hal-01058145v2 Submitted on 4 Nov 2015 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. Robust Geometry Estimation using the Generalized Voronoi Covariance Measure∗y Louis Cuel1,2, Jacques-Olivier Lachaud 2, Quentin M´erigot1,3, and Boris Thibert2 1Laboratoire Jean Kuntzman, Universit´eGrenoble-Alpes, France 2Laboratoire de Math´ematiques(LAMA), Universit´ede Savoie, France 3CNRS November 4, 2015 Abstract d The Voronoi Covariance Measure of a compact set K of R is a tensor-valued measure that encodes geometrical information on K and which is known to be resilient to Hausdorff noise but sensitive to outliers. In this article, we generalize this notion to any distance-like function δ and define the δ-VCM.
    [Show full text]
  • Differential Geometry
    Differential Geometry J.B. Cooper 1995 Inhaltsverzeichnis 1 CURVES AND SURFACES—INFORMAL DISCUSSION 2 1.1 Surfaces ................................ 13 2 CURVES IN THE PLANE 16 3 CURVES IN SPACE 29 4 CONSTRUCTION OF CURVES 35 5 SURFACES IN SPACE 41 6 DIFFERENTIABLEMANIFOLDS 59 6.1 Riemannmanifolds .......................... 69 1 1 CURVES AND SURFACES—INFORMAL DISCUSSION We begin with an informal discussion of curves and surfaces, concentrating on methods of describing them. We shall illustrate these with examples of classical curves and surfaces which, we hope, will give more content to the material of the following chapters. In these, we will bring a more rigorous approach. Curves in R2 are usually specified in one of two ways, the direct or parametric representation and the implicit representation. For example, straight lines have a direct representation as tx + (1 t)y : t R { − ∈ } i.e. as the range of the function φ : t tx + (1 t)y → − (here x and y are distinct points on the line) and an implicit representation: (ξ ,ξ ): aξ + bξ + c =0 { 1 2 1 2 } (where a2 + b2 = 0) as the zero set of the function f(ξ ,ξ )= aξ + bξ c. 1 2 1 2 − Similarly, the unit circle has a direct representation (cos t, sin t): t [0, 2π[ { ∈ } as the range of the function t (cos t, sin t) and an implicit representation x : 2 2 → 2 2 { ξ1 + ξ2 =1 as the set of zeros of the function f(x)= ξ1 + ξ2 1. We see from} these examples that the direct representation− displays the curve as the image of a suitable function from R (or a subset thereof, usually an in- terval) into two dimensional space, R2.
    [Show full text]
  • Infield Biomass Bales Aggregation Logistics and Equipment Track
    INFIELD BIOMASS BALES AGGREGATION LOGISTICS AND EQUIPMENT TRACK IMPACTED AREA EVALUATION A Thesis Submitted to the Graduate Faculty of the North Dakota State University of Agriculture and Applied Science By Subhashree Navaneetha Srinivasagan In Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE Major Department: Agricultural and Biosystems Engineering November 2017 Fargo, North Dakota NORTH DAKOTA STATE UNIVERSITY Graduate School Title INFIELD BIOMASS BALES AGGREGATION LOGISTICS AND EQUIPMENT TRACK IMPACTED AREA EVALUATION By Subhashree Navaneetha Srinivasagan The supervisory committee certifies that this thesis complies with North Dakota State University’s regulations and meets the accepted standards for the degree of MASTER OF SCIENCE SUPERVISORY COMMITTEE: Dr. Igathinathane Cannayen Chair Dr. Halis Simsek Dr. David Ripplinger Approved: 11/22/2017 Dr. Sreekala Bajwa Date Department Chair ABSTRACT Efficient bale stack location, infield bale logistics, and equipment track impacted area were conducted in three different studies using simulation in R. Even though the geometric median produced the best logistics, among the five mathematical grouping methods, the field middle was recommended as it was comparable and easily accessible in the field. Curvilinear method developed (8–259 ha), incorporating equipment turning (tractor: 1 and 2 bales/trip, automatic bale picker (ABP): 8–23 bales/trip, harvester, and baler), evaluated the aggregation distance, impacted area, and operation time. The harvester generated the most, followed by the baler, and the ABP the least impacted area and operation time. The ABP was considered as the most effective bale aggregation equipment compared to the tractor. Simple specific and generalized prediction models, developed for aggregation logistics, impacted area, and operation time, have performed 2 well (0.88 R 0.99).
    [Show full text]
  • Robustness Meets Algorithms
    Robustness Meets Algorithms Ankur Moitra (MIT) Robust Statistics Summer School CLASSIC PARAMETER ESTIMATION Given samples from an unknown distribution in some class e.g. a 1-D Gaussian can we accurately estimate its parameters? CLASSIC PARAMETER ESTIMATION Given samples from an unknown distribution in some class e.g. a 1-D Gaussian can we accurately estimate its parameters? Yes! CLASSIC PARAMETER ESTIMATION Given samples from an unknown distribution in some class e.g. a 1-D Gaussian can we accurately estimate its parameters? Yes! empirical mean: empirical variance: R. A. Fisher The maximum likelihood estimator is asymptotically efficient (1910-1920) R. A. Fisher J. W. Tukey The maximum likelihood What about errors in the estimator is asymptotically model itself? (1960) efficient (1910-1920) ROBUST PARAMETER ESTIMATION Given corrupted samples from a 1-D Gaussian: + = ideal model noise observed model can we accurately estimate its parameters? How do we constrain the noise? How do we constrain the noise? Equivalently: L1-norm of noise at most O(ε) How do we constrain the noise? Equivalently: Arbitrarily corrupt O(ε)-fraction L1-norm of noise at most O(ε) of samples (in expectation) How do we constrain the noise? Equivalently: Arbitrarily corrupt O(ε)-fraction L1-norm of noise at most O(ε) of samples (in expectation) This generalizes Huber’s Contamination Model: An adversary can add an ε-fraction of samples How do we constrain the noise? Equivalently: Arbitrarily corrupt O(ε)-fraction L1-norm of noise at most O(ε) of samples (in expectation)
    [Show full text]
  • Geometric Median Shapes
    GEOMETRIC MEDIAN SHAPES Alexandre Cunha Center for Advanced Methods in Biological Image Analysis Center for Data Driven Discovery California Institute of Technology, Pasadena, CA, USA ABSTRACT an efficient linear program in practice. They observed that smooth We present an algorithm to compute the geometric median of shapes do not necessarily lead to smooth medians, an aspect we also shapes which is based on the extension of median to high dimen- verified in some of our experiments. sions. The median finding problem is formulated as an optimization We propose a method to quickly build median shapes from over distances and it is solved directly using the watershed method closed planar contours representing silhouettes of shapes discretized as an optimizer. We show that the geometric median shape faithfully in images. Our median shape is computed using the notion of represents the true central tendency of the data, contaminated or not. geometric median [12], also known as the spatial median, Fermat- It is superior to the mean shape which can be negatively affected by Weber point, and L1 median (see [13] for the history and survey the presence of outliers. Our approach can be applied to manifold of multidimensional medians), which is an extension of the median and non manifold shapes, with single or multiple connected com- of numbers to points in higher dimensional spaces. The geometric ponents. The application of distance transform and watershed algo- median has the property, in any dimension, that it minimizes the n rithm, two well established constructs of image processing, lead to sum of its Euclidean distances to given anchor points xj 2 R , an algorithm that can be quickly implemented to generate fast solu- ∗ X x = arg min kx − xj k : (1) tions with linear storage requirement.
    [Show full text]
  • Rotation Averaging
    Noname manuscript No. (will be inserted by the editor) Rotation Averaging Richard Hartley, Jochen Trumpf, Yuchao Dai, Hongdong Li Received: date / Accepted: date Abstract This paper is conceived as a tutorial on rota- Single rotation averaging. In the single rotation averaging tion averaging, summarizing the research that has been car- problem, several estimates are obtained of a single rotation, ried out in this area; it discusses methods for single-view which are then averaged to give the best estimate. This may and multiple-view rotation averaging, as well as providing be thought of as finding a mean of several points Ri in the proofs of convergence and convexity in many cases. How- rotation space SO(3) (the group of all 3-dimensional rota- ever, at the same time it contains many new results, which tions) and is an instance of finding a mean in a manifold. were developed to fill gaps in knowledge, answering funda- Given an exponent p ≥ 1 and a set of n ≥ 1 rotations p mental questions such as radius of convergence of the al- fR1;:::; Rng ⊂ SO(3) we wish to find the L -mean rota- gorithms, and existence of local minima. These matters, or tion with respect to d which is defined as even proofs of correctness have in many cases not been con- n p X p sidered in the Computer Vision literature. d -mean(fR1;:::; Rng) = argmin d(Ri; R) : We consider three main problems: single rotation av- R2SO(3) i=1 eraging, in which a single rotation is computed starting Since SO(3) is compact, a minimum will exist as long as the from several measurements; multiple-rotation averaging, in distance function is continuous (which any sensible distance which absolute orientations are computed from several rel- function is).
    [Show full text]
  • Parsing Images Into Regions, Curves, and Curve Groups
    Submitted to Int’l J. of Computer Vision, October 2003. First Review March 2005. Revised June 2005. Parsing Images into Regions, Curves, and Curve Groups Zhuowen Tu1 and Song-Chun Zhu2 Lab of Neuro Imaging, Department of Neurology1, Departments of Statistics and Computer Science2, University of California, Los Angeles, Los Angeles, CA 90095. emails: {ztu,sczhu}@stat.ucla.edu Abstract In this paper, we present an algorithm for parsing natural images into middle level vision representations – regions, curves, and curve groups (parallel curves and trees). This al- gorithm is targeted for an integrated solution to image segmentation and curve grouping through Bayesian inference. The paper makes the following contributions. (1) It adopts a layered (or 2.1D-sketch) representation integrating both region and curve models which compete to explain an input image. The curve layer occludes the region layer and curves observe a partial order occlusion relation. (2) A Markov chain search scheme Metropolized Gibbs Samplers (MGS) is studied. It consists of several pairs of reversible jumps to tra- verse the complex solution space. An MGS proposes the next state within the jump scope of the current state according to a conditional probability like a Gibbs sampler and then accepts the proposal with a Metropolis-Hastings step. This paper discusses systematic de- sign strategies of devising reversible jumps for a complex inference task. (3) The proposal probability ratios in jumps are factorized into ratios of discriminative probabilities. The latter are computed in a bottom-up process, and they drive the Markov chain dynamics in a data-driven Markov chain Monte Carlo framework.
    [Show full text]
  • Geometry of Curves and Surfaces Notes C J M Speight 2011
    Geometry of Curves and Surfaces Notes c J M Speight 2011 Contact Details Lecturer: Dr. Lamia Alqahtani E-mail [email protected] This note was made by Prof. Martin Speight, School of Mathematics, The University of Leeds, E-mail: [email protected] 0 Why study geometry? Curves and surfaces are all around us in the natural world, and in the built environ- ment. The first step in understanding these structures is to find a mathematically natural way to describe them. That is the primary aim of this course, which will focus particularly on the concept of curvature. As a side effect, you will develop some very useful transferable skills. Key among these is the ability to translate a mathematical system (a set of equations, or formulae, or inequalities) into a visual picture. Your geometric intuition about the picture can then give you useful insight into the original mathematical system. This trick of visualizing mathematical systems can be very powerful and is, unfortunately, not strongly emphasized in the teaching of maths. Example 0 How does the number of solutions of the pair of simultaneous equations xy = 1 x2 + y2 = a2 depend on the constant a > 0? 0 x2 So for a < a0 (in fact, a0 = √2), the system has 0 solutions, for a = a0 it has 2 and for a > a0 it has 4. One could easily verify this by solving the equations explicitly, but the point is that visualizing x the system gave us a very quick (in fact, 1 almost instantaneous) short cut. The above example featured a pair of curves, each associated with an algebraic equation.
    [Show full text]
  • On Geodesic Behavior of Some Special Curves
    S S symmetry Article On Geodesic Behavior of Some Special Curves Savin Trean¸t˘a Department of Applied Mathematics, University Politehnica of Bucharest, 060042 Bucharest, Romania; [email protected] Received: 2 March 2020; Accepted: 17 March 2020; Published: 1 April 2020 Abstract: In this paper, geometric structures on an open subset D ⊆ R2 are investigated such that the graphs associated with the solutions of some special functions to become geodesics. More precisely, we determine the Riemannian metric g such that Bessel (Hermite, harmonic oscillator, Legendre and Chebyshev) ordinary differential equation (ODE) is identified with the geodesic ODEs produced by the Riemannian metric g. The technique is based on the Lagrangian (the energy of the curve) 1 L = k x˙(t) k2, the associated Euler–Lagrange ODEs and their identification with the considered 2 special ODEs. Keywords: auto-parallel curve; geodesic; Euler–Lagrange equations; Lagrangian; special functions MSC: 34A26; 53B15; 53C22 1. Introduction and Preliminaries The concept of connection plays an important role in geometry and, depending on what sort of data one wants to transport along some trajectories, a variety of kinds of connections have been introduced in modern geometry. Crampin et al. [1], in a certain vector bundle, described the construction of a linear connection associated with a second-order differential equation field and, moreover, the corresponding curvature was computed. Ermakov [2] established that linear second-order equations with variable coefficients can be completely integrated only in very rare cases. Further, some aspects of time-dependent second-order differential equations and Berwald-type connections have been studied, with remarkable results, by Sarlet and Mestdag [3].
    [Show full text]
  • Understanding the K-Medians Problem
    Int'l Conf. Scientific Computing | CSC'15 | 219 Understanding the K-Medians Problem Christopher Whelan, Greg Harrell, and Jin Wang Department of Mathematics and Computer Science Valdosta State University, Valdosta, Georgia 31698, USA Abstract - In this study, the general ideas surrounding the 2.1 Benefits over K-Means k-medians problem are discussed. This involves a look into The k-means problem was conceived far before the k- what k-medians attempts to solve and how it goes about medians problem. In fact, k-medians is simply a variant of doing so. We take a look at why k-medians is used as k-means as we know it. Why would k-medians be used, opposed to its k-means counterpart, specifically how its then, instead of a more studied and further refined method robustness enables it to be far more resistant to outliers. of locating k cluster centers? K-medians owes its use to We then discuss the areas of study that are prevalent in the robustness of the median as a statistic [1]. The mean is a realm of the k-medians problem. Finally, we view an measurement that is highly vulnerable to outliers. Even just approach to the problem that has decreased its time one drastic outlier can pull the value of the mean away complexity by instead performing the k-medians algorithm from the majority of the data set, which can be a high on small coresets representative of the data set. concern when operating on very large data sets. The median, on the other hand, is a statistic incredibly resistant Keywords: K-medians; K-means; clustering to outliers, for in order to deter the median away from the bulk of the information, it requires at least 50% of the data to be contaminated [1].
    [Show full text]