/** * Tests whether either intersection point is an interior point of one of the input segments. * * @return <code>true</code> if either intersection point is in the interior of one of the input segments */ public boolean isInteriorIntersection() { if (isInteriorIntersection(0)) return true; if (isInteriorIntersection(1)) return true; return false; }
private boolean hasInteriorIntersection(LineSegment seg0, LineSegment seg1) { li.computeIntersection(seg0.p0, seg0.p1, seg1.p0, seg1.p1); return li.isInteriorIntersection(); }
if (li.isInteriorIntersection()) { for (int intIndex = 0; intIndex < li.getIntersectionNum(); intIndex++) { interiorIntersections.add(li.getIntersection(intIndex));
if (li.isInteriorIntersection()) { for (int intIndex = 0; intIndex < li.getIntersectionNum(); intIndex++) { interiorIntersections.add(li.getIntersection(intIndex));
boolean isInteriorInt = li.hasIntersection() && li.isInteriorIntersection();
if (li.isInteriorIntersection()) { numInteriorIntersections++; hasInterior = true;