/** * Gets the {@link QuadEdgeSubdivision} which models the computed triangulation. * * @return the subdivision containing the triangulation */ public QuadEdgeSubdivision getSubdivision() { create(); return subdiv; }
private void create() { if (subdiv != null) return; Envelope siteEnv = envelope(siteCoords); List vertices = toVertices(siteCoords); subdiv = new QuadEdgeSubdivision(siteEnv, tolerance); IncrementalDelaunayTriangulator triangulator = new IncrementalDelaunayTriangulator(subdiv); triangulator.insertSites(vertices); }
/** * Sets the sites (vertices) which will be triangulated. * All vertices of the given geometry will be used as sites. * * @param geom the geometry from which the sites will be extracted. */ public void setSites(Geometry geom) { // remove any duplicate points (they will cause the triangulation to fail) siteCoords = extractUniqueCoordinates(geom); }
public static Geometry triangulate(Geometry geom) { DelaunayTriangulationBuilder builder = new DelaunayTriangulationBuilder(); builder.setSites(geom); builder.setTolerance(0); Geometry tris = builder.getTriangles(geom.getFactory()); return intersection(tris, geom); }
private Geometry concaveHull(String facilityIdentifier){ DelaunayTriangulationBuilder dtb = new DelaunayTriangulationBuilder(); dtb.setSites(this.filteredPoints); QuadEdgeSubdivision qes = dtb.getSubdivision();
/** * Build a delaunay triangulation based on all coordinates of the geometry * * @param geometry * @param flag for flag=0 (default flag) or a MULTILINESTRING for flag=1 * @return a set of polygons (triangles) * @throws SQLException */ public static GeometryCollection createDT(Geometry geometry, int flag) throws SQLException { if (geometry != null) { DelaunayTriangulationBuilder triangulationBuilder = new DelaunayTriangulationBuilder(); triangulationBuilder.setSites(geometry); if(flag == 0) { return getTriangles(geometry.getFactory(), triangulationBuilder); } else { return (GeometryCollection)triangulationBuilder.getEdges(geometry.getFactory()); } } return null; }
private static GeometryCollection getTriangles(GeometryFactory geomFact, DelaunayTriangulationBuilder delaunayTriangulationBuilder) { QuadEdgeSubdivision subdiv = delaunayTriangulationBuilder.getSubdivision(); List triPtsList = subdiv.getTriangleCoordinates(false); Polygon[] tris = new Polygon[triPtsList.size()]; int i = 0; for (Object aTriPtsList : triPtsList) { Coordinate[] triPt = (Coordinate[]) aTriPtsList; tris[i++] = geomFact.createPolygon(geomFact.createLinearRing(triPt), null); } return geomFact.createMultiPolygon(tris); } }
private void create() { if (subdiv != null) return; Envelope siteEnv = DelaunayTriangulationBuilder.envelope(siteCoords); List segments = new ArrayList(); if (constraintLines != null) { siteEnv.expandToInclude(constraintLines.getEnvelopeInternal()); createVertices(constraintLines); segments = createConstraintSegments(constraintLines); } List sites = createSiteVertices(siteCoords); ConformingDelaunayTriangulator cdt = new ConformingDelaunayTriangulator(sites, tolerance); cdt.setConstraints(segments, new ArrayList(constraintVertexMap.values())); cdt.formInitialDelaunay(); cdt.enforceConstraints(); subdiv = cdt.getSubdivision(); }
public static Geometry triangulate(Geometry geom) { DelaunayTriangulationBuilder builder = new DelaunayTriangulationBuilder(); builder.setSites(geom); builder.setTolerance(0); Geometry tris = builder.getTriangles(geom.getFactory()); return intersection(tris, geom); }
/** * Build a delaunay triangulation based on all coordinates of the geometry * * @param geometry * @param flag for flag=0 (default flag) or a MULTILINESTRING for flag=1 * @return a set of polygons (triangles) * @throws SQLException */ public static GeometryCollection createDT(Geometry geometry, int flag) throws SQLException { if (geometry != null) { DelaunayTriangulationBuilder triangulationBuilder = new DelaunayTriangulationBuilder(); triangulationBuilder.setSites(geometry); if(flag == 0) { return getTriangles(geometry.getFactory(), triangulationBuilder); } else { return (GeometryCollection)triangulationBuilder.getEdges(geometry.getFactory()); } } return null; }
private static GeometryCollection getTriangles(GeometryFactory geomFact, DelaunayTriangulationBuilder delaunayTriangulationBuilder) { QuadEdgeSubdivision subdiv = delaunayTriangulationBuilder.getSubdivision(); List triPtsList = subdiv.getTriangleCoordinates(false); Polygon[] tris = new Polygon[triPtsList.size()]; int i = 0; for (Object aTriPtsList : triPtsList) { Coordinate[] triPt = (Coordinate[]) aTriPtsList; tris[i++] = geomFact.createPolygon(geomFact.createLinearRing(triPt), null); } return geomFact.createMultiPolygon(tris); } }
private void create() { if (subdiv != null) return; Envelope siteEnv = DelaunayTriangulationBuilder.envelope(siteCoords); List segments = new ArrayList(); if (constraintLines != null) { siteEnv.expandToInclude(constraintLines.getEnvelopeInternal()); createVertices(constraintLines); segments = createConstraintSegments(constraintLines); } List sites = createSiteVertices(siteCoords); ConformingDelaunayTriangulator cdt = new ConformingDelaunayTriangulator(sites, tolerance); cdt.setConstraints(segments, new ArrayList(constraintVertexMap.values())); cdt.formInitialDelaunay(); cdt.enforceConstraints(); subdiv = cdt.getSubdivision(); }
DelaunayTriangulationBuilder vdBuilder = new DelaunayTriangulationBuilder(); vdBuilder.setSites(coordinateList); vdBuilder.setTolerance(proximalTolerance); Geometry triangleGeoms = vdBuilder.getTriangles(gf); coordinateList.clear();
private void create() { if (subdiv != null) return; Envelope siteEnv = DelaunayTriangulationBuilder.envelope(siteCoords); diagramEnv = siteEnv; // add a buffer around the final envelope double expandBy = Math.max(diagramEnv.getWidth(), diagramEnv.getHeight()); diagramEnv.expandBy(expandBy); if (clipEnv != null) diagramEnv.expandToInclude(clipEnv); List vertices = DelaunayTriangulationBuilder.toVertices(siteCoords); subdiv = new QuadEdgeSubdivision(siteEnv, tolerance); IncrementalDelaunayTriangulator triangulator = new IncrementalDelaunayTriangulator(subdiv); triangulator.insertSites(vertices); }
/** * Sets the sites (point or vertices) which will be diagrammed. * All vertices of the given geometry will be used as sites. * * @param geom the geometry from which the sites will be extracted. */ public void setSites(Geometry geom) { // remove any duplicate points (they will cause the triangulation to fail) siteCoords = DelaunayTriangulationBuilder.extractUniqueCoordinates(geom); }
/** * Gets the edges of the computed triangulation as a {@link MultiLineString}. * * @param geomFact the geometry factory to use to create the output * @return the edges of the triangulation */ public Geometry getEdges(GeometryFactory geomFact) { create(); return subdiv.getEdges(geomFact); }
private void create() { if (subdiv != null) return; Envelope siteEnv = envelope(siteCoords); List vertices = toVertices(siteCoords); subdiv = new QuadEdgeSubdivision(siteEnv, tolerance); IncrementalDelaunayTriangulator triangulator = new IncrementalDelaunayTriangulator(subdiv); triangulator.insertSites(vertices); }
/** * Sets the sites (point or vertices) which will be triangulated. * All vertices of the given geometry will be used as sites. * The site vertices do not have to contain the constraint * vertices as well; any site vertices which are * identical to a constraint vertex will be removed * from the site vertex set. * * @param geom the geometry from which the sites will be extracted. */ public void setSites(Geometry geom) { siteCoords = DelaunayTriangulationBuilder.extractUniqueCoordinates(geom); }
/** * Gets the faces of the computed triangulation as a {@link GeometryCollection} * of {@link Polygon}. * * @param geomFact the geometry factory to use to create the output * @return the faces of the triangulation */ public Geometry getTriangles(GeometryFactory geomFact) { create(); return subdiv.getTriangles(geomFact); } }
private void create() { if (subdiv != null) return; Envelope siteEnv = DelaunayTriangulationBuilder.envelope(siteCoords); diagramEnv = siteEnv; // add a buffer around the final envelope double expandBy = Math.max(diagramEnv.getWidth(), diagramEnv.getHeight()); diagramEnv.expandBy(expandBy); if (clipEnv != null) diagramEnv.expandToInclude(clipEnv); List vertices = DelaunayTriangulationBuilder.toVertices(siteCoords); subdiv = new QuadEdgeSubdivision(siteEnv, tolerance); IncrementalDelaunayTriangulator triangulator = new IncrementalDelaunayTriangulator(subdiv); triangulator.insertSites(vertices); }