The algorithm for finding intersects from the set of segments
Abstract:
This paper deals with a new algorithm for finding intersecting pairs from given set of N segments in the plane. The algorithm is asymptotic optimal and has time and space complexity O(NlogN +K) and O(N)correspondingly, where K is number of intersecting pairs.
Publication language:russian, pages:25
Research direction:
Mathematical problems and theory of numerical methods
