Examples of com.vividsolutions.jts.index.kdtree.KdNode

Package com.vividsolutions.jts.index.kdtree

Examples of com.vividsolutions.jts.index.kdtree.KdNode

com.vividsolutions.jts.index.kdtree.KdNode
A node of a {@link KdTree}, which represents one or more points in the same location. @author dskea

      insertSite(v);
    }
  }


  private ConstraintVertex insertSite(ConstraintVertex v) {
    KdNode kdnode = kdt.insert(v.getCoordinate(), v);
    if (!kdnode.isRepeated()) {
      incDel.insertSite(v);
    } else {
      ConstraintVertex snappedV = (ConstraintVertex) kdnode.getData();
      snappedV.merge(v);
      return snappedV;
      // testing
      // if ( v.isOnConstraint() && ! currV.isOnConstraint()) {
      // System.out.println(v);

View Full Code Here

    // For each point found, test if it falls strictly in the circle
    // find closest point
    Coordinate closestNonGabriel = null;
    double minDist = Double.MAX_VALUE;
    for (Iterator i = result.iterator(); i.hasNext();) {
      KdNode nextNode = (KdNode) i.next();
      Coordinate testPt = nextNode.getCoordinate();
      // ignore segment endpoints
      if (testPt.equals2D(p) || testPt.equals2D(q))
        continue;


      double testRadius = midPt.distance(testPt);

View Full Code Here

      insertSite(v);
    }
  }


  private ConstraintVertex insertSite(ConstraintVertex v) {
    KdNode kdnode = kdt.insert(v.getCoordinate(), v);
    if (!kdnode.isRepeated()) {
      incDel.insertSite(v);
    } else {
      ConstraintVertex snappedV = (ConstraintVertex) kdnode.getData();
      snappedV.merge(v);
      return snappedV;
      // testing
      // if ( v.isOnConstraint() && ! currV.isOnConstraint()) {
      // System.out.println(v);

View Full Code Here

    // For each point found, test if it falls strictly in the circle
    // find closest point
    Coordinate closestNonGabriel = null;
    double minDist = Double.MAX_VALUE;
    for (Iterator i = result.iterator(); i.hasNext();) {
      KdNode nextNode = (KdNode) i.next();
      Coordinate testPt = nextNode.getCoordinate();
      // ignore segment endpoints
      if (testPt.equals2D(p) || testPt.equals2D(q))
        continue;


      double testRadius = midPt.distance(testPt);

View Full Code Here

TOP

Related Classes of com.vividsolutions.jts.index.kdtree.KdNode

com.vividsolutions.jts.geom.Coordinate

com.vividsolutions.jts.triangulate.ConformingDelaunayTriangulator

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.