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) // warning C4251: needs to have dll-interface to be used by clients of class 42 class IntersectionMatrix;
46 class LineIntersector;
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 virtual 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 virtual EdgeIntersectionList&
167 getEdgeIntersectionList()
177 virtual index::MonotoneChainEdge* getMonotoneChainEdge();
183 return pts->getAt(0) == pts->getAt(getNumPoints() - 1);
190 virtual bool isCollapsed()
const;
192 virtual Edge* getCollapsedEdge();
195 setIsolated(
bool newIsIsolated)
197 isIsolatedVar = newIsIsolated;
202 isIsolated()
const override 205 return isIsolatedVar;
212 virtual void addIntersections(algorithm::LineIntersector* li, std::size_t segmentIndex,
213 std::size_t geomIndex);
220 virtual void addIntersection(algorithm::LineIntersector* li, std::size_t segmentIndex,
221 std::size_t geomIndex, std::size_t intIndex);
236 virtual bool isPointwiseEqual(
const Edge* e)
const;
238 virtual std::string print()
const;
240 virtual std::string printReverse()
const;
249 virtual bool equals(
const Edge& e)
const;
252 equals(
const Edge* e)
const 264 operator==(
const Edge& a,
const Edge& b)
269 std::ostream& operator<< (std::ostream& os,
const Edge& el);
MonotoneChains are a way of partitioning the segments of an edge to allow for fast searching of inter...
Definition: MonotoneChainEdge.h:45
An Envelope defines a rectangulare region of the 2D coordinate plane.
Definition: Envelope.h:58
std::unique_ptr< geom::CoordinateSequence > pts
Externally-set, owned by Edge. FIXME: refuse ownership.
Definition: geomgraph/Edge.h:93
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:58
virtual int getDepthDelta() const
The depthDelta is the change in depth as an edge is crossed from R to L.
Definition: geomgraph/Edge.h:146
Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix. ...
Definition: IntersectionMatrix.h:51
A list of edge intersections along an Edge.
Definition: EdgeIntersectionList.h:57
A Label indicates the topological relationship of a component of a topology graph to a given Geometry...
Definition: Label.h:57
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25
void computeIM(geom::IntersectionMatrix &im) override
Update the IM with the contribution for this component.
Definition: geomgraph/Edge.h:229
The internal representation of a list of coordinates inside a Geometry.
Definition: CoordinateSequence.h:44
A Depth object records the topological depth of the sides of an Edge for up to two Geometries...
Definition: Depth.h:40
A GraphComponent is the parent class for the objects' that form a graph.
Definition: geomgraph/GraphComponent.h:45
Definition: geomgraph/Edge.h:63