java – 查找Path2D是否自相交

我需要找到Path2D是否相交.现在,我通过简单地从路径中提取一行数组,并发现这些行中是否有相交.但是它具有O(n ^ 2)的复杂性,所以非常慢.有更快的方法吗？

解决方法

您可以使用扫描线算法： http://en.wikipedia.org/wiki/Sweep_line_algorithm更快地执行此操作

伪代码：

Each line has a start point and an end point. Say that `start_x` <= `end_x` for all the lines.
Create an empty bucket of lines.
Sort all the points by their x coordinates,and then iterate through the sorted list.
If the current point is a start point,test its line against all the lines in the bucket,and then add its line to the 
bucket.
if the current point is an end point,remove its line from the bucket.

最坏的情况仍然是O(N ^ 2),但平均情况是O(NlogN)

原文地址：https://www.jb51.cc/java/123739.html