DOCSLIB.ORG

Exact Construction of Minimum-Width Annulus of Disks in the Plane∗

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Exact Construction of Minimum-Width Annulus of Disks in the Plane∗ Exact Construction of Minimum-Width Annulus of Disks in the Plane∗ Ophir Setter† Dan Halperin† Abstract outer and inner circles [15]. Hence, the center of a minimum-width annulus must lie on an intersec- The construction of a minimum-width annulus of a set tion point of the nearest-neighbor and the farthest- of objects in the plane has useful applications in di- neighbor Voronoi diagrams of the points. Using this verse fields, such as tolerancing metrology and facility observation, an algorithm for finding a minimum- location. We present a novel implementation of an al- width annulus of planar points was developed [5, 16]. gorithm for obtaining a minimum-width annulus con- Similar methods were used to solve different vari- taining a given set of disks in the plane, in case one ex- ations of the problem, such as finding a minimum- ists. The algorithm extends previously known meth- width annulus of point sets with different constraints ods for constructing minimum-width annuli of sets on its radii (e.g., fixed inner radius) [3], and finding of points. The algorithm for disks requires the con- a minimum-width annulus bounding a polygon [10]. struction of two Voronoi diagrams of different types, For some special cases there are specific deterministic one of which we call the “farthest-point farthest-site” sub-quadratic algorithms [4, 8, 17]. Voronoi diagram and appears not to have been inves- Agarwal and Sharir introduced the most efficient tigated before. The vertices of the overlay of these (randomized) algorithm to date for constructing a two diagrams are candidates for the annulus’ center. minimum-width annulus of planar points, which The implementation employs an asymptotically near- achieves an expected running time of O(n3/2+ε) [1]. optimal randomized divide-and-conquer algorithm for constructing two-dimensional Voronoi diagrams. Our software utilizes components from Cgal, the Com- 2 Solving the Problem for Disks putational Geometry Algorithms Library, and follows Given a set of objects O in the plane (also called the exact computation paradigm. We do not assume Voronoi sites) and a distance function ρ, the nearest- general position. Namely, we handle degenerate input neighbor Voronoi diagram of O with respect to ρ is and produce exact results. the partition of the plane into maximally connected cells, where each cell consists of points that are closer 1 Introduction to one particular site (or a set of sites) than to any other site. The bisector of two Voronoi sites is the annulus An is the bounded area between two concen- locus of all points that have an equal distance to tric circles. The width of an annulus is the difference both sites. A similar definition is used to define the between the radii of its outer and inner bounding cir- farthest-neighbor Voronoi diagram. cles. Given a set of objects in the plane, the objec- Recall that in the case of point sets, a minimum- tive is to find a minimum-width annulus containing width annulus can be found by overlaying the nearest- those objects. Figure 1(c) shows such an annulus for a neighbor and farthest-neighbor Voronoi diagrams of set of disks. Constructing a minimum-width annulus the points. We show that a similar approach applies has applications in various fields including tolerancing to the case of sets of disks, but the relevant diagrams metrology and facility location [11, 19]. require more careful definitions. A minimum-width annulus does not always exist. Instead of constructing the nearest-neighbor If the width of the set of objects1 is smaller than Voronoi diagram of the points we construct the the width of any containing annulus, then there is additively-weighted Voronoi diagram of the disks, also no minimum-width annulus. known as the Apollonius diagram [14]. In the case of point sets, a minimum-width annu- The Apollonius diagram is the Voronoi diagram de- lus must have (at least) two points on each of its fined for disks with respect to the following distance ∗This work has been supported in part by the Israel Science function ρ. For a point p and a disk D with a center Foundation (grant no. 236/06), by the German-Israeli Foundation c and radius r, we define ρ(p,D)= ||p − c|| − r. The (grant no. 969/07), and by the Hermann Minkowski–Minerva Cen- ter for Geometry at Tel Aviv University. distance between a point outside a disk and the disk †School of Computer Science, Tel-Aviv University, 69978, is the Euclidean distance. Apollonius bisectors, which Israel. {ophirset,danha}@post.tau.ac.il compose the diagram, are branches of hyperbolas. 1The width of a set is defined to be the width of the thinest strip (i.e., the area bounded between two parallel lines) con- Instead of constructing a farthest-neighbor Voronoi taining it. diagram of points we construct a different diagram, 1 which requires the definition of another distance func- 1. |IN | ≥ 3 and |ON | = 1 – the center coincides tion. Consider the following farthest-point distance with a vertex of the Apollonius diagram. 2 2 function from a point p ∈ R to a set of points S ⊂ R : 2. |IN | = 1 and |ON | ≥ 3 – the center coincides with a vertex of the FPFS Voronoi diagram. ρ(p,S) = sup ||p − x||, x∈S 3. |IN | ≥ 2 and |ON | ≥ 2 – the center lies on an intersection point of the Apollonius diagram and which measures the farthest distance from the point p the FPFS Voronoi diagram. to the set S. Consider the farthest-neighbor Voronoi We therefore construct each of the diagrams and over- diagram with respect to this distance function. We lay them. For each vertex of the overlay, we retrieve call this diagram the “farthest-point farthest-site” four relevant disks (either three touching the inner cir- (FPFS) Voronoi diagram. The distance function ρ cle and the one touching the outer circle, in case 1, or becomes the Euclidean distance when the set S con- three touching the outer circle and the one touching sists of a single point. However, this is not the case the inner circle, in case 2, or two pairs of disks touch- when the set S is, say, a disk in the plane. ing respectively the inner and outer circles), and com- The following lemma characterizes the FPFS pute the width of the resulting annulus. We output Voronoi diagram of disks in the plane, showing that the annulus of the smallest width. Figure 1 illustrates the bisectors induced by its sites are hyperbolic arcs. the algorithm for computing a minimum-width annu- lus of a set of disks and a highly degenerate input, which is handled properly by our implementation. Lemma 1 The bisector of two disks in the plane in- The FPFS Voronoi diagram can be defined as a duced by the farthest-point distance function is one farthest site abstract Voronoi diagram [12]. Hence, branch of a hyperbola, and is identical to the Apollo- FPFS Voronoi diagrams are of linear complexity in nius bisector of the disks with swapped radii. the size of the input (as are Apollonius diagrams). Proof. Let (cA, rA), (cB, rB ) be two disks in the plane with respective centers c ,c and radii r , r . A B A B 3 Constructing General Voronoi Diagrams with Their farthest-point distance bisector is the zero set CGAL of the equation ||x − cA|| + rA = ||x − cB|| + rB, which is the same as the zero set of ||x − c || − r = A B As described in Section 2 above, the process of con- x c r || − B||− A. The latter equation describes the Apol- structing a minimum-width annulus bounding a set lonius bisector of (c , r ), (c , r ). A B B A of disks mainly comprises three geometric operations: We now prove that there is a minimum-width an- (i) construction of the Apollonius diagram, (ii) con- nulus (in case one exists) whose center is a vertex of struction of the FPFS Voronoi diagram, and (iii) over- the overlay of the Apollonius diagram and the FPFS lay of the two diagrams. This section describes some Voronoi diagram of the disks. of the software components which our implementa- Let D = {d1,...,dn} be a collection of disks in the tion is based on, their various ramifications on the algorithm, and how they work in synergy to yield an plane, such that for all i, di 6⊆ Sj=6 i dj . For simplicity of exposition, we assume here that n ≥ 3; the case of exact and robust implementation, which can handle n < 3 is simple to handle. Let IN , ON ⊆ D denote input that is not necessarily in general position and the set of disks that touch the inner and outer cir- produce results of arbitrary precision. cles of a bounding annulus N, respectively. We show The connection between Voronoi diagrams and en- that there is a minimum-width annulus whose circles velopes is long-known [6], and yields a useful approach intersect the disks of D in at least 4 points. for constructing various types of Voronoi diagrams. Cgal,2 the Computational Geometry Algorithms Li- Theorem 2 If there is a minimum-width annulus brary, contains a robust and efficient implementation containing D, then there is a minimum-width annulus of a divide-and-conquer algorithm for constructing en- N such that |IN | + |ON |≥ 4. velopes of general surfaces in 3-space [13]. This im- plementation was employed to yield a general frame- We omit the detailed proof in this extended abstract. work for constructing two-dimensional Voronoi dia- Each minimum-width annulus must touch the disks grams [9].
Load more

Recommended publications
  • Simple Infinite Presentations for the Mapping Class Group of a Compact
    SIMPLE INFINITE PRESENTATIONS FOR THE MAPPING CLASS GROUP OF A COMPACT NON-ORIENTABLE SURFACE RYOMA KOBAYASHI Abstract. Omori and the author [6] have given an infinite presentation for the mapping class group of a compact non-orientable surface. In this paper, we give more simple infinite presentations for this group. 1. Introduction For g ≥ 1 and n ≥ 0, we denote by Ng,n the closure of a surface obtained by removing disjoint n disks from a connected sum of g real projective planes, and call this surface a compact non-orientable surface of genus g with n boundary components. We can regard Ng,n as a surface obtained by attaching g M¨obius bands to g boundary components of a sphere with g + n boundary components, as shown in Figure 1. We call these attached M¨obius bands crosscaps. Figure 1. A model of a non-orientable surface Ng,n. The mapping class group M(Ng,n) of Ng,n is defined as the group consisting of isotopy classes of all diffeomorphisms of Ng,n which fix the boundary point- wise. M(N1,0) and M(N1,1) are trivial (see [2]). Finite presentations for M(N2,0), M(N2,1), M(N3,0) and M(N4,0) ware given by [9], [1], [14] and [16] respectively. Paris-Szepietowski [13] gave a finite presentation of M(Ng,n) with Dehn twists and arXiv:2009.02843v1 [math.GT] 7 Sep 2020 crosscap transpositions for g + n > 3 with n ≤ 1. Stukow [15] gave another finite presentation of M(Ng,n) with Dehn twists and one crosscap slide for g + n > 3 with n ≤ 1, applying Tietze transformations for the presentation of M(Ng,n) given in [13].
    [Show full text]
  • Recognizing Surfaces
    RECOGNIZING SURFACES Ivo Nikolov and Alexandru I. Suciu Mathematics Department College of Arts and Sciences Northeastern University Abstract The subject of this poster is the interplay between the topology and the combinatorics of surfaces. The main problem of Topology is to classify spaces up to continuous deformations, known as homeomorphisms. Under certain conditions, topological invariants that capture qualitative and quantitative properties of spaces lead to the enumeration of homeomorphism types. Surfaces are some of the simplest, yet most interesting topological objects. The poster focuses on the main topological invariants of two-dimensional manifolds—orientability, number of boundary components, genus, and Euler characteristic—and how these invariants solve the classification problem for compact surfaces. The poster introduces a Java applet that was written in Fall, 1998 as a class project for a Topology I course. It implements an algorithm that determines the homeomorphism type of a closed surface from a combinatorial description as a polygon with edges identified in pairs. The input for the applet is a string of integers, encoding the edge identifications. The output of the applet consists of three topological invariants that completely classify the resulting surface. Topology of Surfaces Topology is the abstraction of certain geometrical ideas, such as continuity and closeness. Roughly speaking, topol- ogy is the exploration of manifolds, and of the properties that remain invariant under continuous, invertible transforma- tions, known as homeomorphisms. The basic problem is to classify manifolds according to homeomorphism type. In higher dimensions, this is an impossible task, but, in low di- mensions, it can be done. Surfaces are some of the simplest, yet most interesting topological objects.
    [Show full text]
  • Calculus Terminology
    AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential
    [Show full text]
  • THE DISJOINT ANNULUS PROPERTY 1. History And
    THE DISJOINT ANNULUS PROPERTY SAUL SCHLEIMER Abstract. A Heegaard splitting of a closed, orientable three-manifold satis- ¯es the Disjoint Annulus Property if each handlebody contains an essential annulus and these are disjoint. This paper proves that, for a ¯xed three- manifold, all but ¯nitely many splittings have the disjoint annulus property. As a corollary, all but ¯nitely many splittings have distance three or less, as de¯ned by Hempel. 1. History and overview Great e®ort has been spent on the classi¯cation problem for Heegaard splittings of three-manifolds. Haken's lemma [2], that all splittings of a reducible manifold are themselves reducible, could be considered one of the ¯rst results in this direction. Weak reducibility was introduced by Casson and Gordon [1] as a generalization of reducibility. They concluded that a weakly reducible splitting is either itself reducible or the manifold in question contains an incompressible surface. Thomp- son [16] later de¯ned the disjoint curve property as a further generalization of weak reducibility. She deduced that all splittings of a toroidal three-manifold have the disjoint curve property. Hempel [5] generalized these ideas to obtain the distance of a splitting, de¯ned in terms of the curve complex. He then adapted an argument of Kobayashi [9] to produce examples of splittings of arbitrarily large distance. Hartshorn [3], also following the ideas of [9], proved that Hempel's distance is bounded by twice the genus of any incompressible surface embedded in the given manifold. Here we introduce the twin annulus property (TAP) for Heegaard splittings as well as the weaker notion of the disjoint annulus property (DAP).
    [Show full text]
  • Physics 7D Makeup Midterm Solutions
    Physics 7D Makeup Midterm Solutions Problem 1 A hollow, conducting sphere with an outer radius of 0:253 m and an inner radius of 0:194 m has a uniform surface charge density of 6:96 × 10−6 C/m2. A charge of −0:510 µC is now introduced into the cavity inside the sphere. (a) What is the new charge density on the outside of the sphere? (b) Calculate the strength of the electric field just outside the sphere. (c) What is the electric flux through a spherical surface just inside the inner surface of the sphere? Solution (a) Because there is no electric field inside a conductor the sphere must acquire a charge of +0:510 µC on its inner surface. Because there is no net flow of charge onto or off of the conductor this charge must come from the outer surface, so that the total charge of the outer 2 surface is now Qi − 0:510µC = σ(4πrout) − 0:510µC = 5:09µC. Now we divide again by the surface area to obtain the new charge density. 5:09 × 10−6C σ = = 6:32 × 10−6C/m2 (1) new 4π(0:253m)2 (b) The electric field just outside the sphere can be determined by Gauss' law once we determine the total charge on the sphere. We've already accounted for both the initial surface charge and the newly introduced point charge in our expression above, which tells us that −6 Qenc = 5:09 × 10 C. Gauss' law then tells us that Qenc 5 E = 2 = 7:15 × 10 N/C (2) 4π0rout (c) Finally we want to find the electric flux through a spherical surface just inside the sphere's cavity.
    [Show full text]
  • Multivariable Calculus Math 21A
    Multivariable Calculus Math 21a Harvard University Spring 2004 Oliver Knill These are some class notes distributed in a multivariable calculus course tought in Spring 2004. This was a physics flavored section. Some of the pages were developed as complements to the text and lectures in the years 2000-2004. While some of the pages are proofread pretty well over the years, others were written just the night before class. The last lecture was "calculus beyond calculus". Glued with it after that are some notes from "last hours" from previous semesters. Oliver Knill. 5/7/2004 Lecture 1: VECTORS DOT PRODUCT O. Knill, Math21a VECTOR OPERATIONS: The ad- ~u + ~v = ~v + ~u commutativity dition and scalar multiplication of ~u + (~v + w~) = (~u + ~v) + w~ additive associativity HOMEWORK: Section 10.1: 42,60: Section 10.2: 4,16 vectors satisfy "obvious" properties. ~u + ~0 = ~0 + ~u = ~0 null vector There is no need to memorize them. r (s ~v) = (r s) ~v scalar associativity ∗ ∗ ∗ ∗ VECTORS. Two points P1 = (x1; y1), Q = P2 = (x2; y2) in the plane determine a vector ~v = x2 x1; y2 y1 . We write here for multiplication (r + s)~v = ~v(r + s) distributivity in scalar h − − i ∗ It points from P1 to P2 and we can write P1 + ~v = P2. with a scalar but usually, the multi- r(~v + w~) = r~v + rw~ distributivity in vector COORDINATES. Points P in space are in one to one correspondence to vectors pointing from 0 to P . The plication sign is left out. 1 ~v = ~v the one element numbers ~vi in a vector ~v = (v1; v2) are also called components or of the vector.
    [Show full text]
  • Classification of Surfaces
    -8- Classification of Surfaces In Chapters 2–5, we gave a supposedly complete list of symmetry types of repeating patterns on the plane and sphere. Chapters 6–7 justified our method of “counting the cost” of a signature, but we have yet to show that the given signatures are the only possible ones and that the four features we described are the correct features for whichtolook. Anyrepeatingpatterncanbefoldedintoanorbifoldonsome surface. So to prove that our list of possible orbifolds is complete, we only have to show that we’ve considered all possible surfaces. In this chapter we see that any surface can be obtained from a collection of spheres by punching holes that introduce boundaries (∗) and then adding handles (◦) or crosscaps (×). Since all possible sur- faces can be described in this way, we can conclude that all possible orbifolds are obtainable by adding corner points to their boundaries and cone points to their interiors. This will include not only the orbifolds for the spherical and Euclidean patterns we have already considered, but also those for patterns in the hyperbolic plane that we shall consider in Chapter 17. Caps, Crosscaps, Handles, and Cross-Handles Surfaces are often described by identifying some edges of simpler ones. We’ll speak of zipping up zippers. Mathematically, a zipper (“zip-pair”) is a pair of directed edges (these we call zips)thatwe intend to identify. We’ll indicate a pair of such edges with matching arrows: (opposite page) This surface, like all others, is built out of just a few different kinds of pieces— boundaries, handles, and crosscaps.
    [Show full text]
  • Some Definitions: If F Is an Orientable Surface in Orientable 3-Manifold M
    Some definitions: If F is an orientable surface in orientable 3-manifold M, then F has a collar neighborhood F × I ⊂ M. F has two sides. Can push F (or portion of F ) in one direction. M is prime if every separating sphere bounds a ball. M is irreducible if every sphere bounds a ball. M irreducible iff M prime or M =∼ S2 × S1. A disjoint union of 2-spheres, S, is independent if no compo- nent of M − S is homeomorphic to a punctured sphere (S3 - disjoint union of balls). F is properly embedded in M if F ∩ ∂M = ∂F . Two surfaces F1 and F2 are parallel in M if they are disjoint and M −(F1 ∪F2) has a component X of the form X = F1 ×I and ∂X = F1 ∪ F2. A compressing disk for surface F in M 3 is a disk D ⊂ M such that D ∩ F = ∂D and ∂D does not bound a disk in F (∂D is essential in F ). Defn: A surface F 2 ⊂ M 3 without S2 or D2 components is incompressible if for each disk D ⊂ M with D ∩ F = ∂D, there exists a disk D0 ⊂ F with ∂D = ∂D0 1 Defn: A ∂ compressing disk for surface F in M 3 is a disk D ⊂ M such that ∂D = α ∪ β, α = D ∩ F , β = D ∩ ∂M and α is essential in F (i.e., α is not parallel to ∂F or equivalently 6 ∃γ ⊂ ∂F such that α ∪ γ = ∂D0 for some disk D0 ⊂ F . Defn: If F has a ∂ compressing disk, then F is ∂ compress- ible.
    [Show full text]
  • THE PROBLEM of APOLLONIUS H. S. M. Coxeter 1. Introduction. On
    THE PROBLEM OF APOLLONIUS H. S. M. Coxeter 1. Introduction. On behalf of the Canadian Mathematical Congress, I wish to thank the University of Toronto for its hospitality, the members of the Local Arrangements Committee (especially Chandler Davis) for the many comforts and pleasures they have provided, and our nine distinguished visitors for the courses of lectures they gave at our Seminar. Bearing in mind the subject of this afternoon's discussion, I -will try to show by some examples that good old-fashioned elementary geometry is not dead, that mathematics can be interesting without being obscure, and that clever ideas are not restricted to professionals. In the third century B.C., Apollonius of Perga wrote two books on Contacts (e IT afyai.), in which he proposed and solved his famous problem: given three things, each of which may be a point, a line, or a circle, construct a circle which passes through each of the points and touches the given lines and circles. The easy cases are covered in the first book, leaving most of the second for the really interesting case, when all the three "things" are circles. As Sir Thomas Heath remarks [10, p. 182], this problem "has exercised the ingenuity of many- distinguished geometers, including Vieta and Newton". I will not ask you to look at any of their methods for solving it. These are adequately treated in the standard textbooks [e. g. 11, p. 118]. Nor will I inflict on you an enumeration of the possible relations of incidence of the three given circles. This was done with great skill in 1896 by Muirhead [12].
    [Show full text]
  • Rotating Cylinders, Annuli, and Spheres
    Chapter 6 Rotating Cylinders, Annuli, and Spheres Flow over rotating cylinders is important in a wide number of applications from shafts and axles to spinning projectiles. Also considered here is the flow in an annulus formed between two concentric cylinders where one or both of the cylindrical surfaces is or are rotating. As with the rotating flow associated with discs, the proximity of a surface can significantly alter the flow structure. 6.1. INTRODUCTION An indication of the typical flow configurations associated with rotating cylin­ ders and for an annulus with surface rotation is given in Figure 6.1. For the examples given in 6.1a, 6.1c, 6.1e, 6.1g, and 6.1i, a superposed axial flow is possible, resulting typically in a skewed, helical flow structure. This chapter describes the principal flow phenomena, and develops and presents methods to determine parameters such as the drag associated with a rotating cylinder and local flow velocities. Flow for a rotating cylinder is considered in Section 6.2. Laminar flow between two rotating concentric cylinders, known as rotating Couette flow, is considered in Section 6.3. Rota­ tion of annular surfaces can lead to instabilities in the flow and the formation of complex toroidal vortices, known, for certain flow conditions, as Taylor vor­ tices. Taylor vortex flow represents a significant modeling challenge and has been subject to a vast number of scientific studies. The relevance of these to practical applications stems from the requirement to avoid Taylor vortex flow, the requirement to determine or alter fluid residence time in chemical proces­ sing applications, and the desire to understand fluid flow physics and develop and validate fluid flow models.
    [Show full text]
  • Lecture 1: the Euler Characteristic
    Lecture 1: The Euler characteristic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Target Audience: Anyone interested in topological data analysis including graduate students, faculty, industrial researchers in bioinformatics, biology, computer science, cosmology, engineering, imaging, mathematics, neurology, physics, statistics, etc. Isabel K. Darcy Mathematics Department/Applied Mathematical & Computational Sciences University of Iowa http://www.math.uiowa.edu/~idarcy/AppliedTopology.html We wish to count: Example: vertex edge 7 vertices, face 9 edges, 2 faces. 3 vertices, 6 vertices, 3 edges, 9 edges, 1 face. 4 faces. Euler characteristic (simple form): = number of vertices – number of edges + number of faces Or in short-hand, = |V| - |E| + |F| where V = set of vertices E = set of edges F = set of faces & the notation |X| = the number of elements in the set X. 3 vertices, 6 vertices, 3 edges, 9 edges, 1 face. 4 faces. = |V| – |E| + |F| = = |V| – |E| + |F| = 3 – 3 + 1 = 1 6 – 9 + 4 = 1 Note: 3 – 3 + 1 = 1 = 6 – 9 + 4 3 vertices, 6 vertices, 3 edges, 9 edges, 1 face. 4 faces. = |V| – |E| + |F| = = |V| – |E| + |F| = 3 – 3 + 1 = 1 6 – 9 + 4 = 1 Note: 3 – 3 + 1 = 1 = 6 – 9 + 4 3 vertices, 6 vertices, 3 edges, 9 edges, 1 face. 4 faces. = |V| – |E| + |F| = = |V| – |E| + |F| = 3 – 3 + 1 = 1 6 – 9 + 4 = 1 Note: 3 – 3 + 1 = 1 = 6 – 9 + 4 3 vertices, 6 vertices, 3 edges, 9 edges, 1 face.
    [Show full text]
  • Function Theory on the Quantum Annulus Other
    FUNCTION THEORY ON THE QUANTUM ANNULUS AND OTHER DOMAINS A Dissertation Presented to the Faculty of the Department of Mathematics University of Houston In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy By Meghna Mittal August 2010 FUNCTION THEORY ON THE QUANTUM ANNULUS AND OTHER DOMAINS Meghna Mittal APPROVED: Dr. Vern I. Paulsen (Committee Chair) Department of Mathematics, University of Houston Dr. Scott A. McCullough Department of Mathematics, University of Florida Dr. David Blecher Department of Mathematics, University of Houston Dr. Bernhard Bodmann Department of Mathematics, University of Houston Dean, College of Natural Sciences and Mathematics ii Acknowledgements “If I have seen further it is by standing on the shoulders of giants.” — Isaac Newton, Letter to Robert Hooke, February 5, 1675. It would be an understatement if I say I would like to extend my profound thanks to my thesis adviser, Prof. Vern Paulsen, for all his support and guidance throughout my thesis work. I have learned a lot from him, both on the research and non-technical side, and all that will help me in my future. I have great respect for his wide knowledge, logical way of thinking, and his ability to simplify complicated arguments. His patience and support helped me overcome many crisis situations and made this dissertation possible. Next, I would like to thank Professor Scott McCullough, Professor Bernhard Bodmann, and Professor David Blecher for serving on my defense committee, and for their insightful suggestions for improving the presentations of this thesis. I would like to extend sincere thanks to the Chairman of the Mathematics department at the University of Houston, Dr.
    [Show full text]