DOCSLIB.ORG

On the Geometric Separability of Bichromatic Point Sets

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
On the Geometric Separability of Bichromatic Point Sets ON THE GEOMETRIC SEPARABILITY OF BICHROMATIC POINT SETS by Bogdan Andrei Armaselu APPROVED BY SUPERVISORY COMMITTEE: Ovidiu Daescu, Chair Benjamin Raichel B. Prabhakaran Xiaohu Guo Copyright c 2017 Bogdan Andrei Armaselu All rights reserved I dedicate this dissertation to my family ON THE GEOMETRIC SEPARABILITY OF BICHROMATIC POINT SETS by BOGDAN ANDREI ARMASELU, BS, MS DISSERTATION Presented to the Faculty of The University of Texas at Dallas in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY IN COMPUTER SCIENCE THE UNIVERSITY OF TEXAS AT DALLAS August 2017 ACKNOWLEDGMENTS I would first like to thank my advisor, Dr. Ovidiu Daescu, for helping me towards my goal of completing my PhD, and also for his advice in writing this dissertation. Also, I would like to thank my family and friends for supporting me and making me believe in my dream of earning my PhD. June 2017 v ON THE GEOMETRIC SEPARABILITY OF BICHROMATIC POINT SETS Bogdan Andrei Armaselu, PhD The University of Texas at Dallas, 2017 Supervising Professor: Ovidiu Daescu, Chair Consider two sets of points in the two- or three-dimensional space, namely, a set R of n \red" points and a set B of m \blue" points. A separator of the point sets R and B is a geometric locus enclosing all red points, that contains the fewest possible blue points. In this dissertation, we study the separability of these two point sets using various separators, such as circles, axis-aligned rectangles, or arbitrarily oriented rectangles. If there are an infinity of separators, we consider optimum criteria such as minimizing the radius (for circles) and maximizing the area (for rectangles). We first give an overview of computational geometry and the work related to geometric separability. Then, we study the circular separation problem and present three dynamic data structures that allow insertions and deletions of blue points, as well as reporting an optimal circle after such an insertion or deletion. The first is a unified data structure that supports both insertions and deletions and has near- linear query and update time. The other two data structure have logarithmic query time and near-quadratic update time. One of them allows only insertions and the other supports only deletions of blue points. These are the first algorithms for the dynamic circular separation problem. After that, we introduce the rectangular separation problem and focus on the axis-aligned case (that is, the target rectangle has to be axis-aligned). We prove that the number of optimal solutions can be Ω(m) in the worst case, present an algorithm to find one optimal solution that has near-linear running time, and then prove a matching lower bound vi for finding one optimal solution. We also introduce a number of extensions of the rectangular separation problem. Specifically, we consider the case when a fixed number of blue points are allowed inside the separating rectangle and the case where the blue points are replaced by axis-aligned rectangles. Finally, we conclude by discussing the on-going work and give possible future directions for geometric separability. vii TABLE OF CONTENTS ACKNOWLEDGMENTS . v ABSTRACT . vi LIST OF FIGURES . x LIST OF TABLES . xiv CHAPTER 1 INTRODUCTION . 1 1.1 Related work on geometric separability . 7 1.2 Our contributions . 13 CHAPTER 2 PRELIMINARIES . 15 2.1 Convex hulls . 15 2.2 Voronoi diagrams . 16 2.2.1 Farthest-point Voronoi diagrams . 18 2.3 Monotone matrices . 19 CHAPTER 3 MINIMUM BICHROMATIC SEPARATING CIRCLE PROBLEM . 24 3.1 Introduction . 24 3.1.1 Our results . 26 3.2 Preliminaries . 27 3.3 Unified data structure for insertions and deletions . 29 3.4 Logarithmic query time for insertions . 37 3.5 Logarithmic query time for deletions . 40 3.6 Implementation and Experiments . 42 3.7 Conclusion and future work . 52 CHAPTER 4 MAXIMUM AREA BICHROMATIC SEPARATING RECTANGLE PROBLEM . 53 4.1 Introduction . 53 4.1.1 Related work . 53 4.1.2 Our Results . 58 4.2 Preliminaries . 60 4.3 Finding all optimal solutions . 62 viii 4.4 Finding one optimal solution . 64 4.4.1 Case 1 . 65 4.4.2 Case 2 . 67 4.4.3 Case 3 . 67 4.4.4 Algorithm . 71 4.5 Lower bound . 73 4.6 Conclusion and future work . 75 CHAPTER 5 EXTENSIONS OF THE MAXIMUM SEPARATING RECTANGLE PROBLEM . 77 5.1 Introduction . 77 5.1.1 Related work . 77 5.1.2 Our contributions . 78 5.1.3 Preliminaries . 79 5.2 Blue rectangles version . 80 5.3 Outliers version . 81 5.4 Conclusion and future work . 86 CHAPTER 6 CONCLUSIONS . 87 REFERENCES . 89 BIOGRAPHICAL SKETCH . 96 CURRICULUM VITAE ix LIST OF FIGURES 1.1 A triangulation of a simple polygon is shown. 2 1.2 The closest pair of points from a given planar set are shown linked together. 3 1.3 The Delaunay triangulation of a simple polygon is shown. 3 1.4 An example of a Google map is shown, with marked points of interest such as cities, universities, and (main) road junctions. Between any two points of interest, an edge is shown only if there is a direct route between them (that does not cross other edges). 4 1.5 The graph corresponding to the road network in Figure 1.4 is shown. 4 1.6 Tissue containing tumor cells (marked in red) as well as healthy cells (marked in blue). The smallest circle separating the red cells from the blue cells is computed for surgical or radiational treatment purposes. 5 1.7 An arbitrary separator of a red dataset set and a blue dataset is illustrated, with red points shown in solid dots and blue points shown in empty dots. 6 1.8 A linear SVM classifier between two data sets is shown. The positive instances are denoted by solid red dots and the negative instances are denoted by empty blue dots. 6 1.9 In this digital circuit, components already on the board are marked by blue dots. The goal is to find the largest empty rectangle in order to place a new rectangular component that needs as much space as possible (such as a processor). 6 2.1 The convex hull diagram CH(P ) of a planar point set P is shown. 16 2.2 The Voronoi diagram VD(P ) of a planar point set P is shown. 17 2.3 The farthest-point Voronoi diagram FVD(P ) of a planar point set P is shown in solid lines. The convex hull CH(P ) is shown in dashed lines. 18 2.4 Double-staircase matrix, with the defined region denoted by shading. 21 2.5 Inverse double-staircase matrix, with the defined region denoted by shading. 21 2.6 Rising single-staircase matrix. 22 2.7 Falling single-staircase matrix. 22 3.1 Minimum separating circle of a set R of red points and a set B of blue points. 25 3.2 The farthest-point Voronoi diagram FVD(R) of the red points is shown, along with minimum separating circle C, which is centered at O, and the minimum enclosing circle MEC, centered at OC . Blue point p is inside MEC but not inside C. ....................................... 25 x 3.3 Left: The blue point p displayed as an empty circle is inserted; Right: The blue point p is deleted. In both cases, the old minimum separating circle C and the new minimum separating circle C0 are displayed. 27 3.4 e is an edge of FVD(R) defined by ri; rj 2 R. q 2 e is an enter event point and s 2 e is an exit event point. 28 3.5 The data structure for insertion and deletion. 30 ∗ 3.6 Left: Insertion Case 2: s < qe and s is an exit event point; Right: Insertion Case ∗ 3: qe < s and s is an enter event point. 31 ∗ 3.7 Left: Insertion Case 4: s < qe and s is an enter event point; Right: Insertion ∗ Case 5: qe < s and s is an exit event point. 32 ∗ 3.8 Left: Deletion Case 2: qe < s and s is an exit event point; Right: Deletion Case ∗ 3: s < qe and s is an enter event point. 34 3.9 Left: Deletion Case 4: q < s and s is an enter event point; Right: Deletion Case 5: s < q and s is an exit event point. 35 3.10 The data structure T . ................................ 38 3.11 The Java Applet user interface for computing the minimum separating circle. 43 3.12 An example of output for points specified by user. 44 3.13 An example of output for a random dataset. 44 3.14 User inserts the indicated blue point, and the MBSC is updated dynamically (in this case it stays the same). 45 3.15 User deletes the indicated blue point, and the MBSC is re-computed using the dynamic data structure (in this case it changes). 46 3.16 The running time to compute FVD(R) for n between 10 and 100000. 47 3.17 The running time to compute an MBSC using the static algorithm, for n = 1000 and m between 10 and 1000000. 47 3.18 The running time to compute an MBSC using the static algorithm, for m = 1000 and n between 10 and 100000. 47 3.19 The running time to compute an MBSC after a query, for n = 1000 and m between 10 and 1000000. 48 3.20 The running time to compute an MBSC after a query, for m = 1000 and n between 10 and 100000. 48 3.21 The running time to update the data structure, for n = 1000 and m between 10 and 1000000.
Load more

Recommended publications
  • Approximate Guarding of Monotone and Rectilinear Polygons
    Approximate Guarding of Monotone and Rectilinear Polygons Erik Krohn∗ Bengt J. Nilsson† Abstract We show that vertex guarding a monotone polygon is NP-hard and construct a constant factor approxi- mation algorithm for interior guarding monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the num- ber of vertices of the polygon. If the size of the smallest interior guard cover is OPT for a rectilinear polygon, our algorithm produces a guard set of size O(OPT 2). Computational geometry Art gallery problems Mono- tone polygons Rectilinear polygons Approximation algorithms 1 Introduction The art gallery problem is perhaps the best known problem in computational geometry. It asks for the minimum number of guards to guard a space having obstacles. Originally, the obstacles were considered to be walls mutually connected to form a closed Jordan curve, hence, a simple polygon. Tight bounds for the number of guards necessary and sufficient were found by Chvátal [7] and Fisk [17]. Subsequently, other obstacle spaces, both more general and more restricted than simple polygons have also been considered for guarding problems, most notably, polygons with holes and simple rectilinear polygons [21, 32]. Art gallery problems are motivated by applications such as line-of-sight transmission networks in terrains, such as, signal communications and broadcasting, cellular telephony systems and other telecommunication technologies as well as placement of motion detectors and security cameras. We distinguish between two types of guarding problems in simple polygons. Vertex guarding considers only guards positioned at vertices of the polygon, whereas interior guarding allows the guards to be placed anywhere in the interior of the polygon.
    [Show full text]
  • On Guarding the Vertices of Rectilinear Domains
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Computational Geometry 39 (2008) 219–228 www.elsevier.com/locate/comgeo On guarding the vertices of rectilinear domains Matthew J. Katz ∗,1, Gabriel S. Roisman 2 Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva 84105, Israel Received 26 July 2006; received in revised form 31 January 2007; accepted 11 February 2007 Available online 28 February 2007 Communicated by P. Agarwal Abstract We prove that guarding the vertices of a rectilinear polygon P , whether by guards lying at vertices of P , or by guards lying on the boundary of P , or by guards lying anywhere in P , is NP-hard. For the first two proofs (i.e., vertex guards and boundary guards), we construct a reduction from minimum piercing of 2-intervals. The third proof is somewhat simpler; it is obtained by adapting a known reduction from minimum line cover. We also consider the problem of guarding the vertices of a 1.5D rectilinear terrain. We establish an interesting connec- tion between this problem and the problem of computing a minimum clique cover in chordal graphs. This connection yields a 2-approximation algorithm for the guarding problem. © 2007 Elsevier B.V. All rights reserved. Keywords: Geometric optimization; Guarding; NP-hardness; Approximation algorithms 1. Introduction Problems dealing with visibility coverage are often called art-gallery problems. The “classical” art-gallery problem is to place guards in a polygonal region, such that every point in the region is visible to one (or more) of the guards.
    [Show full text]
  • 30 POLYGONS Joseph O’Rourke, Subhash Suri, and Csaba D
    30 POLYGONS Joseph O'Rourke, Subhash Suri, and Csaba D. T´oth INTRODUCTION Polygons are one of the fundamental building blocks in geometric modeling, and they are used to represent a wide variety of shapes and figures in computer graph- ics, vision, pattern recognition, robotics, and other computational fields. By a polygon we mean a region of the plane enclosed by a simple cycle of straight line segments; a simple cycle means that nonadjacent segments do not intersect and two adjacent segments intersect only at their common endpoint. This chapter de- scribes a collection of results on polygons with both combinatorial and algorithmic flavors. After classifying polygons in the opening section, Section 30.2 looks at sim- ple polygonizations, Section 30.3 covers polygon decomposition, and Section 30.4 polygon intersection. Sections 30.5 addresses polygon containment problems and Section 30.6 touches upon a few miscellaneous problems and results. 30.1 POLYGON CLASSIFICATION Polygons can be classified in several different ways depending on their domain of application. In chip-masking applications, for instance, the most commonly used polygons have their sides parallel to the coordinate axes. GLOSSARY Simple polygon: A closed region of the plane enclosed by a simple cycle of straight line segments. Convex polygon: The line segment joining any two points of the polygon lies within the polygon. Monotone polygon: Any line orthogonal to the direction of monotonicity inter- sects the polygon in a single connected piece. Star-shaped polygon: The entire polygon is visible from some point inside the polygon. Orthogonal polygon: A polygon with sides parallel to the (orthogonal) coordi- nate axes.
    [Show full text]
  • Art Gallery Theorems and Algorithms the International Series of Monographs on Computer Science
    ART GALLERY THEOREMS AND ALGORITHMS THE INTERNATIONAL SERIES OF MONOGRAPHS ON COMPUTER SCIENCE EDITORS John E. Hopcroft, Gordon D. Plotkin, Jacob T. Schwartz Dana S. Scott, Jean Vuillemin 1. J. Vitter and W. C. Chen: Design and Analysis of Coalesced Hashing 2. H. Reichel: Initial Computability, Algebraic Specifications, Partial Algebras 3. J. O'Rourke: Art Gallery Theorems and Algorithms Art Gallery Theorems and Algorithms JOSEPH O'ROURKE Department of Computer Science Johns Hopkins University New York Oxford OXFORD UNIVERSITY PRESS 1987 Oxford University Press Oxford New York Toronto Delhi Bombay Calcutta Madras Karachi Petaling Jaya Singapore Hong Kong Tokyo Nairobi Dar es Salaam Cape Town Melbourne Auckland and associated companies in Beirut Berlin Ibadan Nicosia Copyright © 1987 by Joseph O'Rourke Published by Oxford University Press, Inc., 200 Madison Avenue, New York, New York 10016 Oxford is a registered trademark of Oxford University Press All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior permission of Oxford University Press. Library of Congress Cataloging-in-Publication Data O'Rourke, Joseph. Art gallery theorems and algorithms. (International series of monographs on computer science) Bibliography: p. Includes index. 1. Geometry—Data processing. 2. Combinatorial geometry. I. Title. II. Series. QA447.076 1987 516'.0028'5 86-19262 ISBN 0-19-503965-3 135798642 Printed in the United States of America on acid-free paper To My Students PREFACE This book is a research monograph on a topic that falls under both combinatorial geometry, a branch of mathematics, and computational geometry, a branch of computer science.
    [Show full text]
  • Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons ∗
    Improved Bounds for Beacon-Based Coverage and Routing in Simple Rectilinear Polygons ∗ Sang Won Baey Chan-Su Shinz Antoine Vigneronx September 18, 2021 Abstract We establish tight bounds for beacon-based coverage problems, and improve the bounds for n beacon-based routing problems in simple rectilinear polygons. Specifically, we show that b 6 c beacons are always sufficient and sometimes necessary to cover a simple rectilinear polygon P with n vertices. We also prove tight bounds for the case where P is monotone, and we present an optimal linear-time algorithm that computes the beacon-based kernel of P . For the 3n 4 n routing problem, we show that b 8− c − 1 beacons are always sufficient, and d 4 e − 1 beacons are sometimes necessary to route between all pairs of points in P . 1 Introduction A beacon is a facility or a device that attracts objects within a given domain. We assume that objects in the domain, such as mobile agents or robots, know the exact location or the direction towards an activated beacon in the domain, even if it is not directly visible. More precisely, given a polygonal domain P , a beacon is placed at a fixed point in P . When a beacon b 2 P is activated, an object p 2 P moves along the ray starting at p and towards the beacon b until it either hits the boundary @P of P , or it reaches b. (See Figure 1a.) If p hits an edge e of P , then it continues to move along e in the direction such that the Euclidean distance to b decreases.
    [Show full text]