41namespace triangulate {
60 std::unique_ptr<CoordinateSequence>& shellRing,
61 std::vector<std::unique_ptr<CoordinateSequence>>& holeRings);
65 bool isHoleNoded(std::size_t i);
66 std::unique_ptr<CoordinateSequence> getNodedShell();
67 std::unique_ptr<CoordinateSequence> getNodedHole(std::size_t i);
68 std::vector<bool>& getHolesTouching();
75 std::vector<bool> isHoleTouching;
76 std::map<NodedSegmentString*, std::size_t> nodedRingIndexes;
77 std::vector<std::unique_ptr<NodedSegmentString>> nodedRings;
81 friend class PolygonNoder::NodeAdder;
85 createNodedSegString(std::unique_ptr<CoordinateSequence>& ringPts, std::size_t i);
87 void createNodedSegmentStrings(
88 std::unique_ptr<CoordinateSequence>& shellRing,
89 std::vector<std::unique_ptr<CoordinateSequence>>& holeRings);
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:216
Represents a list of contiguous line segments, and supports noding the segments.
Definition NodedSegmentString.h:58
Definition PolygonNoder.h:55
Basic namespace for all GEOS functionalities.
Definition geos.h:39