/** projected distance from stop to another stop, in latitude degrees */ private static double distance (Vertex tstop, Vertex tstop2, double xscale) { // use JTS internal tools wherever possible return new Coordinate(tstop.getLon() * xscale, tstop.getLat()).distance(new Coordinate(tstop2.getLon() * xscale, tstop2.getLat())); }
private void checkVertexDistance(Coordinate vertex) { double vertexDist = vertex.distance(queryPt); if (vertexDist > 0) { updateClearance(vertexDist, queryPt, vertex); } }
public static boolean equals(Coordinate c1, Coordinate c2, double tolerance) { return c1.distance(c2) <= tolerance; } /**
private double computeMinimumSegmentLength(Coordinate[] pts) { double minSegLen = Double.MAX_VALUE; for (int i = 0; i < pts.length - 1; i++) { double segLen = pts[i].distance(pts[i + 1]); if (segLen < minSegLen) minSegLen = segLen; } return minSegLen; }
/** * Computes the length of the line segment. * @return the length of the line segment */ public double getLength() { return p0.distance(p1); }
private void add(Coordinate point) { double dist = point.distance(centroid); if (dist < minDistance) { interiorPoint = new Coordinate(point); minDistance = dist; } }
private void add(Coordinate point) { double dist = point.distance(centroid); if (dist < minDistance) { interiorPoint = new Coordinate(point); minDistance = dist; } }
public static double distance(Coordinate p0, Coordinate p1) { // default to 2D distance if either Z is not set if (Double.isNaN(p0.z) || Double.isNaN(p1.z)) return p0.distance(p1); double dx = p0.x - p1.x; double dy = p0.y - p1.y; double dz = p0.z - p1.z; return Math.sqrt(dx * dx + dy * dy + dz * dz); }
private Coordinate findSnapForVertex(Coordinate pt, Coordinate[] snapPts) { for (int i = 0; i < snapPts.length; i++) { // if point is already equal to a src pt, don't snap if (pt.equals2D(snapPts[i])) return null; if (pt.distance(snapPts[i]) < snapTolerance) return snapPts[i]; } return null; }
public boolean equals(Vertex _x, double tolerance) { if (p.distance(_x.getCoordinate()) < tolerance) { return true; } else { return false; } }
public static void breakIfEqual(Coordinate p0, Coordinate p1, double tolerance) { if (p0.distance(p1) <= tolerance) doBreak(); }
protected boolean equal(Coordinate a, Coordinate b, double tolerance) { if (tolerance == 0) { return a.equals(b); } return a.distance(b) <= tolerance; }
public void initialize(Coordinate p0, Coordinate p1) { pt[0].setCoordinate(p0); pt[1].setCoordinate(p1); distance = p0.distance(p1); isNull = false; }
public void initialize(Coordinate p0, Coordinate p1) { pt[0].setCoordinate(p0); pt[1].setCoordinate(p1); distance = p0.distance(p1); isNull = false; }
public void setMaximum(Coordinate p0, Coordinate p1) { if (isNull) { initialize(p0, p1); return; } double dist = p0.distance(p1); if (dist > distance) initialize(p0, p1, dist); }
public void setMinimum(Coordinate p0, Coordinate p1) { if (isNull) { initialize(p0, p1); return; } double dist = p0.distance(p1); if (dist < distance) initialize(p0, p1, dist); }
public void setMaximum(Coordinate p0, Coordinate p1) { if (isNull) { initialize(p0, p1); return; } double dist = p0.distance(p1); if (dist > distance) initialize(p0, p1, dist); }
public void setMinimum(Coordinate p0, Coordinate p1) { if (isNull) { initialize(p0, p1); return; } double dist = p0.distance(p1); if (dist < distance) initialize(p0, p1, dist); } }
private void compute() { if (extremalPts != null) return; computeCirclePoints(); computeCentre(); if (centre != null) radius = centre.distance(extremalPts[0]); }
/** * Gets the length of the geometry of this quadedge. * * @return the length of the quadedge */ public double getLength() { return orig().getCoordinate().distance(dest().getCoordinate()); }