22 #include <geos/algorithm/LineIntersector.h> 23 #include <geos/algorithm/BoundaryNodeRule.h> 24 #include <geos/noding/SegmentIntersector.h> 30 class BasicSegmentString;
33 class BoundaryNodeRule;
38 class MultiLineString;
42 class GeometryCollection;
99 bool isClosedEndpointsInInterior =
true;
100 bool isFindAllLocations =
false;
101 bool isSimpleResult =
false;
102 std::vector<geom::CoordinateXY> nonSimplePts;
103 bool computed =
false;
132 static std::vector<std::unique_ptr<geos::geom::CoordinateSequence>>
135 static std::vector<std::unique_ptr<noding::SegmentString>>
136 createSegmentStrings(std::vector<std::unique_ptr<geos::geom::CoordinateSequence>>& seqs);
143 bool isClosedEndpointsInInterior;
144 bool isFindAll =
false;
146 std::vector<geom::CoordinateXY>& intersectionPts;
154 bool findIntersection(
157 const geom::CoordinateXY& p00,
const geom::CoordinateXY& p01,
158 const geom::CoordinateXY& p10,
const geom::CoordinateXY& p11);
169 bool isIntersectionEndpoint(
181 std::size_t intersectionVertexIndex(
186 NonSimpleIntersectionFinder(
187 bool p_isClosedEndpointsInInterior,
189 std::vector<geom::CoordinateXY>& p_intersectionPts)
190 : isClosedEndpointsInInterior(p_isClosedEndpointsInInterior)
191 , isFindAll(p_isFindAll)
192 , intersectionPts(p_intersectionPts)
200 bool hasIntersection()
const;
202 void processIntersections(
206 bool isDone()
const override;
223 :
IsSimpleOp(geom, algorithm::BoundaryNodeRule::getBoundaryRuleMod2())
234 , isClosedEndpointsInInterior(! p_boundaryNodeRule.isInBoundary(2))
235 , isFindAllLocations(false)
248 if (!geom)
return false;
249 return isSimple(*geom);
258 geom::CoordinateXY getNonSimpleLocation(
const geom::Geometry& geom);
266 void setFindAllLocations(
bool isFindAll);
283 geom::CoordinateXY getNonSimpleLocation();
290 const std::vector<geom::CoordinateXY>& getNonSimpleLocations();
Definition: IsSimpleOp.h:94
IsSimpleOp(const geom::Geometry &geom)
Definition: IsSimpleOp.h:222
An interface for classes which represent a sequence of contiguous line segments.
Definition: SegmentString.h:47
Basic implementation of Geometry, constructed and destructed by GeometryFactory.
Definition: Geometry.h:186
IsSimpleOp(const geom::Geometry &geom, const algorithm::BoundaryNodeRule &p_boundaryNodeRule)
Definition: IsSimpleOp.h:232
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...
Definition: LineIntersector.h:53
An interface for rules which determine whether node points which are in boundaries of lineal geometry...
Definition: BoundaryNodeRule.h:50
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25
Definition: MultiPoint.h:50
Processes possible intersections detected by a Noder.
Definition: noding/SegmentIntersector.h:45