Examples of com.vividsolutions.jts.triangulate.quadedge.QuadEdgeSubdivision

Package com.vividsolutions.jts.triangulate.quadedge

Examples of com.vividsolutions.jts.triangulate.quadedge.QuadEdgeSubdivision

com.vividsolutions.jts.triangulate.quadedge.QuadEdgeSubdivision
A class that contains the {@link QuadEdge}s representing a planar subdivision that models a triangulation. The subdivision is constructed using the quadedge algebra defined in the classs {@link QuadEdge}. All metric calculations are done in the {@link Vertex} class.In addition to a triangulation, subdivisions support extraction of Voronoi diagrams. This is easily accomplished, since the Voronoi diagram is the dual of the Delaunay triangulation.
Subdivisions can be provided with a tolerance value. Inserted vertices which are closer than this value to vertices already in the subdivision will be ignored. Using a suitable tolerance value can prevent robustness failures from happening during Delaunay triangulation.
Subdivisions maintain a frame triangle around the client-created edges. The frame is used to provide a bounded "container" for all edges within a TIN. Normally the frame edges, frame connecting edges, and frame triangles are not included in client processing. @author David Skea @author Martin Davis

  /**
   * Computes the Delaunay triangulation of the initial sites.
   */
  public void formInitialDelaunay() {
    computeBoundingBox();
    subdiv = new QuadEdgeSubdivision(computeAreaEnv, tolerance);
    subdiv.setLocator(new LastFoundQuadEdgeLocator(subdiv));
    incDel = new IncrementalDelaunayTriangulator(subdiv);
    insertSites(initialVertices);
  }

View Full Code Here

  /**
   * Computes the Delaunay triangulation of the initial sites.
   */
  public void formInitialDelaunay() {
    computeBoundingBox();
    subdiv = new QuadEdgeSubdivision(computeAreaEnv, tolerance);
    subdiv.setLocator(new LastFoundQuadEdgeLocator(subdiv));
    incDel = new IncrementalDelaunayTriangulator(subdiv);
    insertSites(initialVertices);
  }

View Full Code Here

    ConformingDelaunayTriangulationBuilder cdtb = new ConformingDelaunayTriangulationBuilder();


    // add geometry collection
    cdtb.setSites(this.geometries);
    
    QuadEdgeSubdivision qes = cdtb.getSubdivision();
    
    Collection<QuadEdge> quadEdges = qes.getEdges();
    List<QuadEdgeTriangle> qeTriangles = QuadEdgeTriangle.createOn(qes);
    Collection<com.vividsolutions.jts.triangulate.quadedge.Vertex> qeVertices = 
      qes.getVertices(false);
    
    int iV = 0;
    for (com.vividsolutions.jts.triangulate.quadedge.Vertex v : qeVertices) {
      this.coordinates.put(v.getCoordinate(), iV);
      this.vertices.put(iV, new Vertex(iV, v.getCoordinate()));
      iV++;
    }
    
    // border
    List<QuadEdge> qeFrameBorder = new ArrayList<QuadEdge>();
    List<QuadEdge> qeFrame = new ArrayList<QuadEdge>();
    List<QuadEdge> qeBorder = new ArrayList<QuadEdge>();


    for (QuadEdge qe : quadEdges) {
      if (qes.isFrameBorderEdge(qe)) {
        qeFrameBorder.add(qe);
      }
      if (qes.isFrameEdge(qe)) {
        qeFrame.add(qe);
      }
    }


    // border
    for (int j = 0 ; j < qeFrameBorder.size() ; j++) {
      QuadEdge q = qeFrameBorder.get(j);
      if (! qeFrame.contains(q)) {
        qeBorder.add(q);
      }
    }
    
    // deletion of exterior edges
    for (QuadEdge qe : qeFrame) {
      qes.delete(qe);
    }
    
    HashMap<QuadEdge, Double> qeDistances = new HashMap<QuadEdge, Double>();
    for (QuadEdge qe : quadEdges) {
      qeDistances.put(qe, qe.toLineSegment().getLength());

View Full Code Here

TOP

Related Classes of com.vividsolutions.jts.triangulate.quadedge.QuadEdgeSubdivision

com.vividsolutions.jts.triangulate.ConformingDelaunayTriangulator

org.opensphere.geometry.algorithm.ConcaveHull

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.