线交叉问题是使用线扫描技术解决的问题。 首先，让我们正式定义问题。
c++实现：
https://www.hackerearth.com/practice/math/geometry/line-intersection-using-bentley-ottmann-algorithm/tutorial/
https://blog.csdn.net/derbi123123/article/details/106531120
JavaScript实现：
https://github.com/tmpvar/2d-polygon-self-intersections
以下包含C#实现：
https://www.mianshigee.com/project/justcoding121-Advanced-Algorithms
https://qa.1r1g.com/sf/ask/314323201/
https://web.archive.org/web/20141211224415/http://www.lems.brown.edu/~wq/projects/cs252.html
