#include <PolygonizeGraph.h>
Inheritance diagram for geos::operation::polygonize::PolygonizeGraph:
Public Member Functions | |
PolygonizeGraph (const geom::GeometryFactory *newFactory) | |
Create a new polygonization graph. | |
~PolygonizeGraph () | |
Destroy a polygonization graph. | |
void | addEdge (const geom::LineString *line) |
Add a LineString forming an edge of the polygon graph. | |
void | getEdgeRings (std::vector< EdgeRing * > &edgeRingList) |
Computes the EdgeRings formed by the edges in this graph. | |
void | deleteCutEdges (std::vector< const geom::LineString * > &cutLines) |
Finds and removes all cut edges from the graph. | |
void | deleteDangles (std::vector< const geom::LineString * > &dangleLines) |
Marks all edges from the graph which are "dangles". | |
Static Public Member Functions | |
void | deleteAllEdges (planargraph::Node *node) |
Deletes all edges at a node. |
The marked flag on DirectedEdge is used to indicate that a directed edge has be logically deleted from the graph.
|
Add a LineString forming an edge of the polygon graph.
|
|
Finds and removes all cut edges from the graph.
|
|
Marks all edges from the graph which are "dangles". Dangles are which are incident on a node with degree 1. This process is recursive, since removing a dangling edge may result in another edge becoming a dangle. In order to handle large recursion depths efficiently, an explicit recursion stack is used
|
|
Computes the EdgeRings formed by the edges in this graph.
|