22#ifndef GEOS_GEOMGRAPH_EDGE_H
23#define GEOS_GEOMGRAPH_EDGE_H
25#include <geos/export.h>
29#include <geos/geomgraph/GraphComponent.h>
30#include <geos/geomgraph/Depth.h>
31#include <geos/geomgraph/EdgeIntersectionList.h>
32#include <geos/geom/CoordinateSequence.h>
34#include <geos/inline.h>
38#pragma warning(disable: 4251)
57 class MonotoneChainEdge;
66class GEOS_DLL
Edge:
public GraphComponent{
67using GraphComponent::updateIM;
74 index::MonotoneChainEdge *mce;
87 void testInvariant()
const {
89 assert(
pts->size() > 1);
93 friend std::ostream& operator<< (std::ostream& os,
const Edge& el);
112 virtual int getNumPoints()
const {
113 return static_cast<int>(
pts->getSize());
116 virtual void setName(
const std::string &newName) {
125 virtual const geom::Coordinate& getCoordinate(
int i)
const {
127 return pts->
getAt(i);
130 virtual const geom::Coordinate& getCoordinate()
const {
132 return pts->
getAt(0);
136 virtual Depth &getDepth() {
151 virtual void setDepthDelta(
int newDepthDelta) {
152 depthDelta=newDepthDelta;
156 virtual int getMaximumSegmentIndex()
const {
158 return getNumPoints()-1;
161 virtual EdgeIntersectionList& getEdgeIntersectionList() {
172 virtual bool isClosed()
const {
174 return pts->getAt(0)==
pts->getAt(getNumPoints()-1);
183 virtual Edge* getCollapsedEdge();
185 virtual void setIsolated(
bool newIsIsolated) {
186 isIsolatedVar=newIsIsolated;
190 virtual bool isIsolated()
const {
192 return isIsolatedVar;
208 int geomIndex,
int intIndex);
223 virtual std::string print()
const;
225 virtual std::string printReverse()
const;
246inline bool operator==(
const Edge &a,
const Edge &b) {
250std::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:49
The internal representation of a list of coordinates inside a Geometry.
Definition CoordinateSequence.h:59
virtual const Coordinate & getAt(std::size_t i) const =0
Returns a read-only reference to Coordinate at position i.
Coordinate is the lightweight class used to store coordinates.
Definition Coordinate.h:60
An Envelope defines a rectangulare region of the 2D coordinate plane.
Definition Envelope.h:53
Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix.
Definition IntersectionMatrix.h:51
A EdgeEndStar is an ordered list of EdgeEnds around a node.
Definition EdgeEndStar.h:63
Definition EdgeIntersectionList.h:59
Edge(geom::CoordinateSequence *newPts, const Label &newLabel)
Takes ownership of CoordinateSequence.
geom::CoordinateSequence * pts
Externally-set, owned by Edge. FIXME: refuse ownership.
Definition geomgraph/Edge.h:98
virtual void addIntersections(algorithm::LineIntersector *li, int segmentIndex, int geomIndex)
Adds EdgeIntersections for one or both intersections found for a segment of an edge to the edge inter...
virtual void computeIM(geom::IntersectionMatrix &im)
Update the IM with the contribution for this component.
Definition geomgraph/Edge.h:215
virtual bool isCollapsed() const
An Edge is collapsed if it is an Area edge and it consists of two segments which are equal and opposi...
virtual index::MonotoneChainEdge * getMonotoneChainEdge()
Return this Edge's index::MonotoneChainEdge, ownership is retained by this object.
virtual bool isPointwiseEqual(const Edge *e) const
return true if the coordinate sequences of the Edges are identical
virtual void addIntersection(algorithm::LineIntersector *li, int segmentIndex, int geomIndex, int intIndex)
Add an EdgeIntersection for intersection intIndex.
Edge(geom::CoordinateSequence *newPts)
Takes ownership of CoordinateSequence.
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
virtual bool equals(const Edge &e) const
A Label indicates the topological relationship of a component of a topology graph to a given Geometry...
Definition Label.h:57
Definition geomgraph/Node.h:62
Contains classes and interfaces implementing fundamental computational geometry algorithms.
Definition Angle.h:33
Contains the Geometry interface hierarchy and supporting classes.
Definition IndexedNestedRingTester.h:26
Contains classes that implement topology graphs.
Definition IndexedNestedRingTester.h:34
Basic namespace for all GEOS functionalities.
Definition IndexedNestedRingTester.h:25