Subscribe

Issue No.02 - March/April (1992 vol.12)

pp: 59-67

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.124289

ABSTRACT

<p>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 are easily detectable when costly line-pair checking is performed. The algorithm is adaptive in the sense that most of the computational cost is incurred for the areas where finding points of intersection is difficult.</p>

CITATION

Kokichi Sugihara, "An Intersection Algorithm Based on Delaunay Triangulation",

*IEEE Computer Graphics and Applications*, vol.12, no. 2, pp. 59-67, March/April 1992, doi:10.1109/38.124289REFERENCES