Reporting All Segment Intersections Using an Arbitrary Sized Work Space

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents an efficient algorithm for reporting all intersections among n given segments in the plane using work space of arbitrarily given size. More exactly, given a parameter s which is between Ω(1) and O(n) specifying the size of work space, the algorithm reports all the segment intersections in roughly O(n2/√s+K) time using O(s) words of O(log n) bits, where K is the total number of intersecting pairs. The time complexity can be improved to O((n2/s)log s+K) when input segments have only some number of different slopes.

著者

• ASANO Tetsuo

  Graduate School of Information Sciences, JAIST

• KONAGAYA Matsuo

  Graduate School of Information Sciences, JAIST

関連論文

• Reporting All Segment Intersections Using an Arbitrary Sized Work Space

スポンサーリンク