An intersection algorithm based on Delaunay triangulation

  title={An intersection algorithm based on Delaunay triangulation},
  author={Kokichi Sugihara},
  journal={IEEE Computer Graphics and Applications},
A robust method for finding points of intersection of line segments in a 2-D plane is presented. The plane is subdivided by Delaunay triangulation to localize areas where points of intersection exist and to guarantee the topological consistency of the resulting arrangement. The subdivision is refined by inserting midpoints recursively until the areas containing points of intersection are sufficiently localized. The method is robust in the sense that it does not miss points of intersection that… CONTINUE READING

Similar Papers

Loading similar papers…