public String toString() { return WKTWriter.toLineString(pt[0], pt[1]); } }
public String toString() { return WKTWriter.toLineString(inputLines[0][0], inputLines[0][1]) + " - " + WKTWriter.toLineString(inputLines[1][0], inputLines[1][1]) + getTopologySummary(); }
/** * Returns an error message indicating the segments containing * the intersection. * * @return an error message documenting the intersection location */ public String getErrorMessage() { if (isValid) return "no intersections found"; Coordinate[] intSegs = segInt.getIntersectionSegments(); return "found non-noded intersection between " + WKTWriter.toLineString(intSegs[0], intSegs[1]) + " and " + WKTWriter.toLineString(intSegs[2], intSegs[3]); }
public String toString() { return WKTWriter.toLineString(new CoordinateArraySequence(pts)); } }
public String toString() { return WKTWriter.toLineString(new CoordinateArraySequence(pts)); } }
private void checkTriangleSize(Coordinate[] pts) { String loc = ""; if (pts.length >= 2) loc = WKTWriter.toLineString(pts[0], pts[1]); else { if (pts.length >= 1) loc = WKTWriter.toPoint(pts[0]); } // Assert.isTrue(pts.length == 4, "Too few points for visited triangle at " + loc); //com.vividsolutions.jts.util.Debug.println("too few points for triangle at " + loc); }
private void printNode(IntervalRTreeNode node) { System.out.println(WKTWriter.toLineString(new Coordinate(node.min, level), new Coordinate(node.max, level))); }
/** * Gets a string representation of this object. * * @return a string representing the object */ public String toString() { return WKTWriter.toLineString(new CoordinateArraySequence(getCoordinates())); }
public String toString() { return WKTWriter.toLineString(new Coordinate(min, 0), new Coordinate(max, 0)); }
/** * Converts this edge to a WKT two-point <tt>LINESTRING</tt> indicating * the geometry of this edge. * * @return a String representing this edge's geometry */ public String toString() { Coordinate p0 = vertex.getCoordinate(); Coordinate p1 = dest().getCoordinate(); return WKTWriter.toLineString(p0, p1); } }
+ ", DD result = " + isInCircleDD + ", CC result = " + isInCircleCC + ")"); System.out.println(WKTWriter.toLineString(new CoordinateArraySequence( new Coordinate[] { a, b, c, p }))); System.out.println("Circumcentre = " + WKTWriter.toPoint(circumCentre)
public void testStaticToLineStringFromCoordinateArray() throws ParseException { for (int i = 0; i < 1000; i++) { int size = 2 + _rnd.nextInt(10); Coordinate[] cs = new Coordinate[size]; for (int j = 0; j < cs.length; j++) { cs[j] = new CoordinateXY(100 * _rnd.nextDouble(), 100 * _rnd.nextDouble()); } String toLineStringText = WKTWriter.toLineString(cs); Coordinate[] cd = _reader.read(toLineStringText).getCoordinates(); for (int j = 0; j < cs.length; j++) { assertEquals(cs[j], cd[j]); } } }
private void checkPointOnSeg(Coordinate p1, Coordinate p2, Coordinate q) { System.out.println(" Pt: " + WKTWriter.toPoint(q) + " seg: " + WKTWriter.toLineString(p1, p2) + " --- DDstd = " + orientationDet(p1, p2, q, DD_STD) + " --- DDdec = " + orientationDet(p1, p2, q, DD_DEC) ); }
public void testStaticToLineStringFromTwoCoords() throws ParseException { for (int i = 0; i < 1000; i++) { Coordinate[] cs = new Coordinate[] {new CoordinateXY(100 * _rnd.nextDouble(), 100 * _rnd.nextDouble()), new CoordinateXY(100 * _rnd.nextDouble(), 100 * _rnd.nextDouble())}; String toLineStringText = WKTWriter.toLineString(cs[0], cs[1]); Coordinate[] cd = _reader.read(toLineStringText).getCoordinates(); assertEquals(2, cd.length); assertEquals(cs[0], cd[0]); assertEquals(cs[1], cd[1]); } } }
/** * Checks that two geometries are at least a minimum distance apart. * * @param g1 a geometry * @param g2 a geometry * @param minDist the minimum distance the geometries should be separated by */ private void checkMinimumDistance(Geometry g1, Geometry g2, double minDist) { DistanceOp distOp = new DistanceOp(g1, g2, minDist); minDistanceFound = distOp.distance(); if (minDistanceFound < minDist) { isValid = false; Coordinate[] pts = distOp.nearestPoints(); errorLocation = distOp.nearestPoints()[1]; errorIndicator = g1.getFactory().createLineString(pts); errMsg = "Distance between buffer curve and input is too small " + "(" + minDistanceFound + " at " + WKTWriter.toLineString(pts[0], pts[1]) +" )"; } }
errMsg = "Distance between buffer curve and input is too large " + "(" + maxDistanceFound + " at " + WKTWriter.toLineString(pts[0], pts[1]) +")";
+ ", DD result = " + isInCircleDD + ", CC result = " + isInCircleCC + ")"); System.out.println(WKTWriter.toLineString(new CoordinateArraySequence( new Coordinate[] { a, b, c, p }))); System.out.println("Circumcentre = " + WKTWriter.toPoint(circumCentre)
+ "PIR=" + isPointInRing + " Orient=" + orientation + " Pt: " + WKTWriter.toPoint(pt) + " seg: " + WKTWriter.toLineString(triPts[1], triPts[2]) + " tri: " + toPolygon(triPts) );
public void testStaticToLineStringFromSequence() throws ParseException { for (int i = 0; i < 1000; i++) { int size = 2 + _rnd.nextInt(10); CoordinateSequence cs = getCSFactory(Ordinate.createXY()).create(size, 2, 0); for (int j = 0; j < cs.size(); j++) { cs.setOrdinate(j, CoordinateSequence.X, 100 * _rnd.nextDouble()); cs.setOrdinate(j, CoordinateSequence.Y, 100 * _rnd.nextDouble()); } String toLineStringText = WKTWriter.toLineString(cs); CoordinateSequence cd = ((LineString)_reader.read(toLineStringText)).getCoordinateSequence(); assertEquals(cs.size(), cd.size()); for (int j = 0; j < cs.size(); j++) { assertEquals(cs.getCoordinate(j), cd.getCoordinate(j)); } //assertEquals(cs, cd); } }