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

Package com.vividsolutions.jts.triangulate.quadedge

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

com.vividsolutions.jts.triangulate.quadedge.Vertex
Models a site (node) in a {@link QuadEdgeSubdivision}. The sites can be points on a lineString representing a linear site. The vertex can be considered as a vector with a norm, length, inner product, cross product, etc. Additionally, point relations (e.g., is a point to the left of a line, the circle defined by this point and two others, etc.) are also defined in this class. @author David Skea @author Martin Davis

   * 
   * @throws LocateFailureException if the location algorithm fails to converge in a reasonable number of iterations
   */
  public void insertSites(Collection vertices) {
    for (Iterator i = vertices.iterator(); i.hasNext();) {
      Vertex v = (Vertex) i.next();
      insertSite(v);
    }
  }

View Full Code Here

public class ConformingDelaunayTriangulator 
{
  private static Envelope computeVertexEnvelope(Collection vertices) {
    Envelope env = new Envelope();
    for (Iterator i = vertices.iterator(); i.hasNext();) {
      Vertex v = (Vertex) i.next();
      env.expandToInclude(v.getCoordinate());
    }
    return env;
  }

View Full Code Here

  private Coordinate[] getPointArray() {
    Coordinate[] pts = new Coordinate[initialVertices.size()
        + segVertices.size()];
    int index = 0;
    for (Iterator i = initialVertices.iterator(); i.hasNext();) {
      Vertex v = (Vertex) i.next();
      pts[index++] = v.getCoordinate();
    }
    for (Iterator i2 = segVertices.iterator(); i2.hasNext();) {
      Vertex v = (Vertex) i2.next();
      pts[index++] = v.getCoordinate();
    }
    return pts;
  }

View Full Code Here

   * 
   * @throws LocateFailureException if the location algorithm fails to converge in a reasonable number of iterations
   */
  public void insertSites(Collection vertices) {
    for (Iterator i = vertices.iterator(); i.hasNext();) {
      Vertex v = (Vertex) i.next();
      insertSite(v);
    }
  }

View Full Code Here

public class ConformingDelaunayTriangulator 
{
  private static Envelope computeVertexEnvelope(Collection vertices) {
    Envelope env = new Envelope();
    for (Iterator i = vertices.iterator(); i.hasNext();) {
      Vertex v = (Vertex) i.next();
      env.expandToInclude(v.getCoordinate());
    }
    return env;
  }

View Full Code Here

  private Coordinate[] getPointArray() {
    Coordinate[] pts = new Coordinate[initialVertices.size()
        + segVertices.size()];
    int index = 0;
    for (Iterator i = initialVertices.iterator(); i.hasNext();) {
      Vertex v = (Vertex) i.next();
      pts[index++] = v.getCoordinate();
    }
    for (Iterator i2 = segVertices.iterator(); i2.hasNext();) {
      Vertex v = (Vertex) i2.next();
      pts[index++] = v.getCoordinate();
    }
    return pts;
  }

View Full Code Here

TOP

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

com.vividsolutions.jts.geom.Coordinate

com.vividsolutions.jts.triangulate.ConformingDelaunayTriangulator

com.vividsolutions.jts.triangulate.IncrementalDelaunayTriangulator

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.