# A technique for adding range restrictions to. August 30, Abstract. In a generalized searching problem, a set S of n colored geometric objects

Save this PDF as:

Size: px
Start display at page:

Download "A technique for adding range restrictions to. August 30, Abstract. In a generalized searching problem, a set S of n colored geometric objects"

## Transcription

1 A technique for adding range restrictions to generalized searching problems Prosenjit Gupta Ravi Janardan y Michiel Smid z August 30, 1996 Abstract In a generalized searching problem, a set S of n colored geometric objects has to be stored in a data structure, such that for any given query object q, the distinct colors of the objects of S intersected by q can be reported eciently. In this paper, a general technique is presented for adding a range restriction to such a problem. The technique is applied to the problem of querying a set of colored points (resp. fat triangles) with a fat triangle (resp. point). For both problems, a data structure is obtained having size O(n 1+ ) and query time O((log n) 2 + C). Here, C denotes the number of colors reported by the query, and is an arbitrarily small positive constant. Keywords: Computational geometry, data structures, intersection searching, range restriction. 1 Introduction Geometric searching problems arise in a large variety of application areas, such as computer graphics, robotics, VLSI layout design, and databases. In such a problem, a set S of n geometric objects has to be stored in a data structure, such that for any given query object q, we can eciently report all objects of S that intersect q. The eciency of such a data structure is typically expressed by its size and query time, where the latter has the form O(f(n) + K g(n)), for some \small" functions f and g. In this expression, K denotes the number of elements of S that intersect the query object. We call these problems standard searching problems, in order to distinguish them from generalized searching problems, which are the subject of this paper. Max-Planck-Institut fur Informatik, Im Stadtwald, D Saarbrucken, Germany. ydepartment of Computer Science, University of Minnesota, Minneapolis, MN 55455, U.S.A. E- mail: This author was supported by a Grant{in{Aid of Research from the Graduate School of the University of Minnesota. zdepartment of Computer Science, King's College London, Strand, London WC2R 2LS, United Kingdom. Part of this work was done while the author was visiting the Max-Planck-Institut fur Informatik, Saarbrucken. 1

2 In many applications, a more general form of searching problem arises: The objects in S come aggregated in disjoint groups and of interest are questions regarding the intersection of q with the groups rather than with the objects. Here, we say that q intersects a group if and only if it intersects at least one object in the group. We will associate with each group a dierent color and imagine that all the objects in the group have that color. Then, in the generalized searching problem, we want to report the distinct colors of those elements of S that intersect q. Note that the generalized problem reduces to the standard one when each color class has cardinality one. For applications of these generalized searching problems, see [1, 4, 6, 8]. We can solve a generalized searching problem by rst determining the objects of S that intersect q and then reading o the distinct colors. However, the query time can be very high since q could intersect (n) objects but only O(1) distinct colors. For a generalized searching problem, we want to obtain query times that are sensitive to the number C of distinct colors intersected, rather than K. Typically, our goal is to obtain query times of the form O(f(n) + C) or O(f(n) + C g(n)), where f and g are polylogarithmic. Generalized searching problems rst appeared in [6]. Subsequently, several papers were published on these type of problems. See [1, 3, 4, 5, 7, 8]. In this paper, we consider the problem of transforming generalized searching problems into other problems by adding a range restriction. This transformation was introduced for standard searching problems by Bentley [2]. Let PR(q; S) denote the answer to a generalized searching problem PR with query object q and object set S. To add a range restriction to PR, we give each object p in S an additional parameter k p 2 IR. In the transformed searching problem, we only query objects in S that have their parameter in a given range. We dene this more precisely. Denition 1 Let PR(q; S) be a generalized searching problem for a set S of objects with query object q. To add a range restriction, we associate with each object p in S a real number k p. In the transformed generalized searching problem TPR, a query consists of a query object q together with an interval [a; b], and TPR(q; [a; b]; S) := PR(q; fp 2 S : a k p bg): In the case where the range restriction is of the form (?1; b] or [a; 1), we speak about a half-innite range restriction. As an example, consider the d-dimensional generalized orthogonal range searching problem, in which we are given a set S of n colored points in IR d. The query is an axes-parallel d-box q, and we want to report the distinct colors of those points that are contained in q. This problem is obtained by adding a range restriction to the (d? 1)-dimensional generalized range searching problem. As mentioned, the notion of adding a range restriction (for standard problems) rst appeared in Bentley [2]. He gave a general technique that transforms a data structure for solving the standard problem PR into a data structure for the standard problem TPR. Later, other general techniques were developed by Willard and Lueker [11], 2

3 Generalized Problem Space Query Time Reference Querying Points with Fat Triangles n(log n) 3 (log n) 4 + C(log n) 2 [5] n 1+ (log n) 2 + C this paper Querying Fat Triangles with Points n(log n) 2 (log n) 3 + C log n [5] n 1+ (log n) 2 + C [5] n 1+ (log n) 2 + C this paper Table 1: Overview of results for generalized problems on fat triangles. All bounds given are \big{oh". C denotes the output size, and is an arbitrarily small positive constant. Scholten and Overmars [10], van Kreveld [8], and Lenhof and Smid [9]. With the exception of [8], these techniques can be applied to generalized searching problems, but this leads to data structures in which each color may be reported a logarithmic number of times. (That is, using the notation above, we have g(n) = (log n).) The results in [8] provide structures where each color is reported at most a constant number of times. We discuss this in more detail below. The main result of this paper is a general technique that transforms data structures DS and TDS solving the generalized searching problems PR and TPR, respectively, into a data structure TDS 0 solving TPR that uses much less space than TDS does. More precisely, if we start with (i) a data structure DS having O(polylog(n)+C) query time and using O(n 1+ ) space, and (ii) a data structure TDS having O(polylog(n)+C) query time and using (possibly high) polynomial space, and apply the transformation several times, we get a data structure for TPR having O(polylog(n) + C) query time and using only O(n 1+ ) space. Here, is an arbitrarily small positive constant. We remark that in earlier work, van Kreveld presented an alternative approach for obtaining O(n 1+ ) space and O(polylog(n)+C) query time for range-restricted colored problems; see Theorem 5.1(ii), Theorem 5.3(ii), and Corollary 7.3(i) in [8]. His work is based on multiway balanced search trees with secondary structures. Our approach is dierent: we construct TDS 0 iteratively from DS and TDS by using a \bootstrapping" approach, which is interesting in its own right. We illustrate our general technique by giving ecient data structures for the following two problems: Store a set of colored points (resp. fat triangles) in a data structure, such that for any query fat triangle (resp. point) q, we can report the distinct colors of those points (resp. triangles) that are contained in (resp. contain) q. Here, a triangle is called fat, if all its angles are at least equal to some xed constant. This problem was considered before in [5]. See Table 1 for this and our results. Again, some of our results were known already. However, the techniques in this paper allow us to now derive these results in a unied way. The rest of this paper is organized as follows. In Section 2, we give the general technique of adding a range restriction to a generalized searching problem. In Section 3, we show how to apply this technique to generalized problems for fat triangles. We conclude the paper in Section 4 with some nal remarks. We now discuss one important issue that arises in the encoding and handling 3

4 of colors. Throughout the paper, we assume that our algorithms incorporate the mechanisms that we describe here and so we will not repeat them afterwards. The number of colors for a given problem can range from 1 to n. We encode each color as an integer in the range [1; n]. This allows us to use colors as array indices. In many of our generalized searching problems, when answering a query we may encounter the same color more than once (but no more than O(1) times). Our goal is to eliminate the duplicate colors eciently before we output the answer. We can do this by using an array, A[1 : n], of colors to keep track of the distinct colors that are found during a query. We also store the distinct colors found in a linked list. After the query, A can be reset in time proportional to the output size by scanning the list. 2 Adding a half-innite range restriction Let S be a set of n colored objects, and let PR(q; S) be a generalized searching problem for S with query object q. Let each object p of S have an additional parameter k p 2 IR. Let TPR be the generalized searching problem that is obtained by adding a half-innite range restriction to PR. Assume we have a data structure DS that stores the set S, such that generalized queries PR(q; S) can be solved in O((log n) u + C) time, for some positive constant u. Let the size of DS be bounded by O(n 1+ ), where is an arbitrarily small positive constant. Also, assume we have a data structure TDS for the set S, such that generalized queries TPR(q; [a : 1); S) can be solved in O((log n) v + C) time, for some positive constant v. Let the size of TDS be bounded by O(n w ) for some constant w > 1. We will show how to construct a data structure that solves generalized queries TPR(q; [a : 1); S) in O((log n) max(u;v) + C) time, using O((n 1+ ) space, for an arbitrarily small positive constant. The basic transformation: Sort the elements of S in non-increasing order of their parameter k p. Let the sorted set be S = fp 1 ; p 2 ; : : : ; p n g, i.e., k p1 k p2 : : : k pn. Let m be a parameter such that 1 m n. For 0 i < n=m, let and S i = fp 1 ; p 2 ; : : : ; p im g; S 0 i = fp im+1; p im+2 ; :::p (i+1)m g: For each i, 0 i < n=m, we store the set S i in a data structure DS i (of type DS) for solving generalized queries of the form PR(q; S i ). Moreover, we store the set S 0 i in a data structure TDS i (of type TDS) for solving generalized queries of the form TPR(q; [a; 1); S 0 i). Having dened the transformed data structure, we show how to answer generalized queries of the form TPR(q; [a; 1); S). Without loss of generality we may assume that a k p1 and a > k pn ; otherwise, in the former case, the answer is the empty set while in the latter case there is eectively no range-restriction. Find the index i such that k pim a > k p(i+1)m : 4

5 Then, solve the generalized query PR(q; S i ) using the structure DS i, and solve the generalized query TPR(q; [a; 1); S 0 i ) using the structure TDS i. Output the union of the colors reported by these two queries, after having removed duplicate colors. Lemma 1 The basic transformation results in a data structure for the generalized searching problem TPR(q; [a : 1); S) 1. with a query time of O((log n) max(u;v) + C), 2. using O(n 2+ =m + n m w?1 ) space. Proof: To prove the correctness of the query algorithm, observe that all elements p of S n(s i [S 0 i) have a parameter k p that is smaller than a. Hence, these elements certainly do not satisfy the query. Moreover, all elements p of the set S i have a parameter k p that satises the range restriction. It is clear that the query time of the transformed data structure is bounded by O((log n) max(u;v) + C). (Note that each color is reported at most once by the query on DS i and, similarly, by the query on TDS i.) It remains to prove the space bound. The total size of the structures DS i, 0 i < n=m, is bounded by O 0 X 1 (im) A 1+ = O m 1+ (n=m) 1+ (n=m) = O(n 2+ n=m i=0 Similarly, the total size of the structures TDS i is bounded by This completes the proof. O 0 X 1 m A w = O(n m w?1 n=m i=0 Using this lemma, we can prove the main result of this section. Theorem 1 Let DS be a data structure that stores a set S of n colored objects, such that generalized queries PR(q; S) can be solved in O((log n) u + C) time, for some positive constant u. Let the size of DS be bounded by O(n 1+ ), where is an arbitrarily small positive constant. Let TDS be a data structure for the set S, such that generalized queries TPR(q; [a : 1); S) can be solved in O((log n) v + C) time, for some positive constant v. Let the size of TDS be bounded by O(n w ) for some constant w > 1. There exists a data structure that solves generalized queries TPR(q; [a : 1); S) 1. with a query time of O((log n) max(u;v) + C), 2. using O(n 1+ ) space, for an arbitrarily small positive constant. 5

6 Proof: First assume that w > 2, i.e., the data structure TDS uses more than quadratic space. Choosing m = n 1=w in Lemma 1 gives a data structure for solving queries TPR(q; [a : 1); S), with a query time of O((log n) max(u;v) + C), and using space O(n 2+?1=w + n 2?1=w ); which is bounded by O(n 2 ), provided 1=w. Hence, we can assume that the generalized problem TPR can be solved with quadratic space and O((log n) z + C) query time, where z = max(u; v). We will prove by induction that for any positive integer constant  there is a data structure TDS  for the generalized problem TPR, with O((log n) z + C) query time, using O(n 1+1=+ ) space. Choosing  large enough, the space bound becomes O(n 1+2 ). Hence, starting with =2 instead of will complete the proof. For  = 1, the claim has been proved already. So, let  1, and assume the claim holds for . Apply Lemma 1 to the structures DS and TDS , choosing m = n=(+1). This gives a data structure TDS +1 for solving queries TPR(q; [a : 1); S). Straightforward calculations show that TDS +1 has a query time of O((log n) z + C), and uses O(n 1+1=(+1)+ ) space. Theorem 1 implies that in order to solve the generalized problem TPR, it suces to have (i) a data structure for PR with polylogarithmic query time and O(n 1+ ) space, and (ii) a data structure for TPR with polylogarithmic query time and polynomial space. In many applications, the latter data structure is obtained from the following result, which is due to van Kreveld [8] (Corollary 7.3 (ii)). For convenience, we restate the result in [8] in a slightly dierent form. Theorem 2 ([8]) Let S be a set of n colored points in IR d, where d 2 is a constant, and let k be an integer constant. There exists a data structure of size O(n d+ ), such that for any query region q in IR d that is the intersection of at most k halfspaces, we can in O(log n + C) time report the C distinct colors of all points of S that are contained in q. Here is an arbitrarily small positive constant. 3 Generalized query problems for fat triangles Let S be a set of n colored points in the plane. We want to store these points in a data structure, such that generalized fat triangle queries can be solved eciently. In such a query, we are given a fat triangle, and we have to report the distinct colors of all points of S that are contained in the triangle. A triangle is called fat, if all its angles are at least equal to some xed constant. We start by solving a simpler problem. Then, we apply Theorem 1 twice in order to get our result. Let R be a xed ray that starts in the origin. If q is a point in the plane, then R q denotes the ray that is obtained by translating R such that its starting point coincides with q, i.e., R q = R + q. Consider generalized queries of the following form: Given a point q and a ray T starting in q, such that T makes an angle at most with R q. We want to report the distinct colors of those points of S that are contained in the wedge 6

7 dened by T and R q. By Theorem 2, there is a data structure TDS for this wedge problem having O(log n + C) query time and using polynomial space. Let DS be the data structure of [5] for solving the generalized halfplane searching problem with O((log n) 2 + C) query time using O(n log n) space. We show that we obtain the above wedge problem by adding a half-innite range restriction to DS. In a query, we want to report the distinct colors of those points that are, say, below the line through T and, say, above the line through R q. Let  be the line through the origin orthogonal to R. Project all points of S onto . Each point of S gets this projection as the additional parameter. Note that these parameters dene an ordering along  in the natural way. A point of S is above the line through R q if and only if its additional parameter is \larger" than the projection of q onto , where \larger" refers to the ordering along . Hence, among all points that are larger than q's projection, we want the distinct colors of those that are below the line through T. Therefore, applying Theorem 1 to DS and TDS, we get the following result. Lemma 2 Let S be a set of n colored points in the plane, and let R be a xed ray that starts in the origin. There exists a data structure of size O(n 1+ ) such that for any point q and any ray T starting in q, such that T makes an angle at most with R q (i.e., the ray R translated to q), we can report in O((log n) 2 + C) time, all C distinct colors of those points of S that are contained in the wedge dened by T and R q. Here, is an arbitrarily small positive constant. Next, we show how to solve generalized fat wedge queries. In such a query, we are given a wedge whose angle is between and, where is a constant. Choose t = d2=e coordinate systems CS i = (x i ; y i ), all sharing the origin, such that CS i+1 is oset from CS i by an angle. For each i, let DS i be the data structure of Lemma 2 storing the points of S, where we take R = x i. A fat wedge query is solved as follows. Let q be the apex of the query wedge, and let A and B be its bounding rays. Find an index i, such that (x i ) q i.e., x i translated by the vector q is contained in the wedge. Then we query the data structure DS i twice, once with the wedge dened by A and (x i ) q, and once with the wedge dened by B and (x i ) q. We output the union of the colors reported by these two queries, after having removed duplicate colors. This proves: Lemma 3 Let S be a set of n colored points in the plane. There exists a data structure of size O(n 1+ ) such that for any fat query wedge, we can report in O((log n) 2 + C) time, all C distinct colors of those points of S that are contained in it. Here, is an arbitrarily small positive constant. Now we are ready to consider generalized fat triangle queries. Let T be a fat query triangle. We decompose T into two triangles T 1 and T 2 by drawing a vertical line through the middle vertex. Hence, for i = 1; 2, T i has a vertical side, and the vertex opposite to this side has angle at least. We can think of T i as a range-restricted fat-wedge query, where the additional parameter of a point of S is its x-coordinate. Our goal is to get a data structure DS 0 for such a query which uses O(n 1+ ) space and has a query time of O((log n) 2 + C). Given DS 0, we can solve the fat triangle query 7

8 for T by querying DS 0 with T 1 and T 2, and reporting the union of the colors reported by these two queries. Let DS be the data structure of Lemma 3. By Theorem 2, there is a data structure TDS for range-restricted fat-wedge queries having O(log n + C) query time and using polynomial space. Then, Theorem 1 gives the data structure DS 0. This proves the following result. Theorem 3 Let S be a set of n colored points in the plane. There exists a data structure of size O(n 1+ ) such that for any fat query triangle, we can report in O((log n) 2 + C) time, all C distinct colors of those points of S that are contained in it. Here, is an arbitrarily small positive constant. Using basically the same approach, we can solve the generalized searching problem of querying fat triangles with points. We leave the details to the reader. Theorem 4 Let S be a set of n colored fat triangles in the plane. There exists a data structure of size O(n 1+ ) such that for any query point q, we can report in O((log n) 2 + C) time, all C distinct colors of those triangles of S that contained q. Here, is an arbitrarily small positive constant. 4 Concluding remarks We have given a general technique for adding a range restriction to a generalized searching problem. This results in data structures for generalized searching problems on fat triangles having O((log n) 2 + C) query time using O(n 1+ ) space. Our technique can also be used to solve the d-dimensional generalized orthogonal range searching problem with O(log n + C) query time and O(n 1+ ) space. (This was known already, see Corollary 7.3 (i) in [8].) It remains open if this problem can be solved with O(polylog(n) + C) query time and O(n(log n) O(1) n) space for dimensions d 4. (For ecient solutions in dimensions d 3, see [4, 6].) The results of this paper only apply to generalized reporting problems. In a generalized counting problem, we want to report the number of distinct colors of the objects that intersect the query object. Is there a general technique for adding a range restriction to such generalized counting problems? References [1] P.K. Agarwal and M. van Kreveld. Connected component and simple polygon intersection searching. Proceedings 3th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 709, Springer-Verlag, Berlin, 1993, pp. 36{47. [2] J.L. Bentley. Decomposable searching problems. Information Processing Letters 8 (1979), pp. 244{251. 8

9 [3] P. Gupta, R. Janardan, and M. Smid. On intersection searching problems involving curved objects. Proceedings 4th Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 824, Springer-Verlag, Berlin, 1994, pp. 183{194. [4] P. Gupta, R. Janardan, and M. Smid. Further results on generalized intersection searching problems: counting, reporting, and dynamization. Journal of Algorithms 19 (1995), pp. 282{317. [5] P. Gupta, R. Janardan, and M. Smid. Algorithms for generalized halfspace range searching and other intersection searching problems. Computational Geometry: Theory and Applications 5 (1996), pp. 321{340. [6] R. Janardan and M. Lopez. Generalized intersection searching problems. International Journal on Computational Geometry & Applications 3 (1993), pp. 39{69. [7] M. Katz. 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects. Report INRIA, Nr. 2583, [8] M. van Kreveld. New results on data structures in computational geometry. Ph.D. Thesis, Department of Computer Science, University of Utrecht, the Netherlands, [9] H.-P. Lenhof and M. Smid. Using persistent data structures for adding range restrictions to searching problems. RAIRO Theoretical Informatics and Applications 28 (1994), pp. 25{49. [10] H.W. Scholten and M.H. Overmars. General methods for adding range restrictions to decomposable searching problems. Journal of Symbolic Computation 7 (1989), pp. 1{10. [11] D.E. Willard and G.S. Lueker. Adding range restriction capability to dynamic data structures. Journal of the ACM 32 (1985), pp. 597{617. 9

### Computing intersections in a set of line segments: the Bentley-Ottmann algorithm

Computing intersections in a set of line segments: the Bentley-Ottmann algorithm Michiel Smid October 14, 2003 1 Introduction In these notes, we introduce a powerful technique for solving geometric problems.

### Visibility: Finding the Staircase Kernel in Orthogonal Polygons

Visibility: Finding the Staircase Kernel in Orthogonal Polygons 8 Visibility: Finding the Staircase Kernel in Orthogonal Polygons Tzvetalin S. Vassilev, Nipissing University, Canada Stefan Pape, Nipissing

### The Unified Segment Tree and its Application to the Rectangle Intersection Problem

CCCG 2013, Waterloo, Ontario, August 10, 2013 The Unified Segment Tree and its Application to the Rectangle Intersection Problem David P. Wagner Abstract In this paper we introduce a variation on the multidimensional

### would be included in is small: to be exact. Thus with probability1, the same partition n+1 n+1 would be produced regardless of whether p is in the inp

1 Introduction 1.1 Parallel Randomized Algorihtms Using Sampling A fundamental strategy used in designing ecient algorithms is divide-and-conquer, where that input data is partitioned into several subproblems

### 1 The range query problem

CS268: Geometric Algorithms Handout #12 Design and Analysis Original Handout #12 Stanford University Thursday, 19 May 1994 Original Lecture #12: Thursday, May 19, 1994 Topics: Range Searching with Partition

### Lecture 3: Art Gallery Problems and Polygon Triangulation

EECS 396/496: Computational Geometry Fall 2017 Lecture 3: Art Gallery Problems and Polygon Triangulation Lecturer: Huck Bennett In this lecture, we study the problem of guarding an art gallery (specified

### On Computing the Centroid of the Vertices of an Arrangement and Related Problems

On Computing the Centroid of the Vertices of an Arrangement and Related Problems Deepak Ajwani, Saurabh Ray, Raimund Seidel, and Hans Raj Tiwary Max-Planck-Institut für Informatik, Saarbrücken, Germany

### Planar Point Location

C.S. 252 Prof. Roberto Tamassia Computational Geometry Sem. II, 1992 1993 Lecture 04 Date: February 15, 1993 Scribe: John Bazik Planar Point Location 1 Introduction In range searching, a set of values,

### Improved Results on Geometric Hitting Set Problems

Improved Results on Geometric Hitting Set Problems Nabil H. Mustafa nabil@lums.edu.pk Saurabh Ray saurabh@cs.uni-sb.de Abstract We consider the problem of computing minimum geometric hitting sets in which,

### Lecture 15: The subspace topology, Closed sets

Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology

### Max-Planck Institut fur Informatik, Im Stadtwald, Saarbrucken, Germany,

An Approximation Scheme for Bin Packing with Conicts Klaus Jansen 1 Max-Planck Institut fur Informatik, Im Stadtwald, 66 13 Saarbrucken, Germany, email : jansen@mpi-sb.mpg.de Abstract. In this paper we

### On Planar Intersection Graphs with Forbidden Subgraphs

On Planar Intersection Graphs with Forbidden Subgraphs János Pach Micha Sharir June 13, 2006 Abstract Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete

### Geometric Streaming Algorithms with a Sorting Primitive (TR CS )

Geometric Streaming Algorithms with a Sorting Primitive (TR CS-2007-17) Eric Y. Chen School of Computer Science University of Waterloo Waterloo, ON N2L 3G1, Canada, y28chen@cs.uwaterloo.ca Abstract. We

### arxiv: v2 [cs.ds] 9 Apr 2009

Pairing Heaps with Costless Meld arxiv:09034130v2 [csds] 9 Apr 2009 Amr Elmasry Max-Planck Institut für Informatik Saarbrücken, Germany elmasry@mpi-infmpgde Abstract Improving the structure and analysis

### 10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann

10. Line Arrangements Lecture on Monday 2 nd November, 2009 by Michael Homann During the course of this lecture we encountered several situations where it was convenient to assume

### Parameterized Complexity of Independence and Domination on Geometric Graphs

Parameterized Complexity of Independence and Domination on Geometric Graphs Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de

### A Simplied NP-complete MAXSAT Problem. Abstract. It is shown that the MAX2SAT problem is NP-complete even if every variable

A Simplied NP-complete MAXSAT Problem Venkatesh Raman 1, B. Ravikumar 2 and S. Srinivasa Rao 1 1 The Institute of Mathematical Sciences, C. I. T. Campus, Chennai 600 113. India 2 Department of Computer

### The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )

The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)

### The clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )

1 The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)

### all the vertices). between u and v in the subgraph is at most t necessary to endow them with additional properties,

The Visibility Graph Contains a Bounded-Degree Spanner Gautam Das Abstract Given a collection of polygonal obstacles with n vertices on the place, and any t > 1, we present an O(n log n) time algorithm

### Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Abstract We maintain the

### CMSC 754 Computational Geometry 1

CMSC 754 Computational Geometry 1 David M. Mount Department of Computer Science University of Maryland Fall 2005 1 Copyright, David M. Mount, 2005, Dept. of Computer Science, University of Maryland, College

### 6. Concluding Remarks

[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also

### Geometric Unique Set Cover on Unit Disks and Unit Squares

CCCG 2016, Vancouver, British Columbia, August 3 5, 2016 Geometric Unique Set Cover on Unit Disks and Unit Squares Saeed Mehrabi Abstract We study the Unique Set Cover problem on unit disks and unit squares.

### The Geometry of Carpentry and Joinery

The Geometry of Carpentry and Joinery Pat Morin and Jason Morrison School of Computer Science, Carleton University, 115 Colonel By Drive Ottawa, Ontario, CANADA K1S 5B6 Abstract In this paper we propose

### 2 A Plane Sweep Algorithm for Line Segment Intersection

EECS 396/496: Computational Geometry Fall 2017 Lecturer: Huck Bennett Lecture 2: Line Segment Intersection In this lecture, we will study the problem of computing all intersections of a set of line segmentn

### Chordal graphs and the characteristic polynomial

Discrete Mathematics 262 (2003) 211 219 www.elsevier.com/locate/disc Chordal graphs and the characteristic polynomial Elizabeth W. McMahon ;1, Beth A. Shimkus 2, Jessica A. Wolfson 3 Department of Mathematics,

### Approximation Algorithms for the Unit Disk Cover Problem in 2D and 3D

Approximation Algorithms for the Unit Disk Cover Problem in 2D and 3D Ahmad Biniaz Paul Liu Anil Maheshwari Michiel Smid February 12, 2016 Abstract Given a set P of n points in the plane, we consider the

### MATH 890 HOMEWORK 2 DAVID MEREDITH

MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet

### arxiv: v1 [cs.cg] 8 Jan 2018

Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon Eunjin Oh Hee-Kap Ahn arxiv:1801.02292v1 [cs.cg] 8 Jan 2018 Abstract Given a set of sites in a simple polygon, a geodesic Voronoi diagram

### Basic tool: orientation tests

Basic tool: orientation tests Vera Sacristán Computational Geometry Facultat d Informàtica de Barcelona Universitat Politècnica de Catalunya Orientation test in R 2 Given 3 points p,, r in the plane, efficiently

### The problem of minimizing the elimination tree height for general graphs is N P-hard. However, there exist classes of graphs for which the problem can

A Simple Cubic Algorithm for Computing Minimum Height Elimination Trees for Interval Graphs Bengt Aspvall, Pinar Heggernes, Jan Arne Telle Department of Informatics, University of Bergen N{5020 Bergen,

### For a set S of line segments, a separator can be found using duality. Under duality, the segments transform to double wedges, and a separator line tra

Separating and Shattering Long Line Segments? Alon Efrat School of Mathematical Sciences, Tel Aviv University, Tel-Aviv 69982, Israel. Email: alone@cs.tau.ac.il Otfried Schwarzkopf Dept of Computer Science,

### Dominating Set on Bipartite Graphs

Dominating Set on Bipartite Graphs Mathieu Liedloff Abstract Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested

### 1 Variations of the Traveling Salesman Problem

Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,

### Discrete Optimization. Lecture Notes 2

Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The

### Two Upper Bounds for the Erdős Szekeres Number with Conditions

Discrete Comput Geom (2013) 49:183 188 DOI 10.1007/s00454-012-9474-9 Two Upper Bounds for the Erdős Szekeres Number with Conditions Florian Strunk Received: 8 July 2011 / Revised: 2 July 2012 / Accepted:

### Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube

Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long

### An Ecient Approximation Algorithm for the. File Redistribution Scheduling Problem in. Fully Connected Networks. Abstract

An Ecient Approximation Algorithm for the File Redistribution Scheduling Problem in Fully Connected Networks Ravi Varadarajan Pedro I. Rivera-Vega y Abstract We consider the problem of transferring a set

### Geometric Constructions

HISTORY OF MATHEMATICS Spring 2005 Geometric Constructions Notes, activities, assignment; #3 in a series. Note: I m not giving a specific due date for this somewhat vague assignment. The idea is that it

### Rectilinear and Polygonal p-piercing and p-center Problems. Micha Sharir y Emo Welzl z. 1 Introduction. piercing points.

Rectilinear and Polygonal p-piercing and p-center Problems Micha Sharir y Emo Welzl z Abstract We consider the p-piercing problem, in which we are given a collection of regions, and wish to determine whether

### Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1

Edge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling 1 Arnaud Labourel a a LaBRI - Universite Bordeaux 1, France Abstract In 1974, Kundu [4] has shown that triangulated

### On the Max Coloring Problem

On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive

### Superconcentrators of depth 2 and 3; odd levels help (rarely)

Superconcentrators of depth 2 and 3; odd levels help (rarely) Noga Alon Bellcore, Morristown, NJ, 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv

### Range Tree Applications in Computational Geometry

Range Tree Applications in Computational Geometry ANTONIO-GABRIEL STURZU, COSTIN-ANTON BOIANGIU Computer Science Department Politehnica University of Bucharest Splaiul Independentei 313, Sector 6, Bucharest,

### International Journal of Computational Geometry & Applications c World Scientific Publishing Company

International Journal of Computational Geometry & Applications c World Scientific Publishing Company FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS KHALED ELBASSIONI Max-Planck-Institut

### On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments

Electronic Journal of Graph Theory and Applications 3 (2) (2015), 191 196 On the Balanced Case of the Brualdi-Shen Conjecture on 4-Cycle Decompositions of Eulerian Bipartite Tournaments Rafael Del Valle

### Rigidity, connectivity and graph decompositions

First Prev Next Last Rigidity, connectivity and graph decompositions Brigitte Servatius Herman Servatius Worcester Polytechnic Institute Page 1 of 100 First Prev Next Last Page 2 of 100 We say that a framework

### We assume uniform hashing (UH):

We assume uniform hashing (UH): the probe sequence of each key is equally likely to be any of the! permutations of 0,1,, 1 UH generalizes the notion of SUH that produces not just a single number, but a

### Elementary Planar Geometry

Elementary Planar Geometry What is a geometric solid? It is the part of space occupied by a physical object. A geometric solid is separated from the surrounding space by a surface. A part of the surface

### Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem

Orthogonal art galleries with holes: a coloring proof of Aggarwal s Theorem Pawe l Żyliński Institute of Mathematics University of Gdańsk, 8095 Gdańsk, Poland pz@math.univ.gda.pl Submitted: Sep 9, 005;

### Computational Geometry Algorithmische Geometrie

Algorithmische Geometrie Panos Giannopoulos Wolfgang Mulzer Lena Schlipf AG TI SS 2013 !! Register in Campus Management!! Outline What you need to know (before taking this course) What is the course about?

### Conflict-free Covering

CCCG 05, Kingston, Ontario, August 0, 05 Conflict-free Covering Esther M. Arkin Aritra Banik Paz Carmi Gui Citovsky Matthew J. Katz Joseph S. B. Mitchell Marina Simakov Abstract Let P = {C, C,..., C n

### Complexity Results on Graphs with Few Cliques

Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School

### On the null space of a Colin de Verdière matrix

On the null space of a Colin de Verdière matrix László Lovász 1 and Alexander Schrijver 2 Dedicated to the memory of François Jaeger Abstract. Let G = (V, E) be a 3-connected planar graph, with V = {1,...,

### Generalized kernels of polygons under rotation

Generalized kernels of polygons under rotation David Orden 1, Leonidas Palios 2, Carlos Seara 3, and Paweł Żyliński 4 1 Departamento de Física y Matemáticas, Universidad de Alcalá, Spain david.orden@uah.es

### Math 5593 Linear Programming Lecture Notes

Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................

### Approximation Algorithms for Geometric Intersection Graphs

Approximation Algorithms for Geometric Intersection Graphs Subhas C. Nandy (nandysc@isical.ac.in) Advanced Computing and Microelectronics Unit Indian Statistical Institute Kolkata 700108, India. Outline

### Line Graphs and Circulants

Line Graphs and Circulants Jason Brown and Richard Hoshino Department of Mathematics and Statistics Dalhousie University Halifax, Nova Scotia, Canada B3H 3J5 Abstract The line graph of G, denoted L(G),

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

Voronoi Diagrams 4 A city builds a set of post offices, and now needs to determine which houses will be served by which office. It would be wasteful for a postman to go out of their way to make a delivery

### Topic: Local Search: Max-Cut, Facility Location Date: 2/13/2007

CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be

### The External Network Problem

The External Network Problem Jan van den Heuvel and Matthew Johnson CDAM Research Report LSE-CDAM-2004-15 December 2004 Abstract The connectivity of a communications network can often be enhanced if the

### Line Arrangement. Chapter 6

Line Arrangement Chapter 6 Line Arrangement Problem: Given a set L of n lines in the plane, compute their arrangement which is a planar subdivision. Line Arrangements Problem: Given a set L of n lines

### Ramsey s Theorem on Graphs

Ramsey s Theorem on Graphs 1 Introduction Exposition by William Gasarch Imagine that you have 6 people at a party. We assume that, for every pair of them, either THEY KNOW EACH OTHER or NEITHER OF THEM

### Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces

Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: lower and upper bounds on the number of pieces António Leslie Bajuelos 1, Ana Paula Tomás and Fábio Marques 3 1 Dept.

### Lecture Notes: External Interval Tree. 1 External Interval Tree The Static Version

Lecture Notes: External Interval Tree Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk This lecture discusses the stabbing problem. Let I be

### Preferred directions for resolving the non-uniqueness of Delaunay triangulations

Preferred directions for resolving the non-uniqueness of Delaunay triangulations Christopher Dyken and Michael S. Floater Abstract: This note proposes a simple rule to determine a unique triangulation

### Hardness of Subgraph and Supergraph Problems in c-tournaments

Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in

### The Level Ancestor Problem simplied

Theoretical Computer Science 321 (2004) 5 12 www.elsevier.com/locate/tcs The Level Ancestor Problem simplied Michael A. Bender a; ;1, Martn Farach-Colton b;2 a Department of Computer Science, State University

### Heap-on-Top Priority Queues. March Abstract. We introduce the heap-on-top (hot) priority queue data structure that combines the

Heap-on-Top Priority Queues Boris V. Cherkassky Central Economics and Mathematics Institute Krasikova St. 32 117418, Moscow, Russia cher@cemi.msk.su Andrew V. Goldberg NEC Research Institute 4 Independence

### Testing Euclidean Spanners

Testing Euclidean Spanners Frank Hellweg Melanie Schmidt Christian Sohler Department of Computer Science Technical University of Dortmund 44227 Dortmund, Germany Abstract In this paper we develop a property

### 274 Curves on Surfaces, Lecture 5

274 Curves on Surfaces, Lecture 5 Dylan Thurston Notes by Qiaochu Yuan Fall 2012 5 Ideal polygons Previously we discussed three models of the hyperbolic plane: the Poincaré disk, the upper half-plane,

### arxiv: v2 [math.co] 13 Aug 2013

Orthogonality and minimality in the homology of locally finite graphs Reinhard Diestel Julian Pott arxiv:1307.0728v2 [math.co] 13 Aug 2013 August 14, 2013 Abstract Given a finite set E, a subset D E (viewed

### MAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS

MAXIMAL PLANAR SUBGRAPHS OF FIXED GIRTH IN RANDOM GRAPHS MANUEL FERNÁNDEZ, NICHOLAS SIEGER, AND MICHAEL TAIT Abstract. In 99, Bollobás and Frieze showed that the threshold for G n,p to contain a spanning

### A Fast Algorithm for Optimal Alignment between Similar Ordered Trees

Fundamenta Informaticae 56 (2003) 105 120 105 IOS Press A Fast Algorithm for Optimal Alignment between Similar Ordered Trees Jesper Jansson Department of Computer Science Lund University, Box 118 SE-221

### MISCELLANEOUS SHAPES

MISCELLANEOUS SHAPES 4.1. INTRODUCTION Five generic shapes of polygons have been usefully distinguished in the literature: convex, orthogonal, star, spiral, and monotone. 1 Convex polygons obviously do

### The Polygon Exploration Problem II: The Angle Hull

The Polygon Exploration Problem II: The Angle Hull Frank Hoffmann Christian Icking Rolf Klein Klaus Kriegel Abstract Let D be a connected region inside a simple polygon, P. We define the angle hull of

### 5. THE ISOPERIMETRIC PROBLEM

Math 501 - Differential Geometry Herman Gluck March 1, 2012 5. THE ISOPERIMETRIC PROBLEM Theorem. Let C be a simple closed curve in the plane with length L and bounding a region of area A. Then L 2 4 A,

### the application rule M : x:a: B N : A M N : (x:a: B) N and the reduction rule (x: A: B) N! Bfx := Ng. Their algorithm is not fully satisfactory in the

The Semi-Full Closure of Pure Type Systems? Gilles Barthe Institutionen for Datavetenskap, Chalmers Tekniska Hogskola, Goteborg, Sweden Departamento de Informatica, Universidade do Minho, Braga, Portugal

### ON SWELL COLORED COMPLETE GRAPHS

Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains

### Hashing. Yufei Tao. Department of Computer Science and Engineering Chinese University of Hong Kong

Department of Computer Science and Engineering Chinese University of Hong Kong In this lecture, we will revisit the dictionary search problem, where we want to locate an integer v in a set of size n or

### The Cut Locus and the Jordan Curve Theorem

The Cut Locus and the Jordan Curve Theorem Rich Schwartz November 19, 2015 1 Introduction A Jordan curve is a subset of R 2 which is homeomorphic to the circle, S 1. The famous Jordan Curve Theorem says

### On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes

On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes Hans Raj Tiwary hansraj@cs.uni-sb.de FR Informatik Universität des Saarlandes D-66123 Saarbrücken, Germany Tel: +49 681 3023235

### Isometries. 1 Identifying Isometries

Isometries 1 Identifying Isometries 1. Modeling isometries as dynamic maps. 2. GeoGebra files: isoguess1.ggb, isoguess2.ggb, isoguess3.ggb, isoguess4.ggb. 3. Guessing isometries. 4. What can you construct

### Optimization and approximation on systems of geometric objects van Leeuwen, E.J.

UvA-DARE (Digital Academic Repository) Optimization and approximation on systems of geometric objects van Leeuwen, E.J. Link to publication Citation for published version (APA): van Leeuwen, E. J. (2009).

### 11.1 Facility Location

CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Facility Location ctd., Linear Programming Date: October 8, 2007 Today we conclude the discussion of local

### Optimization Problems in Dotted Interval Graphs

Optimization Problems in Dotted Interval Graphs Danny Hermelin hermelin@mpi-inf.mpg.de Julián Mestre mestre@it.usyd.edu.au March 1, 2012 Dror Rawitz rawitz@eng.tau.ac.il Abstract The class of D-dotted

### Crossing Numbers and Parameterized Complexity

Crossing Numbers and Parameterized Complexity MichaelJ.Pelsmajer 1, Marcus Schaefer 2, and Daniel Štefankovič3 1 Illinois Institute of Technology, Chicago, IL 60616, USA pelsmajer@iit.edu 2 DePaul University,

### Nesting points in the sphere. Dan Archdeacon. University of Vermont. Feliu Sagols.

Nesting points in the sphere Dan Archdeacon Dept. of Computer Science University of Vermont Burlington, VT, USA 05405 e-mail: dan.archdeacon@uvm.edu Feliu Sagols Dept. of Computer Science University of

### Approximation algorithms for the bottleneck stretch factor problem

Approximation algorithms for the bottleneck stretch factor problem Giri Narasimhan Michiel Smid December 8, 2000 Abstract The stretch factor of a Euclidean graph is the maximum ratio of the distance in

### CLASSIFICATION OF SURFACES

CLASSIFICATION OF SURFACES JUSTIN HUANG Abstract. We will classify compact, connected surfaces into three classes: the sphere, the connected sum of tori, and the connected sum of projective planes. Contents

### Crown-free highly arc-transitive digraphs

Crown-free highly arc-transitive digraphs Daniela Amato and John K Truss University of Leeds 1. Abstract We construct a family of infinite, non-locally finite highly arc-transitive digraphs which do not

### Reverse Polish notation in constructing the algorithm for polygon triangulation

Reverse Polish notation in constructing the algorithm for polygon triangulation Predrag V. Krtolica, Predrag S. Stanimirović and Rade Stanojević Abstract The reverse Polish notation properties are used

### FACES OF CONVEX SETS

FACES OF CONVEX SETS VERA ROSHCHINA Abstract. We remind the basic definitions of faces of convex sets and their basic properties. For more details see the classic references [1, 2] and [4] for polytopes.

### On the other hand, the main disadvantage of the amortized approach is that it cannot be applied in real-time programs, where the worst-case bound on t

Randomized Meldable Priority Queues Anna Gambin and Adam Malinowski Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, Warszawa 02-097, Poland, faniag,amalg@mimuw.edu.pl Abstract. We present a practical

### All 0-1 Polytopes are. Abstract. We study the facial structure of two important permutation polytopes

All 0-1 Polytopes are Traveling Salesman Polytopes L.J. Billera and A. Sarangarajan y Abstract We study the facial structure of two important permutation polytopes in R n2, the Birkho or assignment polytope