22 #include <geos/export.h> 24 #include <geos/planargraph/PlanarGraph.h> 30 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 37 class GeometryFactory;
39 class CoordinateSequence;
41 namespace planargraph {
47 namespace polygonize {
49 class PolygonizeDirectedEdge;
56 namespace polygonize {
105 void getEdgeRings(std::vector<EdgeRing*>& edgeRingList);
116 void deleteCutEdges(std::vector<const geom::LineString*>& cutLines);
130 void deleteDangles(std::vector<const geom::LineString*>& dangleLines);
142 void computeNextCWEdges();
153 void convertMaximalToMinimalEdgeRings(
154 std::vector<PolygonizeDirectedEdge*>& ringEdges);
167 long label, std::vector<planargraph::Node*>& intNodes
179 static void findLabeledEdgeRings(
180 std::vector<planargraph::DirectedEdge*>& dirEdgesIn,
181 std::vector<PolygonizeDirectedEdge*>& dirEdgesOut);
183 static void label(std::vector<PolygonizeDirectedEdge*>& dirEdges,
long label);
184 static void label(std::vector<planargraph::DirectedEdge*>& dirEdges,
long label);
200 std::vector<planargraph::Edge*> newEdges;
201 std::vector<planargraph::DirectedEdge*> newDirEdges;
202 std::vector<planargraph::Node*> newNodes;
203 std::vector<EdgeRing*> newEdgeRings;
204 std::vector<geom::CoordinateSequence*> newCoords;
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:58
Represents a planar graph of edges that can be used to compute a polygonization, and implements the a...
Definition: PolygonizeGraph.h:68
Definition: LineString.h:66
A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph...
Definition: PolygonizeDirectedEdge.h:52
Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geom...
Definition: GeometryFactory.h:66
Represents a ring of PolygonizeDirectedEdge which form a ring of a polygon. The ring may be either an...
Definition: operation/polygonize/EdgeRing.h:59
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25
A node in a PlanarGraph is a location where 0 or more Edge meet.
Definition: planargraph/Node.h:44
Represents a directed graph which is embeddable in a planar surface.
Definition: planargraph/PlanarGraph.h:59