Line Sweep, Subtree Queries, and Extra Topic in Segment Trees

Total Page:16

File Type:pdf, Size:1020Kb

Line Sweep, Subtree Queries, and Extra Topic in Segment Trees Range Queries Part 3: Line Sweep, Subtree Queries, and Extra Topic in Segment Trees Lucca Siaudzionis and Jack Spalding-Jamieson 2020/02/11 University of British Columbia Announcements • A3 is released. It's due Sunday, March 1st. • You will have all the necessary material background by the end of Thursday, but you will be able to almost all of the questions after today. • Piazza on the due date: we will no longer be responding to Piazza problems on the day of the due-date. • Please start on the assignments earlier. (You have three weeks for the next one!) 1 Project/Written Report • A description and rubric for the project are posted on the course website! • Topics should be approved before Tuesday, March 3rd. There is a list of cool topics on the course website. • You should take a look at some of them today. 2 Rectangles: Problem Description Input: Up to n ≤ 106 axis-aligned rectangles with coordinates in the space −105 ≤ x; y ≤ 105, some of which may overlap. Output: The total area covered by any rectangle. 3 Line Sweep (1) Imagine a giant vertical line sweeping from left to right over the rectangles. 4 Line Sweep (2) Imagine a giant vertical line sweeping from left to right over the rectangles. 5 Line Sweep (3) Imagine a giant vertical line sweeping from left to right over the rectangles. 6 Line Sweep (4) Imagine a giant vertical line sweeping from left to right over the rectangles. 7 Line Sweep (5) Imagine a giant vertical line sweeping from left to right over the rectangles. 8 Line Sweep (6) Imagine a giant vertical line sweeping from left to right over the rectangles. 9 Line Sweep (7) Imagine a giant vertical line sweeping from left to right over the rectangles. 10 Line Sweep Step As we iterate through the x-coordinates, we will have a current set of intersecting rectangles, which are of the form of vertical segments. The total area we see at each step is the total length of our combined segments. How do we actually keep track of which vertical segments we're intersecting with? 11 Line Sweep: Segment Tree Solution We can store our current vertical segments with a (lazy) segment tree! Whenever we encounter a rectangle with top coordinate y and height h, we add 1 to the range [y; y + h]. Whenever we encounter the end of such a rectangle, we remove 1 from the same range. We then use a new operation in our (lazy) segment tree: The total count of non-zero values. • This is very easy to do, but very hard to analyse (we will not be analysing it in class). • Create a RMQ segment tree that also stores the total length at each node, where length is computed to be the width of the node's interval if the minimum value is > 0, and is computed recursively otherwise (sum of answer for sub-segments). • Additionally, do not push the lazy value when querying nodes contained fully within the query interval. 12 Line Sweep with a Segment Tree (1) 13 Line Sweep with a Segment Tree (2) 14 Line Sweep with a Segment Tree (3) 15 Line Sweep with a Segment Tree (4) 2 16 Line Sweep with a Segment Tree (5) 2 17 Line Sweep with a Segment Tree (6) 2 2 1 18 Line Sweep with a Segment Tree (7) 2 2 1 19 Line Sweep with a Segment Tree (8) 2 2 1 1 20 Line Sweep with a Segment Tree (9) 2 2 1 1 21 Line Sweep with a Segment Tree (10) 2 2 2 1 1 22 Line Sweep with a Segment Tree (11) 2 2 2 1 1 23 Line Sweep with a Segment Tree (12) 2 2 2 4 1 1 24 Line Sweep with a Segment Tree (13) 2 2 2 4 1 1 25 Line Sweep with a Segment Tree (14) 2 2 2 2 4 1 1 26 Line Sweep with a Segment Tree (15) 2 2 2 2 4 1 1 27 Line Sweep with a Segment Tree (16) 2 2 2 2 4 1 1 28 Discussion Problem (based on ICPC Pac-NW Regional 2018) Input: Given 1 ≤ n ≤ 106 rectangle coordinates with −105 ≤ x; y ≤ 105. Output: The total amount of area covered by an odd number of rectangles. 1 2 3 2 1 1 1 29 Discussion Problem (based on ICPC Pac-NW Regional 2018) - Insight You can almost run the exact same algorithm, but now your segment tree has to do a different operation: Output the sum of space that is covered by an odd number of intervals. Notice how the update becomes a range xor. 30 Subtree Queries Input: A tree T with 1 ≤ n ≤ 106 nodes, and a value stored at each node, and 1 ≤ q ≤ 105 queries of the following forms: Type A: Add x to a node t and everything in the subtree rooted at t. Type B: What is the sum of all nodes in the subtree rooted at t? 31 Euler Tour: Review Recall Euler tours over trees. 32 Euler Tour: Review 33 Euler Tour: Review 34 Euler Tour: Review 35 Euler Tour: Review 36 Euler Tour: Review 37 Euler Tour: Review 38 Euler Tour: Review 39 Euler Tour: A Single Line This is our final Euler tour. It's only a single line! 40 Euler Tour: Segment 41 Euler Tour: Segment 42 Euler Tour: Segment 43 Euler Tour: Segment 44 Euler Tour: Segment 45 Euler Tour: Segment 46 Euler Tour: Segment 47 Euler Tour: Segment 48 Euler Tour: Segment 49 Euler Tour: Segment 50 Euler Tour: Segment Tree Create a segment tree over the Euler tour segment! Now we can support range queries and range updates on this segment. We want to support subtree queries and updates. Do these translate to segments? Yes! The segment for the subtree rooted at t is exactly the segment [l; r], where l is the first appearance of t in the euler tour, and r is the last appearance. 51 Euler Tour: Subtree Segment 52 Euler Tour: Subtree Segment 53 Euler Tour: Subtree Segment 54 Euler Tour: Subtree Segment 55 Euler Tour: Subtree Segment 56 Euler Tour: Subtree Segment 57 Euler Tour: Subtree Segment 58 Euler Tour: Subtree Segment 59 Euler Tour: Subtree Segment 60 Euler Tour: Subtree Segment 61 Euler Tour: Subtree Segment 62 Euler Tour: Subtree Segment Code 1 // after running, segment tree will be on the range [0,n-1] 2 // subtree queries for subtree root node i will be on the range [l[i],r[i]] 3 void euler(vector<vector<int>>&children, vector<int>&l, vector<int>&r, 4 int i, int&count) { 5 l[i]= count++; 6 for(intc : children[i]) 7 euler(children,l,r,c,count); 8 r[i]= count; 9 } 63 Discussion Problem: LCA (again) Input: A tree with 1 ≤ n ≤ 105 nodes, 1 ≤ q ≤ 105 queries asking for the lowest common ancestor (LCA) of two nodes u; v in the tree. Output: For each query, output the LCA of the two nodes. Can we solve this problem with a segment tree? 64 Discussion Problem: LCA (again) - Insight If we complete the Euler tour as normal (not how it was done in the code from before), then the LCA of u and v is the smallest-depth node appearing in between u and v in the Euler tour (the smallest depth along a segment!). 65 Extra Topic for Segment Trees: Problem Statement Input: An array of size 1 ≤ n ≤ 105, followed by q queries of the following kinds: • Point updates to the array. • Range queries of the form "How many entries are there in the range [l; r] with values in the range [a; b]?". Output: The answer to each query. 66 Extra Topic for Segment Trees: Vectors (1) If we have a sorted list/vector of elements, it's easy to find how many entries are in the corresponding range: Use binary search to find each endpoint of the range! [a; b] = [4; 10] 4 6 7 7 9 11 15 17 This takes O(log n). In order to support updates, we need to use an order statistics tree (or a treap) instead of a vector. 67 Extra Topic for Segment Trees: Vectors (2) If we have k sorted lists/vectors, we can repeat this process to find the total count in each range for a total of O(k log n) time. Inside each node of a segment tree, we can store the sorted vector of elements in the range of the node: 4 6 7 7 9 11 15 17 4 6 7 11 7 9 15 17 4 7 6 11 7 15 9 17 7 4 6 11 7 15 17 9 This table also gives us the amount of space this segment tree takes up: O(n log n). 68 Extra Topic for Segment Trees: Vectors (3) Given this table, we need only find the disjoint set of segments that correspond to our solution. This is done with standard querying for segment trees. There are O(log n) = k such segments, so the overall complexity of our solution is O(n log2 n) 69 Extra Topic for Segment Trees: Demo (1) 4 6 7 7 9 11 15 17 4 6 7 11 7 9 15 17 4 7 6 11 7 15 9 17 7 4 6 11 7 15 17 9 70 Extra Topic for Segment Trees: Demo (2) 4 6 7 11 7 9 15 17 4 7 6 11 7 15 9 17 7 4 6 11 7 15 17 9 71 Extra Topic for Segment Trees: Demo (3) 7 9 15 17 4 7 6 11 7 15 9 17 7 4 6 11 7 15 17 9 72 Extra Topic for Segment Trees: Demo (4) 7 9 15 17 6 11 7 15 9 17 7 4 6 11 7 15 17 9 73 Extra Topic for Segment Trees: Demo (5) 7 9 15 17 6 11 4 74 Extra Topic for Segment Trees: Demo (6) 4 6 11 7 9 15 17 75 Extra Topic for Segment Trees: Demo (7) 4 [a; b] = [8; 16] 6 11 7 9 15 17 76 Extra Topic for Segment Trees: Demo (8) 8 16 0 4 [a; b] = [8; 16] 6 11 7 9 15 17 77 Extra Topic for Segment Trees: Demo (9) 8 16 0 4 [a; b] = [8; 16] 8 16 1 6 11 7 9 15 17 78 Extra Topic for Segment Trees: Demo (10) 8 16 0 4 [a; b] = [8; 16] 8 16 1 6 11 Answer: 3 8 16 2 7 9 15 17 79 Segment Trees: Conclusion Segment trees are wonderful and simple data structures that can be used for all kinds of range query problems.
Recommended publications
  • Interval Trees Storing and Searching Intervals
    Interval Trees Storing and Searching Intervals • Instead of points, suppose you want to keep track of axis-aligned segments: • Range queries: return all segments that have any part of them inside the rectangle. • Motivation: wiring diagrams, genes on genomes Simpler Problem: 1-d intervals • Segments with at least one endpoint in the rectangle can be found by building a 2d range tree on the 2n endpoints. - Keep pointer from each endpoint stored in tree to the segments - Mark segments as you output them, so that you don’t output contained segments twice. • Segments with no endpoints in range are the harder part. - Consider just horizontal segments - They must cross a vertical side of the region - Leads to subproblem: Given a vertical line, find segments that it crosses. - (y-coords become irrelevant for this subproblem) Interval Trees query line interval Recursively build tree on interval set S as follows: Sort the 2n endpoints Let xmid be the median point Store intervals that cross xmid in node N intervals that are intervals that are completely to the completely to the left of xmid in Nleft right of xmid in Nright Another view of interval trees x Interval Trees, continued • Will be approximately balanced because by choosing the median, we split the set of end points up in half each time - Depth is O(log n) • Have to store xmid with each node • Uses O(n) storage - each interval stored once, plus - fewer than n nodes (each node contains at least one interval) • Can be built in O(n log n) time. • Can be searched in O(log n + k) time [k = #
    [Show full text]
  • Advanced Data Structures
    Advanced Data Structures PETER BRASS City College of New York CAMBRIDGE UNIVERSITY PRESS Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, São Paulo Cambridge University Press The Edinburgh Building, Cambridge CB2 8RU, UK Published in the United States of America by Cambridge University Press, New York www.cambridge.org Information on this title: www.cambridge.org/9780521880374 © Peter Brass 2008 This publication is in copyright. Subject to statutory exception and to the provision of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published in print format 2008 ISBN-13 978-0-511-43685-7 eBook (EBL) ISBN-13 978-0-521-88037-4 hardback Cambridge University Press has no responsibility for the persistence or accuracy of urls for external or third-party internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate. Contents Preface page xi 1 Elementary Structures 1 1.1 Stack 1 1.2 Queue 8 1.3 Double-Ended Queue 16 1.4 Dynamical Allocation of Nodes 16 1.5 Shadow Copies of Array-Based Structures 18 2 Search Trees 23 2.1 Two Models of Search Trees 23 2.2 General Properties and Transformations 26 2.3 Height of a Search Tree 29 2.4 Basic Find, Insert, and Delete 31 2.5ReturningfromLeaftoRoot35 2.6 Dealing with Nonunique Keys 37 2.7 Queries for the Keys in an Interval 38 2.8 Building Optimal Search Trees 40 2.9 Converting Trees into Lists 47 2.10
    [Show full text]
  • Search Trees
    Lecture III Page 1 “Trees are the earth’s endless effort to speak to the listening heaven.” – Rabindranath Tagore, Fireflies, 1928 Alice was walking beside the White Knight in Looking Glass Land. ”You are sad.” the Knight said in an anxious tone: ”let me sing you a song to comfort you.” ”Is it very long?” Alice asked, for she had heard a good deal of poetry that day. ”It’s long.” said the Knight, ”but it’s very, very beautiful. Everybody that hears me sing it - either it brings tears to their eyes, or else -” ”Or else what?” said Alice, for the Knight had made a sudden pause. ”Or else it doesn’t, you know. The name of the song is called ’Haddocks’ Eyes.’” ”Oh, that’s the name of the song, is it?” Alice said, trying to feel interested. ”No, you don’t understand,” the Knight said, looking a little vexed. ”That’s what the name is called. The name really is ’The Aged, Aged Man.’” ”Then I ought to have said ’That’s what the song is called’?” Alice corrected herself. ”No you oughtn’t: that’s another thing. The song is called ’Ways and Means’ but that’s only what it’s called, you know!” ”Well, what is the song then?” said Alice, who was by this time completely bewildered. ”I was coming to that,” the Knight said. ”The song really is ’A-sitting On a Gate’: and the tune’s my own invention.” So saying, he stopped his horse and let the reins fall on its neck: then slowly beating time with one hand, and with a faint smile lighting up his gentle, foolish face, he began..
    [Show full text]
  • 2 Dynamization
    6.851: Advanced Data Structures Spring 2010 Lecture 4 — February 11, 2010 Prof. Andr´eSchulz Scribe: Peter Caday 1 Overview In the previous lecture, we studied range trees and kd-trees, two structures which support efficient orthogonal range queries on a set of points. In this second of four lectures on geometric data structures, we will tie up a loose end from the last lecture — handling insertions and deletions. The main topic, however, will be two new structures addressing the vertical line stabbing problem: interval trees and segment trees. We will conclude with an application of vertical line stabbing to a windowing problem. 2 Dynamization In our previous discussion of range trees, we assumed that the point set was static. On the other hand, we may be interested in supporting insertions and deletions as time progresses. Unfortunately, it is not trivial to modify our data structures to handle this dynamic scenario. We can, however, dynamize them using general techniques; the techniques and their application here are due to Overmars [1]. Idea. Overmars’ dynamization is based on the idea of decomposable searches. A search (X,q) for the value q among the keys X is decomposable if the search result can be obtained in O(1) time from the results of searching (X1,q) and (X2,q), where X1 ∪ X2 = X. For instance, in the 2D kd-tree, the root node splits R2 into two halves. If we want to search for all points lying in a rectangle q, we may do this by combining the results of searching for q in each half.
    [Show full text]
  • Lecture Notes of CSCI5610 Advanced Data Structures
    Lecture Notes of CSCI5610 Advanced Data Structures Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong July 17, 2020 Contents 1 Course Overview and Computation Models 4 2 The Binary Search Tree and the 2-3 Tree 7 2.1 The binary search tree . .7 2.2 The 2-3 tree . .9 2.3 Remarks . 13 3 Structures for Intervals 15 3.1 The interval tree . 15 3.2 The segment tree . 17 3.3 Remarks . 18 4 Structures for Points 20 4.1 The kd-tree . 20 4.2 A bootstrapping lemma . 22 4.3 The priority search tree . 24 4.4 The range tree . 27 4.5 Another range tree with better query time . 29 4.6 Pointer-machine structures . 30 4.7 Remarks . 31 5 Logarithmic Method and Global Rebuilding 33 5.1 Amortized update cost . 33 5.2 Decomposable problems . 34 5.3 The logarithmic method . 34 5.4 Fully dynamic kd-trees with global rebuilding . 37 5.5 Remarks . 39 6 Weight Balancing 41 6.1 BB[α]-trees . 41 6.2 Insertion . 42 6.3 Deletion . 42 6.4 Amortized analysis . 42 6.5 Dynamization with weight balancing . 43 6.6 Remarks . 44 1 CONTENTS 2 7 Partial Persistence 47 7.1 The potential method . 47 7.2 Partially persistent BST . 48 7.3 General pointer-machine structures . 52 7.4 Remarks . 52 8 Dynamic Perfect Hashing 54 8.1 Two random graph results . 54 8.2 Cuckoo hashing . 55 8.3 Analysis . 58 8.4 Remarks . 59 9 Binomial and Fibonacci Heaps 61 9.1 The binomial heap .
    [Show full text]
  • Buffer Trees
    Buffer Trees Lars Arge. The Buffer Tree: A New Technique for Optimal I/O Algorithms. In Proceedings of Fourth Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science Vol. 955, Springer-Verlag, 1995, 334-345. 1 Computational Geometry 2 Pairwise Rectangle Intersection A Input N rectangles B D Output all R pairwise intersections F E Example (A; B) (B; C) (B; F ) (D; E) (D; F ) C Intersection Types Intersection Identified by: : : A B Orthogonal Line Segment Intersection on 4N rectangle sides D E Batched Range Searching on N rectangles and N upper-left corners Algorithm Orthogonal Line Segment Intersection + Batched Range Searching + Duplicate removal 3 Orthogonal Line Segment Intersection Input N segments, vertical and horizontal Output all R intersections Sweepline Algorithm Sort all endpoints w.r.t. x-coordinate • Sweep left-to-right with a range tree T y4 • storing the y-coordinates of horizontal segments intersecting the sweepline y3 Left endpoint insertion into T y • ) 2 Right endpoint deletion from T y • ) 1 Vertical segment [y ; y ] • 1 2 ) sweepline report T [y ; y ] \ 1 2 Total (internal) time O(N log N + R) · 2 4 Range Trees Create Create empty structure Insert(x) Insert element x Delete(x) Delete the inserted element x Report(x1; x2) Report all x [x1; x2] 2 x1 x2 Binary search trees B-trees (internal) (# I/Os) Updates O(log2 N) O(logB N) R Report O(log2 N + R) O(logB N + B ) Orthogonal Line Segment Intersection using B-trees O(Sort(N) + N log N + R ) I/Os : : : · B B 5 Batched Range Searching Input N rectangles and points Output all R (r; p) where point p is within rectangle r Sweepline Algorithm Sort all points and left/right rectangle • sides w.r.t.
    [Show full text]
  • Efficient Data Structures for Range Searching on a Grid MARK H
    JOURNAL OF ALGORITHMS 9,254-275 (1988) Efficient Data Structures for Range Searching on a Grid MARK H. OVERMARS Department of Computer Science, University of Utrecht, The Netherlands Received February 17,1987; accepted May 15.1987 We consider the 2-dimensional range searching problem in the case where all points lie on an integer grid. A new data structure is presented that solves range queries on a U * U grid in O( k + log log U) time using O( n log n) storage, where n is the number of points and k the number of reported answers. Although the query time is very good the preprocessing time of this method is very high. A second data structure is presented that can be built in time O( n log n) at the cost of an increase in query time to O(k + m). Similar techniques are used for solving the line segment intersection searching problem in a set of axis-parallel line segments on a grid. The methods presented also yield efficient structures for dominance searching and searching with half-infinite ranges that use only O(n) storage. A generalization to multi-dimensional space, using a normalization approach, yields a static solution to the general range searching problem that is better than any known solution when the dimension is at least 3. Q 1988 Academic Press, Inc. 1. INTRODUCTION One of the problems in computational geometry that has received a large amount of attention is the range searching problem. Given a set of n points in a d-dimensional space, the range searching problem asks to store these points such that for a given range ([A, * .
    [Show full text]
  • Algorithms for Packet Classification Pankaj Gupta and Nick Mckeown, Stanford University
    Algorithms for Packet Classification Pankaj Gupta and Nick McKeown, Stanford University Abstract The process of categorizing packets into “flows” in an Internet router is called packet classification. All packets belonging to the same flow obey a predefined rule and are processed in a similar manner by the router. For example, all packets with the same source and destination IP addresses may be defined to form a flow. Packet classification is needed for non-best-effort services, such as firewalls and quality of service; services that require the capability to distinguish and isolate traffic in differ- ent flows for suitable processing. In general, packet classification on multiple fields is a difficult problem. Hence, researchers have proposed a variety of algorithms which, broadly speaking, can be categorized as basic search algorithms, geometric algorithms, heuristic algorithms, or hardware-specific search algorithms. In this tutorial we describe algorithms that are representative of each category, and discuss which type of algorithm might be suitable for different applications. ntil recently, Internet routers provided only best- Table 2 shows the flows into which an incoming packet effort service, servicing packets in a first-come- must be classified by the router at interface X. Note that the first-served manner. Routers are now called on to flows specified may or may not be mutually exclusive. For provide different qualities of service to different example, the first and second flow in Table 2 overlap. This is Uapplications, which means routers need new mechanisms common in practice, and when no explicit priorities are speci- such as admission control, resource reservation, per-flow fied, we follow the convention that rules closer to the top of queuing, and fair scheduling.
    [Show full text]
  • Lecture Range Searching II: Windowing Queries
    Computational Geometry · Lecture Range Searching II: Windowing Queries INSTITUT FUR¨ THEORETISCHE INFORMATIK · FAKULTAT¨ FUR¨ INFORMATIK Tamara Mchedlidze · Darren Strash 23.11.2015 1 Dr. Tamara Mchedlidze · Dr. Darren Strash · Computational Geometry Lecture Range Searching II Object types in range queries y0 y x x0 Setting so far: Input: set of points P (here P ⊂ R2) Output: all points in P \ [x; x0] × [y; y0] Data structures: kd-trees or range trees 2 Dr. Tamara Mchedlidze · Dr. Darren Strash · Computational Geometry Lecture Range Searching II Object types in range queries y0 y0 y x x0 y x x0 Setting so far: Further variant Input: set of points P Input: set of line segments S (here P ⊂ R2) (here in R2) Output: all points in Output: all segments in P \ [x; x0] × [y; y0] S \ [x; x0] × [y; y0] Data structures: kd-trees Data structures: ? or range trees 2 Dr. Tamara Mchedlidze · Dr. Darren Strash · Computational Geometry Lecture Range Searching II Axis-parallel line segments special case (e.g., in VLSI design): all line segments are axis-parallel 3 Dr. Tamara Mchedlidze · Dr. Darren Strash · Computational Geometry Lecture Range Searching II Axis-parallel line segments special case (e.g., in VLSI design): all line segments are axis-parallel Problem: Given n vertical and horizontal line segments and an axis-parallel rectangle R = [x; x0] × [y; y0], find all line segments that intersect R. 3 Dr. Tamara Mchedlidze · Dr. Darren Strash · Computational Geometry Lecture Range Searching II Axis-parallel line segments special case (e.g., in VLSI design): all line segments are axis-parallel Problem: Given n vertical and horizontal line segments and an axis-parallel rectangle R = [x; x0] × [y; y0], find all line segments that intersect R.
    [Show full text]
  • Segment Tree
    CS 5199 – Competition Programming and Problem Solving Seminar Segment Tree Raunak Kumar Based on slides by Paul Liu, Kuba Karpierz, Bruno Vacherot, Raunak Kumar and Jason Chiu for CPSC 490 – Problem Solving in Computer Science at The University of British Columbia 2019/10/07 Cornell University • Additionally, allow insertion/deletion of elements. • Solution: use a different data structure, like a binary search tree. We have a collection of elements and we would like to support some operations on these elements. ) Often, the solution is to use specialized data structures. Data Structures You are given an array A of n integers. We want to support the following operations • Print the array in sorted order. • Solution: Just sort the array and print it. 1 We have a collection of elements and we would like to support some operations on these elements. ) Often, the solution is to use specialized data structures. Data Structures You are given an array A of n integers. We want to support the following operations • Print the array in sorted order. • Solution: Just sort the array and print it. • Additionally, allow insertion/deletion of elements. • Solution: use a different data structure, like a binary search tree. 1 Data Structures You are given an array A of n integers. We want to support the following operations • Print the array in sorted order. • Solution: Just sort the array and print it. • Additionally, allow insertion/deletion of elements. • Solution: use a different data structure, like a binary search tree. We have a collection of elements and we would like to support some operations on these elements.
    [Show full text]
  • Multidimensional Segment Trees Can Do Range Updates in Poly-Logarithmic Time
    Multidimensional segment trees can do range updates in poly-logarithmic time Nabil Ibtehaz1, M. Kaykobad1, and M. Sohel Rahman1,* [email protected] , fkaykobad,[email protected] 1Department of CSE, BUET, ECE Building, West Palasi, Dhaka-1205, Bangladesh *Corresponding author December 8, 2020 Abstract Updating and querying on a range is a classical algorithmic problem with a multitude of applications. The Segment Tree data structure is particularly notable in handling the range query and update operations. A Segment Tree divides the range into disjoint segments and merges them together to perform range queries and range updates elegantly. Although this data structure is remarkably potent for 1- dimensional problems, it falls short in higher dimensions. Lazy Propagation enables the operations to be computed in O(logn) time in a single dimension. However, the concept of lazy propagation could not be translated to higher-dimensional cases, which imposes a time complexity of O(nk−1 logn) for operations on k-dimensional data. In this work, we have made an attempt to emulate the idea of lazy propagation differently so that it can be applied for 2-dimensional cases. Moreover, the proposed modification should be capable of performing most general aggregate functions similar to the original Segment Tree, and can also be extended to even higher dimensions. Our proposed algorithm manages to perform range sum queries and updates in O(log2 n) time for a 2-dimensional problem, which becomes O(logd n) for a d-dimensional situation. arXiv:1811.01226v2 [cs.DS] 6 Dec 2020 Index terms| Dynamic range query, Lazy Propagation, Multidimensional data, Range sum query, Segment Tree, Tree data structures 1 1 Introduction Range queries appear frequently in different problems in Computer Science.
    [Show full text]
  • Lecture 15: Windowing Queries
    Motivation Segment trees Windowing again Windowing queries Computational Geometry Lecture 15: Windowing queries Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Windowing Zoom in; re-center and zoom in; select by outlining Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Windowing Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Windowing Given a set of n axis-parallel line segments, preprocess them into a data structure so that the ones that intersect a query rectangle can be reported efficiently Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Windowing Given a set of n arbitrary, non-crossing line segments, preprocess them into a data structure so that the ones that intersect a query rectangle can be reported efficiently Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Windowing Two cases of intersection: An endpoint lies inside the query window; solve with range trees The segment intersects a side of the query window; solve how? Computational Geometry Lecture 15: Windowing queries Motivation Segment trees Windowing queries Windowing again Using a bounding box? If the query window intersects the line segment, then it also intersects the bounding box of the line segment (whose sides are axis-parallel segments) So we could search
    [Show full text]