Finds the intersection point, if any, of two linear
Paths. Letbpbe thebool_pointreturned by this function.bp.ptwill contains the intersection point, if it exists. If not, it will containINVALID_POINT. If the intersection point exists and lies on both of the line segments represented by thePathandp,bp.bwill betrue, otherwise,false.This function calls
Point::intersection_points(), passing the first and lastPointson*thisand p as its arguments. If the trace argument isfalse, the version ofPoint::intersection_points()that finds the intersection point by means of a vector calculation is used. If it'strue, the version that finds the intersection point of the traces of the lines on the major planes is used. See Point Reference; Intersections.Point A(-1, -1, -1); Point B(1, 1, 1); Path p0(A, B); Point C(-2, 1, 1); Point D(1.75, 0.25, 0.25); Path p1(C, D); bool_point bp = p0.intersection_point(p1); bp.pt.dotlabel("$i$"); bp.pt.show("bp.pt:"); -| bp.pt: (0.5, 0.5, 0.5)
![]()
Fig. 138.