20 #ifndef GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H 21 #define GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H 23 #include <geos/export.h> 25 #include <geos/planargraph/PlanarGraph.h> 31 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 38 class GeometryFactory;
40 class CoordinateSequence;
42 namespace planargraph {
48 namespace polygonize {
50 class PolygonizeDirectedEdge;
57 namespace polygonize {
106 void getEdgeRings(std::vector<EdgeRing*>& edgeRingList);
117 void deleteCutEdges(std::vector<const geom::LineString*>& cutLines);
131 void deleteDangles(std::vector<const geom::LineString*>& dangleLines);
143 void computeNextCWEdges();
154 void convertMaximalToMinimalEdgeRings(
155 std::vector<PolygonizeDirectedEdge*>& ringEdges);
168 long label, std::vector<planargraph::Node*>& intNodes
180 static void findLabeledEdgeRings(
181 std::vector<planargraph::DirectedEdge*>& dirEdgesIn,
182 std::vector<PolygonizeDirectedEdge*>& dirEdgesOut);
184 static void label(std::vector<PolygonizeDirectedEdge*>& dirEdges,
long label);
185 static void label(std::vector<planargraph::DirectedEdge*>& dirEdges,
long label);
201 std::vector<planargraph::Edge*> newEdges;
202 std::vector<planargraph::DirectedEdge*> newDirEdges;
203 std::vector<planargraph::Node*> newNodes;
204 std::vector<EdgeRing*> newEdgeRings;
205 std::vector<geom::CoordinateSequence*> newCoords;
216 #endif // GEOS_OP_POLYGONIZE_POLYGONIZEGRAPH_H Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:60
Represents a planar graph of edges that can be used to compute a polygonization, and implements the a...
Definition: PolygonizeGraph.h:69
Definition: LineString.h:68
A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph.
Definition: PolygonizeDirectedEdge.h:54
Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geom...
Definition: GeometryFactory.h:68
Represents a ring of PolygonizeDirectedEdge which form a ring of a polygon. The ring may be either an...
Definition: operation/polygonize/EdgeRing.h:66
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition: planargraph/Node.h:45
Represents a directed graph which is embeddable in a planar surface.
Definition: planargraph/PlanarGraph.h:60