Thomas H. Cormen, et al. Introduction to algorithms. Vol. 2. Cambridge: MIT press, 2001.
 David Eberly. “Distance between two line segments in 3D.” Magic Software Inc, 1999.
 Philip Schneider, and David H. Eberly. “Geometric tools for computer graphics.” Morgan Kaufmann, 2002.
 Tomas Akenine-Möller, Eric Haines, and Naty Hoffman. “Real-time rendering.” CRC Press, 2011.
 Franklin Antonio. “Faster line segment intersection.” Graphics Gems III. Academic Press Professional, Inc., 1992.
 Michael Ian Shamos, and Dan Hoey. “Geometric intersection problems.” Foundations of Computer Science, 1976., 17th Annual Symposium on. IEEE, 1976.
 Jon L. Bentley, and Thomas A. Ottmann. “Algorithms for reporting and counting geometric intersections.” Computers, IEEE Transactions, vol.100, no.9, pp.643-647, 1979.
 Bernard Chazelle. “Reporting and counting segment intersections.” Journal of Computer and System Sciences, vol.32, no.2, pp.156-182, 1986.
 Bernard Chazelle, and Herbert Edelsbrunner. “An optimal algorithm for intersecting line segments in the plane.” Journal of the ACM (JACM), vol.39, no.1, pp.1-54, 1992.
 Bernard Chazelle, and Herbert Edelsbrunner. “An optimal algorithm for intersecting line segments in the plane.” Proceedings of the 29th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 1988.
 Ivan J. Balaban. “An optimal algorithm for finding segments intersections.” Proceedings of the eleventh annual symposium on Computational geometry, ACM, 1995.
 Eugene W. Myers. “An O(E\logE+I) Expected Time Algorithm for the Planar Segment Intersection Problem.” SIAM Journal on Computing, vol.14, no.3, pp.625-637, 1985.
 Kenneth L. Clarkson, and Peter W. Shor. “Applications of random sampling in computational geometry, II.” Discrete & Computational Geometry, vol.4, no.1, pp.387-421, 1989.
 Dan Sunday. “Intersections of a Set of Segments” website, <http://geomalgorithms.com/a09-_intersect-3.html>, last access in September, 2014.
 Harry G. Mairson, and Jorge Stolfi. “Reporting and counting intersections between two sets of line segments.” Theoretical foundations of computer graphics and CAD, pp.307-325, 1988.
 Tim Chan. “A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections”, Proc. 6-th Can. Conf. Comp. Geom., Saskatoon, Saskatchewan, Canada, pp.263-268, 1994.
 János Pach, and Micha Sharir. “On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottmann line sweeping algorithm.”SIAM Journal on Computing, vol.20, no.3, pp.460-470, 1991.
 K. Q. Brown. “Comments on Algorithms for reporting and counting geometric intersections.” IEEE Trans. Comput., pp.147–148, 1981.
 Cagne. “Bentley-Otmann Algorithm 2.0.” website, <http://www.eleves.ens.fr/home/cagne/internship_l3/mncubes_0/doc/html/index.html>, last acess in September, 2014.
 Mark de Berg, et al. Computational Geometry: Algorithms and Applications, Third Edition. New York, New York.