GEOS  3.6.1
NodedSegmentString.h
1 /**********************************************************************
2  *
3  * GEOS - Geometry Engine Open Source
4  * http://geos.osgeo.org
5  *
6  * Copyright (C) 2011 Sandro Santilli <strk@keybit.net>
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 {
59 public:
60 
61  // TODO: provide a templated method using an output iterator
62  template <class II>
63  static void getNodedSubstrings(II from, II too_far,
64  SegmentString::NonConstVect* resultEdgelist)
65  {
66  for (II i=from; i != too_far; ++i)
67  {
68  NodedSegmentString * nss = dynamic_cast<NodedSegmentString*>(*i);
69  assert(nss);
70  nss->getNodeList().addSplitEdges(resultEdgelist);
71  }
72  }
73 
74  template <class C>
75  static void 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 
105  {
106  delete pts;
107  }
108 
118  SegmentNode* addIntersectionNode( geom::Coordinate * intPt, std::size_t segmentIndex)
119  {
120  std::size_t normalizedSegmentIndex = segmentIndex;
121 
122  // normalize the intersection point location
123  std::size_t nextSegIndex = normalizedSegmentIndex + 1;
124  if (nextSegIndex < size())
125  {
126  geom::Coordinate const& nextPt =
127  getCoordinate(static_cast<unsigned int>(nextSegIndex));
128 
129  // Normalize segment index if intPt falls on vertex
130  // The check for point equality is 2D only - Z values are ignored
131  if ( intPt->equals2D( nextPt ))
132  {
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  virtual unsigned int size() const
147  {
148  return static_cast<unsigned int>(pts->size());
149  }
150 
151  virtual const geom::Coordinate& getCoordinate(unsigned int i) const;
152 
153  virtual geom::CoordinateSequence* getCoordinates() const;
154 
155  virtual bool isClosed() const;
156 
157  virtual std::ostream& print(std::ostream& os) const;
158 
159 
167  int getSegmentOctant(unsigned int index) const;
168 
174  void addIntersections(algorithm::LineIntersector *li,
175  unsigned int segmentIndex, int geomIndex);
176 
184  void addIntersection(algorithm::LineIntersector *li,
185  unsigned int segmentIndex,
186  int geomIndex, int intIndex);
187 
195  void addIntersection(const geom::Coordinate& intPt,
196  unsigned int segmentIndex);
197 
198 
199 private:
200 
201  SegmentNodeList nodeList;
202 
204 
205  static int safeOctant(const geom::Coordinate& p0, const geom::Coordinate& p1);
206 
207 };
208 
209 } // namespace geos::noding
210 } // namespace geos
211 
212 #ifdef _MSC_VER
213 #pragma warning(pop)
214 #endif
215 
216 #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)
Definition: NodedSegmentString.h:118
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)
Definition: NodedSegmentString.h:98
The internal representation of a list of coordinates inside a Geometry.
Definition: CoordinateSequence.h:59
Represents an intersection point between two NodedSegmentString.
Definition: SegmentNode.h:45