高效的搜索算法可计算线段集上的横截面

Question

I have a large dataset of linesegments. Each linesegment consists of [x-start,x-end] . I'm searching for an efficient algorithms to calculate for a given x position the set of intersecting lines.

Answer 1

yves-daoust的回答：间隔树是您最好的朋友

Answer 2

1. Find all lines where x ∈ [start; end] in O(n)
2. In found list of lines find the line with minimum start and the line with maximum end (in linear time). So you will have two points (A,B)

3. Find all lines where:

   • A ∈ [start; end]
   • B ∈ [start; end]
   • start ∈ [A; B] and end ∈ [A, B] and put them into Set.

Overall time complexity should be O(n)