#include <EdgeRing.h>
|
std::ostream & | operator<< (std::ostream &os, const EdgeRing &er) |
◆ computePoints()
void geos::geomgraph::EdgeRing::computePoints |
( |
DirectedEdge * | newStart | ) |
|
|
protected |
◆ computeRing()
void geos::geomgraph::EdgeRing::computeRing |
( |
| ) |
|
Compute a LinearRing from the point list previously collected. Test if the ring is a hole (i.e. if it is CCW) and set the hole flag accordingly.
◆ containsPoint()
This method will use the computed ring. It will also check any holes, if they have been assigned.
References holes.
◆ getEdges()
std::vector< DirectedEdge * > & geos::geomgraph::EdgeRing::getEdges |
( |
| ) |
|
Returns the list of DirectedEdges that make up this EdgeRing
◆ getLinearRing()
Return a pointer to the LinearRing owned by this object. Make a copy if you need it beyond this objects's lifetime.
◆ mergeLabel()
void geos::geomgraph::EdgeRing::mergeLabel |
( |
const Label & | deLabel, |
|
|
uint8_t | geomIndex ) |
|
protected |
Merge the RHS label from a DirectedEdge into the label for this EdgeRing.
The DirectedEdge label may be null. This is acceptable - it results from a node which is NOT an intersection node between the Geometries (e.g. the end node of a LinearRing). In this case the DirectedEdge label does not contribute any information to the overall labelling, and is simply skipped.
◆ toPolygon()
The documentation for this class was generated from the following file: