GEOS  3.8.0dev
NodedSegmentString.h
1 /**********************************************************************
2  *
3  * GEOS - Geometry Engine Open Source
4  * http://geos.osgeo.org
5  *
6  * Copyright (C) 2011 Sandro Santilli <strk@kbt.io>
7  * Copyright (C) 2006 Refractions Research Inc.
8  * Copyright (C) 2001-2002 Vivid Solutions Inc.
9  *
10  * This is free software; you can redistribute and/or modify it under
11  * the terms of the GNU Lesser General Public Licence as published
12  * by the Free Software Foundation.
13  * See the COPYING file for more information.
14  *
15  *
16  **********************************************************************
17  *
18  * Last port: noding/NodedSegmentString.java r320 (JTS-1.12)
19  *
20  **********************************************************************/
21 
22 #ifndef GEOS_NODING_NODEDSEGMENTSTRING_H
23 #define GEOS_NODING_NODEDSEGMENTSTRING_H
24 
25 #include <geos/export.h>
26 #include <geos/noding/NodableSegmentString.h> // for inheritance
27 #include <geos/geom/CoordinateSequence.h> // for inlines
28 #include <geos/algorithm/LineIntersector.h>
29 #include <geos/noding/SegmentNode.h>
30 #include <geos/noding/SegmentNodeList.h>
31 #include <geos/noding/SegmentString.h>
32 //#include <geos/noding/Octant.h>
33 #include <geos/geom/Coordinate.h>
34 
35 #include <cstddef>
36 
37 #ifdef _MSC_VER
38 #pragma warning(push)
39 #pragma warning(disable: 4251 4355) // warning C4355: 'this' : used in base member initializer list
40 #endif
41 
42 namespace geos {
43 namespace noding { // geos::noding
44 
57 class GEOS_DLL NodedSegmentString : public NodableSegmentString {
58 public:
59 
60  // TODO: provide a templated method using an output iterator
61  template <class II>
62  static void
63  getNodedSubstrings(II from, II too_far,
64  SegmentString::NonConstVect* resultEdgelist)
65  {
66  for(II i = from; i != too_far; ++i) {
67  NodedSegmentString* nss = dynamic_cast<NodedSegmentString*>(*i);
68  assert(nss);
69  nss->getNodeList().addSplitEdges(resultEdgelist);
70  }
71  }
72 
73  template <class C>
74  static void
75  getNodedSubstrings(C* segStrings,
76  SegmentString::NonConstVect* resultEdgelist)
77  {
78  getNodedSubstrings(segStrings->begin(), segStrings->end(), resultEdgelist);
79  }
80 
81  static void getNodedSubstrings(const SegmentString::NonConstVect& segStrings,
82  SegmentString::NonConstVect* resultEdgeList);
83 
85  static SegmentString::NonConstVect* getNodedSubstrings(
86  const SegmentString::NonConstVect& segStrings);
87 
88 
98  NodedSegmentString(geom::CoordinateSequence* newPts, const void* newContext)
99  : NodableSegmentString(newContext)
100  , nodeList(this)
101  , pts(newPts)
102  {}
103 
104  ~NodedSegmentString() override
105  {
106  delete pts;
107  }
108 
119  SegmentNode*
120  addIntersectionNode(geom::Coordinate* intPt, std::size_t segmentIndex)
121  {
122  std::size_t normalizedSegmentIndex = segmentIndex;
123 
124  // normalize the intersection point location
125  std::size_t nextSegIndex = normalizedSegmentIndex + 1;
126  if(nextSegIndex < size()) {
127  geom::Coordinate const& nextPt =
128  getCoordinate(nextSegIndex);
129 
130  // Normalize segment index if intPt falls on vertex
131  // The check for point equality is 2D only - Z values are ignored
132  if(intPt->equals2D(nextPt)) {
133  normalizedSegmentIndex = nextSegIndex;
134  }
135  }
136 
137  // Add the intersection point to edge intersection list.
138  SegmentNode* ei = getNodeList().add(*intPt, normalizedSegmentIndex);
139  return ei;
140  }
141 
142  SegmentNodeList& getNodeList();
143 
144  const SegmentNodeList& getNodeList() const;
145 
146  size_t
147  size() const override
148  {
149  return pts->size();
150  }
151 
152  const geom::Coordinate& getCoordinate(size_t i) const override;
153 
154  geom::CoordinateSequence* getCoordinates() const override;
155 
156  bool isClosed() const override;
157 
158  std::ostream& print(std::ostream& os) const override;
159 
160 
168  int getSegmentOctant(size_t index) const;
169 
175  void addIntersections(algorithm::LineIntersector* li,
176  size_t segmentIndex, size_t geomIndex);
177 
185  void addIntersection(algorithm::LineIntersector* li,
186  size_t segmentIndex,
187  size_t geomIndex, size_t intIndex);
188 
196  void addIntersection(const geom::Coordinate& intPt,
197  size_t segmentIndex);
198 
199 
200 private:
201 
202  SegmentNodeList nodeList;
203 
205 
206  static int safeOctant(const geom::Coordinate& p0, const geom::Coordinate& p1);
207 
208 };
209 
210 } // namespace geos::noding
211 } // namespace geos
212 
213 #ifdef _MSC_VER
214 #pragma warning(pop)
215 #endif
216 
217 #endif // GEOS_NODING_NODEDSEGMENTSTRING_H
An interface for classes which support adding nodes to a segment string.
Definition: NodableSegmentString.h:37
SegmentNode * addIntersectionNode(geom::Coordinate *intPt, std::size_t segmentIndex)
Adds an intersection node for a given point and segment to this segment string.
Definition: NodedSegmentString.h:120
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:60
Represents a list of contiguous line segments, and supports noding the segments.
Definition: NodedSegmentString.h:57
A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...
Definition: LineIntersector.h:49
void addSplitEdges(std::vector< SegmentString * > &edgeList)
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
A list of the SegmentNode present along a NodedSegmentString.
Definition: SegmentNodeList.h:56
NodedSegmentString(geom::CoordinateSequence *newPts, const void *newContext)
Creates a new segment string from a list of vertices.
Definition: NodedSegmentString.h:98
The internal representation of a list of coordinates inside a Geometry.
Definition: CoordinateSequence.h:58
Represents an intersection point between two NodedSegmentString.
Definition: SegmentNode.h:47