19#ifndef GEOS_NODING_INTERSECTIONFINDERADDER_H
20#define GEOS_NODING_INTERSECTIONFINDERADDER_H
22#include <geos/export.h>
27#include <geos/inline.h>
29#include <geos/geom/Coordinate.h>
30#include <geos/noding/SegmentIntersector.h>
65 std::vector<geom::Coordinate>& v)
68 interiorIntersections(v)
85 std::vector<geom::Coordinate>& getInteriorIntersections() {
86 return interiorIntersections;
100 std::vector<geom::Coordinate>& interiorIntersections;
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...
Definition LineIntersector.h:49
Coordinate is the lightweight class used to store coordinates.
Definition Coordinate.h:60
Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes.
Definition IntersectionFinderAdder.h:53
virtual bool isDone() const
Definition IntersectionFinderAdder.h:94
void processIntersections(SegmentString *e0, int segIndex0, SegmentString *e1, int segIndex1)
IntersectionFinderAdder(algorithm::LineIntersector &newLi, std::vector< geom::Coordinate > &v)
Definition IntersectionFinderAdder.h:64
An interface for classes which represent a sequence of contiguous line segments.
Definition SegmentString.h:46
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
Classes to compute nodings for arrangements of line segments and line segment sequences.
Definition PreparedLineString.h:27
Basic namespace for all GEOS functionalities.
Definition IndexedNestedRingTester.h:25