Godisemo
Reputation: 1813
Find which ranges in a set that has a nonempty intersection with some specified range
Let us have a set of ranges r1, r2, ... rn. Then choose some other range R. What is the fastest (or at least a fast) algorithm to determine which of the ranges r1, r2, ... rn that has a nonempty intersection with R? Is there an optimal datastructure to store the set of ranges in?
Upvotes: 0
Views: 77
Answers (1)
Related Questions
- Fast Algorithm to Quickly Find the Range a Number Belongs to in a Set of Ranges?
- Find the maximally intersecting subset of ranges
- Data structure for querying if a given interval is enclosed by a set of other intervals
- Find intersecting set between two ranges
- You have a set of N ranges, is it possible to find whether the intersection is empty in O(n)?
- Finding all Sub ranges for a list of ranges (one or more)
- Algorithm for Intersection (or Merge) of Numerical Ranges
- Java check intersection of each element of ranges in a list
- How to test if a integer range has overlap with an integer list?
- Searching for membership in array of ranges