24#include <geos/export.h>
28#include <geos/geomgraph/GraphComponent.h>
29#include <geos/geomgraph/Depth.h>
30#include <geos/geomgraph/EdgeIntersectionList.h>
31#include <geos/geom/CoordinateSequence.h>
32#include <geos/geom/Envelope.h>
36#pragma warning(disable: 4251)
42class IntersectionMatrix;
64 using GraphComponent::updateIM;
69 std::unique_ptr<index::MonotoneChainEdge> mce;
85 assert(pts->size() > 1);
88 friend std::ostream& operator<< (std::ostream& os,
const Edge& el);
93 std::unique_ptr<geom::CoordinateSequence>
pts;
108 return pts->getSize();
112 getCoordinates()
const
119 getCoordinate(std::size_t i)
const
122 return pts->getAt(i);
125 const geom::Coordinate&
126 getCoordinate()
const
129 return pts->getAt(0);
153 setDepthDelta(
int newDepthDelta)
155 depthDelta = newDepthDelta;
160 getMaximumSegmentIndex()
const
163 return getNumPoints() - 1;
166 EdgeIntersectionList&
167 getEdgeIntersectionList()
173 const EdgeIntersectionList&
174 getEdgeIntersectionList()
const
190 return pts->getAt(0) == pts->getAt(getNumPoints() - 1);
199 Edge* getCollapsedEdge();
202 setIsolated(
bool newIsIsolated)
204 isIsolatedVar = newIsIsolated;
209 isIsolated()
const override
212 return isIsolatedVar;
220 std::size_t geomIndex);
228 std::size_t geomIndex, std::size_t intIndex);
245 std::string print()
const;
247 std::string printReverse()
const;
259 equals(
const Edge* e)
const
271operator==(
const Edge& a,
const Edge& b)
276std::ostream& operator<< (std::ostream& os,
const Edge& el);
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...
Definition LineIntersector.h:53
The internal representation of a list of coordinates inside a Geometry.
Definition CoordinateSequence.h:56
Coordinate is the lightweight class used to store coordinates.
Definition Coordinate.h:217
An Envelope defines a rectangulare region of the 2D coordinate plane.
Definition Envelope.h:59
Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix.
Definition IntersectionMatrix.h:51
A Depth object records the topological depth of the sides of an Edge for up to two Geometries.
Definition Depth.h:41
A list of edge intersections along an Edge.
Definition EdgeIntersectionList.h:57
Definition geomgraph/Edge.h:63
bool isPointwiseEqual(const Edge *e) const
return true if the coordinate sequences of the Edges are identical
int getDepthDelta() const
The depthDelta is the change in depth as an edge is crossed from R to L.
Definition geomgraph/Edge.h:146
bool equals(const Edge &e) const
bool isCollapsed() const
An Edge is collapsed if it is an Area edge and it consists of two segments which are equal and opposi...
Edge(geom::CoordinateSequence *newPts, const Label &newLabel)
Takes ownership of CoordinateSequence.
void addIntersections(algorithm::LineIntersector *li, std::size_t segmentIndex, std::size_t geomIndex)
Adds EdgeIntersections for one or both intersections found for a segment of an edge to the edge inter...
void computeIM(geom::IntersectionMatrix &im) override
Update the IM with the contribution for this component.
Definition geomgraph/Edge.h:236
std::unique_ptr< geom::CoordinateSequence > pts
Externally-set, owned by Edge. FIXME: refuse ownership.
Definition geomgraph/Edge.h:93
Edge(geom::CoordinateSequence *newPts)
Takes ownership of CoordinateSequence.
index::MonotoneChainEdge * getMonotoneChainEdge()
Return this Edge's index::MonotoneChainEdge, ownership is retained by this object.
void addIntersection(algorithm::LineIntersector *li, std::size_t segmentIndex, std::size_t geomIndex, std::size_t intIndex)
Add an EdgeIntersection for intersection intIndex.
A GraphComponent is the parent class for the objects' that form a graph.
Definition geomgraph/GraphComponent.h:45
A Label indicates the topological relationship of a component of a topology graph to a given Geometry...
Definition Label.h:57
MonotoneChains are a way of partitioning the segments of an edge to allow for fast searching of inter...
Definition MonotoneChainEdge.h:45
Basic namespace for all GEOS functionalities.
Definition geos.h:39