Multiple line segment intersection

<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Bentley%E2%80%93Ottmann_algorithm/djAFj5I5">Bentley–Ottmann algorithm</a></li></ul>

<h2 id="further-reading">Further reading</h2>
<ul><li>Mark de Berg; Marc van Kreveld; Mark Overmars; and Otfried Schwarzkopf (2000). <a href="https://archive.org/details/computationalgeo00berg"><i>Computational Geometry</i></a> (2nd ed.). Springer. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-65620-0. Chapter 2: Line Segment Intersection, pp. 19–44.</li>
<li><a href="/facts/Thomas_H._Cormen/qJ2Ys15T">Thomas H. Cormen</a>, <a href="/facts/Charles_E._Leiserson/6Uf19apB">Charles E. Leiserson</a>, <a href="/facts/Ronald_L._Rivest/nQsIcAKa">Ronald L. Rivest</a>, and <a href="/facts/Clifford_Stein/5ajkVbCm">Clifford Stein</a>. <i><a href="/facts/Introduction_to_Algorithms/o9n7KDsg">Introduction to Algorithms</a></i>, Second Edition. MIT Press and McGraw-Hill, 1990. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 0-262-03293-7. Section 33.2: Determining whether any pair of segments intersects, pp. 934–947.</li>
<li>J. L. Bentley and T. Ottmann., Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. C28 (1979), 643–647.</li></ul>
<h2 id="external-links">External links</h2>
<ul><li><a href="https://web.archive.org/web/20130109225152/http://geomalgorithms.com/a05-_intersect-1.html">Intersections of Lines and Planes</a>[<i>usurped</i>] Algorithms and sample code by Dan Sunday</li>
<li>Robert Pless. <a href="https://web.archive.org/web/20160707015648/http://www.cs.wustl.edu/~pless/506/l4.html">Lecture 4 notes</a>. <a href="/facts/Washington_University_in_St._Louis/GmIT8zU6">Washington University in St. Louis</a>, CS 506: Computational Geometry (<a href="https://web.archive.org/web/20171020091733/http://www.cs.wustl.edu/~pless/546/">cached copy</a>).</li>
<li><a href="https://www.cgal.org/Manual/latest/doc_html/cgal_manual/Sweep_line_2/Chapter_main.html">Line segment intersection</a> in <a href="/facts/CGAL/Dyyl9PGD">CGAL</a>, the Computational Geometry Algorithms Library</li>
<li><a href="https://web.archive.org/web/20050601132020/http://compgeom.cs.uiuc.edu/~jeffe/teaching/373/notes/x06-sweepline.pdf">"Line Segment Intersection"</a> lecture notes by Jeff Erickson.</li>
<li><a href="http://alienryderflex.com/intersect/">Line-Line Intersection Method With C Code Sample</a> Darel Rex Finley</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1"><p>Shamos, M. I.; Hoey, D. (1976). "17th Annual Symposium on Foundations of Computer Science (sfcs 1976)" (PDF): 208. doi:10.1109/SFCS.1976.16. S2CID 124804. {{cite journal}}: Cite journal requires |journal= (help) Chapter: "Geometric intersection problems" <a href="http://euro.ecom.cmu.edu/people/faculty/mshamos/1976GeometricIntersection.pdf" target="_blank">http://euro.ecom.cmu.edu/people/faculty/mshamos/1976GeometricIntersection.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li>
</ol>

Multiple line segment intersection open-in-new

Multiple line segment intersection