private void tryDist(Coordinate p, Coordinate p0, Coordinate p1) {
double dist = CGAlgorithms.distancePointLine(p, p0, p1);
if (dist < minDist) {
minDist = dist;
intPt = p;
}
}
/**
* Finds the endpoint of the segments P and Q which is closest to the other segment. This is a
* reasonable surrogate for the true intersection points in ill-conditioned cases (e.g. where two
* segments are nearly coincident, or where the endpoint of one segment lies almost on the other
* segment).
*
* <p>This replaces the older CentralEndpoint heuristic, which chose the wrong endpoint in some
* cases where the segments had very distinct slopes and one endpoint lay almost on the other
* segment.
*
* @param p1 an endpoint of segment P
* @param p2 an endpoint of segment P
* @param q1 an endpoint of segment Q
* @param q2 an endpoint of segment Q
* @return the nearest endpoint to the other segment
*/
private static Coordinate nearestEndpoint(
Coordinate p1, Coordinate p2, Coordinate q1, Coordinate q2) {
Coordinate nearestPt = p1;
double minDist = CGAlgorithms.distancePointLine(p1, q1, q2);
double dist = CGAlgorithms.distancePointLine(p2, q1, q2);
if (dist < minDist) {
minDist = dist;
nearestPt = p2;
}
dist = CGAlgorithms.distancePointLine(q1, p1, p2);
if (dist < minDist) {
minDist = dist;
nearestPt = q1;
}
dist = CGAlgorithms.distancePointLine(q2, p1, p2);
if (dist < minDist) {
minDist = dist;
nearestPt = q2;
}
return nearestPt;
}
/**
* Computes the distance between this line segment and a given point.
*
* @return the distance from this segment to the given point
*/
public double distance(Coordinate p) {
return CGAlgorithms.distancePointLine(p, p0, p1);
}