References

  1. Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars. 2008. Computational Geometry: Algorithms and Applications (3rd ed. ed.). TELOS, Santa Clara, CA, USA.
  2. O'Rourke, J. (1998). Computational Geometry in C. Cambridge: Cambridge University Press. DOI: http://dx.doi.org/10.1017/CBO9780511804120
  3. Bernard Chazelle and Herbert Edelsbrunner. 1992. An optimal algorithm for intersecting line segments in the plane. J. ACM 39, 1 (January 1992), 1-54. DOI: http://dx.doi.org/10.1145/147508.147511
  4. Ivan J. Balaban. 1995. An optimal algorithm for finding segments intersections. In Proceedings of the eleventh annual symposium on Computational geometry (SCG '95). ACM, New York, NY, USA, 211-219. DOI: http://dx.doi.org/10.1145/220279.220302
  5. Efi Fogel. Minkowski Sums: Minkowski Sum—definition, complexity, construction, applications. 2011. Algorithmic Robotics and Motion Planning. Tel Aviv University, Israel. Web Site.
  6. AVL tree library
  7. Dijkstra library