Bichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time
نویسندگان
چکیده
We give an algorithm for bichromatic line segment intersection counting that runs in O(n √ log n) time under the word RAM model via a reduction to dynamic predecessor search, offline point location, and offline dynamic ranking. This algorithm is the first to solve bichromatic line segment intersection counting in o(n log n) time.
منابع مشابه
Scalable Algorithms for Bichromatic Line Segment Intersection Problems on Coarse Grained Multicomputers
We present output-sensitive scalable parallel algorithms for bichromatic line segment intersection problems for the coarse grained multicomputer model. Under the assumption that n p 2 , where n is the number of line segments and p the number of processors, we obtain an intersection counting algorithm with a time complexity of O(n log n log p p + T s (n log p; p)), where T s (m; p) is the time u...
متن کاملSpace-efficient geometric divide-and-conquer algorithms
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric problems that have solutions using some form...
متن کاملFinding Intersections of Bichromatic Segments Defined by Points
Consider a set of n points in <, each colored either red or blue. A line segment defined by two red points is a red segment, and that defined by two blue points is a blue segment. A bichromatic intersection is an intersection between a red segment and a blue segment. We give an O(n + k) algorithm that reports k bichromatic intersections defined by the n points. Extending our algorithm to points...
متن کاملCounting and Reporting Red/Blue Segment Intersections
We simplify the red/blue segment intersection algorithm of Chazelle et al: Given sets of n disjoint red and n disjoint blue segments, we count red/blue intersections in O(n log n) time using O(n) space or report them in additional time proportional to their number. Our algorithm uses a plane sweep to presort the segments; then it operates on a list of slabs that eeciently stores a single level ...
متن کاملA Space-Efficient Algorithm for Segment Intersection
We examine the space requirement for the classic linesegment intersection problem. Using so-called implicit data structures, we show how to make the standard sweep-line algorithm run in O((n+ k) log n) time with only O(log n) extra space, where n is the number of line segments and k is the number of intersections. If division is allowed and input can be destroyed, the algorithm can run in O((n ...
متن کامل