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

Package com.vividsolutions.jts.index.kdtree

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

com.vividsolutions.jts.index.kdtree.KdTree
An implementation of a 2-D KD-Tree. KD-trees provide fast range searching on point data.
This implementation supports detecting and snapping points which are closer than a given tolerance value. If the same point (up to tolerance) is inserted more than once a new node is not created but the count of the existing node is incremented. @author David Skea @author Martin Davis

   */
  public ConformingDelaunayTriangulator(Collection initialVertices,
      double tolerance) {
    this.initialVertices = new ArrayList(initialVertices);
    this.tolerance = tolerance;
    kdt = new KdTree(tolerance);
  }

View Full Code Here

   */
  public ConformingDelaunayTriangulator(Collection initialVertices,
      double tolerance) {
    this.initialVertices = new ArrayList(initialVertices);
    this.tolerance = tolerance;
    kdt = new KdTree(tolerance);
  }

View Full Code Here

TOP

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

com.vividsolutions.jts.triangulate.ConformingDelaunayTriangulator

java.util.ArrayList

java.util.List

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.