Geometric Algorithms 7.3 Range Searching

Total Page:16

File Type:pdf, Size:1020Kb

Geometric Algorithms 7.3 Range Searching Geometric search: Overview Types of data. Points, lines, planes, polygons, circles, ... Geometric Algorithms This lecture. Sets of N objects. Geometric problems extend to higher dimensions. ! Good algorithms also extend to higher dimensions. ! Curse of dimensionality. Basic problems. ! Range searching. ! Nearest neighbor. ! Finding intersections of geometric objects. Reference: Chapters 26-27, Algorithms in C, 2nd Edition, Robert Sedgewick. Robert Sedgewick and Kevin Wayne • Copyright © 2005 • http://www.Princeton.EDU/~cos226 2 1D Range Search 7.3 Range Searching Extension to symbol-table ADT with comparable keys. ! Insert key-value pair. ! Search for key k. ! How many records have keys between k1 and k2? ! Iterate over all records with keys between k1 and k2. Application: database queries. insert B B insert D B D insert A A B D insert I A B D I Geometric intuition. insert H A B D H I ! Keys are point on a line. insert F A B D F H I ! How many points in a given interval? insert P A B D F H I P count G to K 2 search G to K H I Robert Sedgewick and Kevin Wayne • Copyright © 2005 • http://www.Princeton.EDU/~cos226 4 1D Range Search Implementations 2D Orthogonal Range Search Range search. How many records have keys between k1 and k2? Extension to symbol-table ADT with 2D keys. ! Insert a 2D key. Ordered array. Slow insert, binary search for k1 and k2 to find range. ! Search for a 2D key. Hash table. No reasonable algorithm (key order lost in hash). ! Range search: find all keys that lie in a 2D range? ! Range count: how many keys lie in a 2D range? BST. In each node x, maintain number of nodes in tree rooted at x. Search for smallest element ! k1 and largest element " k2. Applications: networking, circuit design, databases. Geometric interpretation. insert count range ! Keys are point in the plane. ordered array N log N R + log N ! Find all points in a given h-v rectangle? hash table 1 N N BST log N log N R + log N nodes examined N = # records within interval R = # records that match not touched 5 6 2D Orhtogonal Range Search: Grid Implementation 2D Orthogonal Range Search: Grid Implementation Costs Grid implementation. [Sedgewick 3.18] Space-time tradeoff. 2 ! Divide space into M-by-M grid of squares. ! Space: M + N. 2 ! Create linked list for each square. ! Time: 1 + N / M per grid cell examined on average. ! Use 2D array to directly access relevant square. ! Insert: insert (x, y) into corresponding grid square. Choose grid square size to tune performance. ! Range search: examine only those grid squares that could have ! Too small: wastes space. points in the rectangle. ! Too large: too many points per grid square. ! Rule of thumb: ! N by ! N grid. Time costs. [if points are evenly distributed] RT RT ! Initialize: O(N). ! Insert: O(1). ! Range: O(1) per point in range. LB LB 7 8 Clustering Space Partitioning Trees Grid implementation. Fast, simple solution for well-distributed points. Space partitioning tree. Use a tree to represent the recursive Problem. Clustering is a well-known phenomenon in geometric data. hierarchical subdivision of d-dimensional space. BSP tree. Recursively divide space into two regions. Quadtree. Recursively divide plane into four quadrants. Octree. Recursively divide 3D space into eight octants. kD tree. Recursively divide k-dimensional space into two half-spaces. Applications. Ex: USA map data. ! Ray tracing. ! Flight simulators. ! 80,000 points, 20,000 grid squares. ! N-body simulation. ! Half the grid squares are empty. Grid kD tree ! Collision detection. ! Half the points have ! 10 others in same grid square. ! Astronomical databases. ! Ten percent have ! 100 others in same grid square. ! Adaptive mesh generation. ! Accelerate rendering in Doom. Need data structure that gracefully adapts to data. ! Hidden surface removal and shadow casting. Quadtree BSP tree 9 10 Quad Trees Curse of Dimensionality Quad tree. Recursively partition plane into 4 quadrants. Range search / nearest neighbor in k dimensions? Main application. Multi-dimensional databases. Implementation: 4-way tree. public class QuadTree { Quad quad; 3D space. Octrees: recursively divide 3D space into 8 octants. Value value; QuadTree NW, NE, SW, SE; 100D space. Centrees: recursively divide into 2100 centrants??? } b c a d a h d e f g e f b c g h Good clustering performance is a primary reason to choose quad trees over grid methods. Raytracing with octrees http://graphics.cs.ucdavis.edu/~gregorsk/graphics/275.html 11 12 2D Trees kD Trees 2D tree. Recursively partition plane into 2 halfplanes. kD tree. Recursively partition k-dimensional space into 2 halfspaces. Implementation: BST, but alternate using x and y coordinates as key. Implementation: BST, but cycle through dimensions ala 2D trees. ! Search gives rectangle containing point. ! Insert further subdivides the plane. p level ! i (mod k) p points points whose ith whose ith coordinate coordinate is less than p’s is greater than p’s points points left of p right of p even levels Efficient, simple data structure for processing k-dimensional data. q ! Adapts well to clustered data. ! Adapts well to high dimensional data. points points ! Discovered by an undergrad in an algorithms class! below q above q odd levels 13 14 Summary Basis of many geometric algorithms: search in a planar subdivision. 7.4 Geometric Intersection Voronoi intersecting grid 2D tree diagram lines basis #N h-v lines N points N points #N lines 2D array N-node representation N-node BST ~N-node BST of N lists multilist cells ~N squares N rectangles N polygons ~N triangles search cost 1 log N log N log N cells too use (k-1)D extend to kD? too many cells easy complicated hyperplane 15 Robert Sedgewick and Kevin Wayne • Copyright © 2005 • http://www.Princeton.EDU/~cos226 Geometric Intersection Orthogonal Segment Intersection: Sweep Line Algorithm Problem. Find all intersecting pairs among set of N geometric objects. Sweep vertical line from left to right. Applications. CAD, games, movies, virtual reality. ! Event times: x-coordinates of h-v line segments. ! Left endpoint of h-segment: insert y coordinate into ST. ! Right endpoint of h-segment: remove y coordinate from ST. Simple version: 2D, all objects are horizontal or vertical line segments. ! v-segment: range search for interval of y endpoints. Brute force. Test all $(N2) pairs of line segments for intersection. Sweep line. Efficient solution extends to 3D and general objects. insert y range search delete y 17 18 Orthogonal Segment Intersection: Sweep Line Algorithm Immutable H-V Segment ADT Sweep line: reduces 2D orthogonal segment intersection problem to 1D range searching! public final class SegmentHV implements Comparable<SegmentHV> { Running time of sweep line algorithm. public final int x1, y1; public final int x2, y2; ! Put x-coordinates on a PQ (or sort). O(N log N) N = # line segments ! Insert y-coordinate into ST. O(N log N) R = # intersections public SegmentHV(int x1, int y1, int x2, int y2) public boolean isHorizontal() { … } ! Delete y-coordinate from ST. O(N log N) public boolean isVertical() { … } ! Range search. O(R + N log N) public int compareTo(SegmentHV b) { … } public String toString() { … } } compare by y-coordinate; break ties by x-coordinate Efficiency relies on judicious use of data structures. (x1, y2) (x1, y1) (x2, y1) (x1, y1) horizontal segment vertical segment 19 20 Sweep Line Event Sweep Line Algorithm: Initialize Events // initialize events public class Event implements Comparable<Event> { MinPQ<Event> pq = new MinPQ<Event>(); int time; for (int i = 0; i < N; i++) { SegmentHV segment; if (segments[i].isVertical()) { Event e = new Event(segments[i].x1, segments[i]); public Event(int time, SegmentHV segment) { pq.insert(e); this.time = time; } this.segment = segment; else if (segments[i].isHorizontal()) { } Event e1 = new Event(segments[i].x1, segments[i]); Event e2 = new Event(segments[i].x2, segments[i]); public int compareTo(Event b) { pq.insert(e1); return a.time - b.time; pq.insert(e2); } } } } 21 22 Sweep Line Algorithm: Simulate the Sweep Line General Line Segment Intersection // simulate the sweep line Use horizontal sweep line moving from left to right. int INF = Integer.MAX_VALUE; ! Maintain order of segments that intersect sweep line by y-coordinate. RangeSearch<SegmentHV> st = new RangeSearch<SegmentHV>(); ! Intersections can only occur between adjacent segments. while (!pq.isEmpty()) { ! Add/delete line segment % one new pair of adjacent segments. Event e = pq.delMin(); int sweep = e.time; ! Intersection % two new pairs of adjacent segments. SegmentHV segment = e.segment; if (segment.isVertical()) { SegmentHV seg1, seg2; seg1 = new SegmentHV(-INF, segment.y1, -INF, segment.y1); seg2 = new SegmentHV(+INF, segment.y2, +INF, segment.y2); A Iterable<SegmentHV> list = st.range(seg1, seg2); B for (SegmentHV seg : list) System.out.println(segment + " intersects " + seg); } C else if (sweep == segment.x1) st.add(segment); insert segment else if (sweep == segment.x2) st.remove(segment); D delete segment } A AB ABC ACB ACBD ACD CAD CA A intersection order of segments 23 24 Line Segment Intersection: Implementation Efficient implementation of sweep line algorithm. VLSI Rules Checking ! Maintain PQ of important x-coordinates: endpoints and intersections. ! Maintain ST of segments intersecting sweep line, sorted by y. ! O(R log N + N log N). Implementation issues. ! Degeneracy. ! Floating point precision. ! Use PQ since intersection events aren't known ahead of time. 25 Robert Sedgewick and Kevin Wayne • Copyright © 2005 • http://www.Princeton.EDU/~cos226 Algorithms and Moore's Law Algorithms and Moore's Law Rectangle intersection. Find all intersections among h-v rectangles. "Moore’s Law." Processing power doubles every 18 months. Application. VLSI rules checking in microprocessor design. ! 197x: need to check N rectangles. ! 197(x+1.5): need to check 2N rectangles on a 2x-faster computer.
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]
  • 14 Augmenting Data Structures
    14 Augmenting Data Structures Some engineering situations require no more than a “textbook” data struc- ture—such as a doubly linked list, a hash table, or a binary search tree—but many others require a dash of creativity. Only in rare situations will you need to cre- ate an entirely new type of data structure, though. More often, it will suffice to augment a textbook data structure by storing additional information in it. You can then program new operations for the data structure to support the desired applica- tion. Augmenting a data structure is not always straightforward, however, since the added information must be updated and maintained by the ordinary operations on the data structure. This chapter discusses two data structures that we construct by augmenting red- black trees. Section 14.1 describes a data structure that supports general order- statistic operations on a dynamic set. We can then quickly find the ith smallest number in a set or the rank of a given element in the total ordering of the set. Section 14.2 abstracts the process of augmenting a data structure and provides a theorem that can simplify the process of augmenting red-black trees. Section 14.3 uses this theorem to help design a data structure for maintaining a dynamic set of intervals, such as time intervals. Given a query interval, we can then quickly find an interval in the set that overlaps it. 14.1 Dynamic order statistics Chapter 9 introduced the notion of an order statistic. Specifically, the ith order statistic of a set of n elements, where i 2 f1;2;:::;ng, is simply the element in the set with the ith smallest key.
    [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]
  • 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]
  • Geometric Search
    Geometric Search range search quad- and kD-trees • range search • quad and kd trees intersection search • intersection search VLSI rules checking • VLSI rules check References: Algorithms 2nd edition, Chapter 26-27 Intro to Algs and Data Structs, Section Copyright © 2007 by Robert Sedgewick and Kevin Wayne. 3 Overview 1D Range Search Types of data. Points, lines, planes, polygons, circles, ... Extension to symbol-table ADT with comparable keys. This lecture. Sets of N objects. ! Insert key-value pair. ! Search for key k. ! Geometric problems extend to higher dimensions. How many records have keys between k1 and k2? ! ! Good algorithms also extend to higher dimensions. Iterate over all records with keys between k1 and k2. ! Curse of dimensionality. Application: database queries. Basic problems. ! Range searching. insert B B ! Nearest neighbor. insert D B D insert A A B D ! Finding intersections of geometric objects. Geometric intuition. insert I A B D I ! Keys are point on a line. insert H A B D H I ! How many points in a given interval? insert F A B D F H I insert P A B D F H I P count G to K 2 search G to K H I 2 4 1D Range search: implementations 2D Orthogonal range Ssearch: Grid implementation Range search. How many records have keys between k1 and k2? Grid implementation. [Sedgewick 3.18] ! Divide space into M-by-M grid of squares. ! Ordered array. Slow insert, binary search for k1 and k2 to find range. Create linked list for each square. Hash table. No reasonable algorithm (key order lost in hash).
    [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]
  • Geometric Structures 7 Interval Tree
    Geometric Structures 1. Interval, segment, range trees Martin Samuelčík [email protected], www.sccg.sk/~samuelcik, I4 Window and Point queries • For given points, find all of them that are inside given d-dimensional interval • For given d-dimensional intervals, find all of them that contain one given point • For given d-dimensional intervals, find all of them that have intersection with another d- dimensional interval • d-dimensional interval: interval, rectangle, box, • Example for 1D: – Input: set of n intervals, real value q – Output: k intervals containing value q Geometric Structures 2 Motivation Find all buildings in given rectangle. Geometric Structures 3 Motivation Find building under given point Geometric Structures 4 Motivation Find all points in viewing frustum. Geometric Structures 5 Motivation • Approximation of objects using axis-aligned bounding box (AABB) – used in many fields • Solving problem for AABB and after that solving for objects itself Geometric Structures 6 Interval tree • Binary tree storing intervals • Created for finding intervals containing given value • Input: Set S of closed one-dimensional intervals, real value xq • Output: all intervals I S such that xq I • S = {[li, ri] pre i = 1, …, n} Geometric Structures 7 Node of interval tree • X – value, used to split intervals for node • Ml – ordered set of intervals containing split value X, ascending order of minimal values of intervals • Mr– ordered set of intervals containing split value X, descending order of maximal values of intervals • Pointer to left
    [Show full text]
  • Enhanced Interval Trees for Dynamic IP Router-Tables ∗
    Enhanced Interval Trees for Dynamic IP Router-Tables ∗ Haibin Lu Sartaj Sahni {halu,sahni}@cise.ufl.edu Department of Computer and Information Science and Engineering University of Florida, Gainesville, FL 32611 Abstract We develop an enhanced interval tree data structure that is suitable for the representation of dynamic IP router tables. Several refinements of this enhanced structure are proposed for a variety of IP router tables. For example, the data structure called BOB (binary tree on binary tree) is developed for dynamic router tables in which the rule filters are nonintersecting ranges and in which ties are broken by selecting the highest-priority rule that matches a destination address. Prefix filters are a special case of nonintersecting ranges and the commonly used longest-prefix tie breaker is a special case of the highest-priority tie breaker. When an n-rule router table is represented using BOB, the 2 highest-priority rule that matches a destination address may be found in O(log n) time; a new rule may be inserted and an old one deleted in O(log n) time. For general ranges, the data structure CBOB (compact BOB is proposed). For the case when all rule filters are prefixes, the data structure PBOB (prefix BOB) permits highest-priority matching as well as rule insertion and deletion in O(W ) time, where W is the length of the longest prefix, each. When all rule filters are prefixes and longest-prefix matching is to be done, the data structures LMPBOB (longest matching-prefix BOB) permits longest- prefix matching in O(W ) time; rule insertion and deletion each take O(log n) time.
    [Show full text]
  • The Relational Interval Tree: Manage Interval Data Efficiently in Your Relational Database
    Database and Information Systems Institute for Computer Science University of Munich ______________________________________________________ The Relational Interval Tree: Manage Interval Data Efficiently in Your Relational Database Executive Summary & Technical Presentation June 2000 ______________________________________________________ Professor Hans-Peter Kriegel Institute for Computer Science, University of Munich Oettingenstr. 67, 80538 Munich Germany phone: ++49-89-2178-2191 (-2190) fax: ++49-89-2178-2192 e-mail: [email protected] http: www.dbs.informatik.uni-muenchen.de The Relational Interval Tree1: Manage Interval Data Efficiently in Your Relational Database Executive Summary Modern database applications show a growing demand for efficient and dynamic mana- gement of intervals, particularly for temporal and spatial data or for constraint handling. Common approaches require the augmentation of index structures which, however, is not supported by existing relational database systems. By design, the new Relational Interval Tree1 employs built-in indexes on an as-they-are basis and has a low implementation complexity. The relational database products you are offering already support the efficient integration of the Relational Interval Tree. There- fore, they can be easily provided with a sophisticated interval management that is dedi- cated to meet the demands of todays customers. Key Benefits • General applicability to all kinds of interval domains (e.g., temporal, spatial) • Superior performance to competing interval
    [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]
  • External Memory Geometric Data Structures
    External Memory Geometric Data Structures Lars Arge Department of Computer Science University of Aarhus and Duke University Augues 24, 2005 1 Introduction Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks. In such cases the Input/Output (or I/O) communication between internal and external memory can be- come a major performance bottleneck. Many massive dataset applications involve geometric data (for example points, lines, and polygons) or data that can be interpreted geometrically. Such appli- cations often perform queries that correspond to searching in massive multidimensional geometric databases for objects that satisfy certain spatial constraints. Typical queries include reporting the objects intersecting a query region, reporting the objects containing a query point, and reporting objects near a query point. While development of practically efficient (and ideally also multi-purpose) external memory data structures (or indexes) has always been a main concern in the database community, most data structure research in the algorithms community has focused on worst-case efficient internal memory data structures. Recently however, there has been some cross-fertilization between the two areas. In these lecture notes we discuss some of the recent advances in the development of worst- case efficient external memory geometric data structures. We will focus on fundamental dynamic structures for one- and two-dimensional orthogonal range searching, and try to highlight some of the fundamental techniques used to develop such structures.
    [Show full text]