@article{oai:kanazawa-u.repo.nii.ac.jp:00057111,
 author = {浅野, 哲夫 and Konagaya, Matsuo and Asano, Tetsuo},
 issue = {6},
 journal = {IEICE transactions on fundamentals of electronics, communications and computer sciences},
 month = {Jun},
 note = {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., 金沢大学},
 pages = {1066--1071},
 title = {Reporting all segment intersections using an arbitrary sized work space},
 volume = {E96-A},
 year = {2013}
}