The nonlinear space complexity of the original version of the algorithm was analyzed by Pach & Sharir (1991). Pach, J.; Sharir, M. (1991), "On vertical visibility in arrangements of segments and the queue size in the Bentley–Ottmann line sweeping algorithm", SIAM Journal on Computing, 20 (3): 460–470, doi:10.1137/0220029, MR1094525.
archive.org
In the description of the algorithm in de Berg et al. (2000), the sweep line is horizontal and moves vertically; this change entails swapping the use of x- and y-coordinates consistently throughout the algorithm, but is not otherwise of great significance for the description or analysis of the algorithm. de Berg, Mark; van Kreveld, Marc; Overmars, Mark; Schwarzkopf, Otfried (2000), "Chapter 2: Line segment intersection", Computational Geometry (2nd ed.), Springer-Verlag, pp. 19–44, ISBN978-3-540-65620-3.
The nonlinear space complexity of the original version of the algorithm was analyzed by Pach & Sharir (1991). Pach, J.; Sharir, M. (1991), "On vertical visibility in arrangements of segments and the queue size in the Bentley–Ottmann line sweeping algorithm", SIAM Journal on Computing, 20 (3): 460–470, doi:10.1137/0220029, MR1094525.
