diff --git a/doxygen/CoveragePolygonValidator_8h_source.html b/doxygen/CoveragePolygonValidator_8h_source.html index 257ce7fc9e..d9e04a9cb2 100644 --- a/doxygen/CoveragePolygonValidator_8h_source.html +++ b/doxygen/CoveragePolygonValidator_8h_source.html @@ -66,129 +66,129 @@
17 #include <geos/noding/BasicSegmentString.h>
18 #include <geos/geom/LineSegment.h>
19 #include <geos/algorithm/locate/IndexedPointInAreaLocator.h>
-
20 #include <geos/coverage/CoverageRing.h>
-
21 
-
22 #include <unordered_map>
-
23 #include <map>
-
24 
-
25 // Forward declarations
-
26 namespace geos {
-
27 namespace geom {
-
28 class Coordinate;
-
29 class Envelope;
-
30 class Geometry;
-
31 class GeometryFactory;
-
32 }
+
20 #include <geos/coverage/CoveragePolygon.h>
+
21 #include <geos/coverage/CoverageRing.h>
+
22 
+
23 #include <unordered_map>
+
24 #include <map>
+
25 
+
26 // Forward declarations
+
27 namespace geos {
+
28 namespace geom {
+
29 class Coordinate;
+
30 class Envelope;
+
31 class Geometry;
+
32 class GeometryFactory;
33 }
-
34 
-
35 using geos::geom::Coordinate;
-
36 using geos::geom::Envelope;
-
37 using geos::geom::Geometry;
-
38 using geos::geom::GeometryFactory;
-
39 using geos::geom::LineSegment;
-
40 using geos::algorithm::locate::IndexedPointInAreaLocator;
-
41 
-
42 namespace geos { // geos
-
43 namespace coverage { // geos::coverage
-
44 
+
34 }
+
35 
+
36 using geos::geom::Coordinate;
+
37 using geos::geom::Envelope;
+
38 using geos::geom::Geometry;
+
39 using geos::geom::GeometryFactory;
+
40 using geos::geom::LineSegment;
+
41 using geos::algorithm::locate::IndexedPointInAreaLocator;
+
42 
+
43 namespace geos { // geos
+
44 namespace coverage { // geos::coverage
45 
-
97 class GEOS_DLL CoveragePolygonValidator {
-
98 
-
99 private:
-
100 
-
110  class CoverageRingSegment : public LineSegment
-
111  {
-
112  public:
-
113 
-
114  // Members
-
115  CoverageRing* ringForward;
-
116  std::size_t indexForward;
-
117  CoverageRing* ringOpp;
-
118  std::size_t indexOpp;
-
119 
-
120  CoverageRingSegment(
-
121  const Coordinate& p_p0, const Coordinate& p_p1,
-
122  CoverageRing* p_ring, std::size_t p_index)
-
123  : LineSegment(p_p0, p_p1)
-
124  , ringForward(nullptr)
-
125  , indexForward(0)
-
126  , ringOpp(nullptr)
-
127  , indexOpp(0)
-
128  {
-
129  if (p_p1.compareTo(p_p0) < 0) {
-
130  reverse();
-
131  ringOpp = p_ring;
-
132  indexOpp = p_index;
-
133  }
-
134  else {
-
135  ringForward = p_ring;
-
136  indexForward = p_index;
-
137  }
-
138  };
-
139 
-
140  void match(const CoverageRingSegment* seg) {
-
141  bool isInvalid = checkInvalid(seg);
-
142  if (isInvalid) {
-
143  return;
-
144  }
-
145  //-- record the match
-
146  if (ringForward == nullptr) {
-
147  ringForward = seg->ringForward;
-
148  indexForward = seg->indexForward;
-
149  }
-
150  else {
-
151  ringOpp = seg->ringOpp;
-
152  indexOpp = seg->indexOpp;
-
153  }
-
154  //-- mark ring segments as matched
-
155  ringForward->markMatched(indexForward);
-
156  ringOpp->markMatched(indexOpp);
-
157  }
-
158 
-
159  bool checkInvalid(const CoverageRingSegment* seg) const {
-
160  if (ringForward != nullptr && seg->ringForward != nullptr) {
-
161  ringForward->markInvalid(indexForward);
-
162  seg->ringForward->markInvalid(seg->indexForward);
-
163  return true;
-
164  }
-
165  if (ringOpp != nullptr && seg->ringOpp != nullptr) {
-
166  ringOpp->markInvalid(indexOpp);
-
167  seg->ringOpp->markInvalid(seg->indexOpp);
-
168  return true;
-
169  }
-
170  return false;
-
171  }
-
172 
-
173  struct CoverageRingSegHash {
-
174  std::size_t
-
175  operator() (CoverageRingSegment const* s) const {
-
176  std::size_t h = std::hash<double>{}(s->p0.x);
-
177  h ^= (std::hash<double>{}(s->p0.y) << 1);
-
178  h ^= (std::hash<double>{}(s->p1.x) << 1);
-
179  return h ^ (std::hash<double>{}(s->p1.y) << 1);
-
180  }
-
181  };
-
182 
-
183  struct CoverageRingSegEq {
-
184  bool
-
185  operator() (CoverageRingSegment const* lhs, CoverageRingSegment const* rhs) const {
-
186  return lhs->p0.x == rhs->p0.x
-
187  && lhs->p0.y == rhs->p0.y
-
188  && lhs->p1.x == rhs->p1.x
-
189  && lhs->p1.y == rhs->p1.y;
-
190  }
-
191  };
-
192 
-
193  };
-
194 
-
195  // Members
-
196  const Geometry* targetGeom;
-
197  std::vector<const Geometry*> adjGeoms;
-
198  std::vector<const Polygon*> m_adjPolygons;
-
199  const GeometryFactory* geomFactory;
-
200  double gapWidth = 0.0;
-
201  std::map<std::size_t, std::unique_ptr<IndexedPointInAreaLocator>> adjPolygonLocators;
-
202  // std::vector<std::unique_ptr<CoverageRing>> coverageRingStore;
+
46 
+
98 class GEOS_DLL CoveragePolygonValidator {
+
99 
+
100 private:
+
101 
+
111  class CoverageRingSegment : public LineSegment
+
112  {
+
113  public:
+
114 
+
115  // Members
+
116  CoverageRing* ringForward;
+
117  std::size_t indexForward;
+
118  CoverageRing* ringOpp;
+
119  std::size_t indexOpp;
+
120 
+
121  CoverageRingSegment(
+
122  const Coordinate& p_p0, const Coordinate& p_p1,
+
123  CoverageRing* p_ring, std::size_t p_index)
+
124  : LineSegment(p_p0, p_p1)
+
125  , ringForward(nullptr)
+
126  , indexForward(0)
+
127  , ringOpp(nullptr)
+
128  , indexOpp(0)
+
129  {
+
130  if (p_p1.compareTo(p_p0) < 0) {
+
131  reverse();
+
132  ringOpp = p_ring;
+
133  indexOpp = p_index;
+
134  }
+
135  else {
+
136  ringForward = p_ring;
+
137  indexForward = p_index;
+
138  }
+
139  };
+
140 
+
141  void match(const CoverageRingSegment* seg) {
+
142  bool isInvalid = checkInvalid(seg);
+
143  if (isInvalid) {
+
144  return;
+
145  }
+
146  //-- record the match
+
147  if (ringForward == nullptr) {
+
148  ringForward = seg->ringForward;
+
149  indexForward = seg->indexForward;
+
150  }
+
151  else {
+
152  ringOpp = seg->ringOpp;
+
153  indexOpp = seg->indexOpp;
+
154  }
+
155  //-- mark ring segments as matched
+
156  ringForward->markMatched(indexForward);
+
157  ringOpp->markMatched(indexOpp);
+
158  }
+
159 
+
160  bool checkInvalid(const CoverageRingSegment* seg) const {
+
161  if (ringForward != nullptr && seg->ringForward != nullptr) {
+
162  ringForward->markInvalid(indexForward);
+
163  seg->ringForward->markInvalid(seg->indexForward);
+
164  return true;
+
165  }
+
166  if (ringOpp != nullptr && seg->ringOpp != nullptr) {
+
167  ringOpp->markInvalid(indexOpp);
+
168  seg->ringOpp->markInvalid(seg->indexOpp);
+
169  return true;
+
170  }
+
171  return false;
+
172  }
+
173 
+
174  struct CoverageRingSegHash {
+
175  std::size_t
+
176  operator() (CoverageRingSegment const* s) const {
+
177  std::size_t h = std::hash<double>{}(s->p0.x);
+
178  h ^= (std::hash<double>{}(s->p0.y) << 1);
+
179  h ^= (std::hash<double>{}(s->p1.x) << 1);
+
180  return h ^ (std::hash<double>{}(s->p1.y) << 1);
+
181  }
+
182  };
+
183 
+
184  struct CoverageRingSegEq {
+
185  bool
+
186  operator() (CoverageRingSegment const* lhs, CoverageRingSegment const* rhs) const {
+
187  return lhs->p0.x == rhs->p0.x
+
188  && lhs->p0.y == rhs->p0.y
+
189  && lhs->p1.x == rhs->p1.x
+
190  && lhs->p1.y == rhs->p1.y;
+
191  }
+
192  };
+
193 
+
194  };
+
195 
+
196  // Members
+
197  const Geometry* targetGeom;
+
198  std::vector<const Geometry*> adjGeoms;
+
199  //std::vector<const Polygon*> m_adjPolygons;
+
200  const GeometryFactory* geomFactory;
+
201  double gapWidth = 0.0;
+
202  std::vector<std::unique_ptr<CoveragePolygon>> m_adjCovPolygons;
203  std::deque<CoverageRing> coverageRingStore;
204  std::vector<std::unique_ptr<CoordinateSequence>> localCoordinateSequences;
205  std::deque<CoverageRingSegment> coverageRingSegmentStore;
@@ -220,70 +220,72 @@
273 
274 private:
275 
-
276  static std::vector<const Polygon*> extractPolygons(std::vector<const Geometry*>& geoms);
-
277 
-
278  /* private */
-
279  std::unique_ptr<Geometry> createEmptyResult();
-
280 
-
298  void markMatchedSegments(
-
299  std::vector<CoverageRing*>& targetRings,
-
300  std::vector<CoverageRing*>& adjRings,
-
301  const Envelope& targetEnv);
-
302 
-
312  void markMatchedSegments(
-
313  std::vector<CoverageRing*>& rings,
-
314  const Envelope& envLimit,
-
315  CoverageRingSegmentMap& segmentMap);
-
316 
-
317  CoverageRingSegment* createCoverageRingSegment(
-
318  CoverageRing* ring, std::size_t index);
-
319 
-
329  void markInvalidInteractingSegments(
-
330  std::vector<CoverageRing*>& targetRings,
-
331  std::vector<CoverageRing*>& adjRings,
-
332  double distanceTolerance);
-
333 
-
341  void markInvalidInteriorSegments(
-
342  std::vector<CoverageRing*>& targetRings,
-
343  std::vector<const Polygon*>& adjPolygons);
-
344 
-
345  void checkTargetRings(
-
346  std::vector<CoverageRing*>& targetRings,
-
347  std::vector<CoverageRing*>& adjRngs,
-
348  const Envelope& targetEnv);
-
349 
-
358  bool isInteriorVertex(const Coordinate& p,
-
359  std::vector<const Polygon*>& adjPolygons);
+
276  static std::vector<std::unique_ptr<CoveragePolygon>>
+
277  toCoveragePolygons(const std::vector<const Polygon*> polygons);
+
278  static std::vector<const Polygon*> extractPolygons(std::vector<const Geometry*>& geoms);
+
279 
+
280  /* private */
+
281  std::unique_ptr<Geometry> createEmptyResult();
+
282 
+
300  void markMatchedSegments(
+
301  std::vector<CoverageRing*>& targetRings,
+
302  std::vector<CoverageRing*>& adjRings,
+
303  const Envelope& targetEnv);
+
304 
+
314  void markMatchedSegments(
+
315  std::vector<CoverageRing*>& rings,
+
316  const Envelope& envLimit,
+
317  CoverageRingSegmentMap& segmentMap);
+
318 
+
319  CoverageRingSegment* createCoverageRingSegment(
+
320  CoverageRing* ring, std::size_t index);
+
321 
+
331  void markInvalidInteractingSegments(
+
332  std::vector<CoverageRing*>& targetRings,
+
333  std::vector<CoverageRing*>& adjRings,
+
334  double distanceTolerance);
+
335 
+
343  void markInvalidInteriorSegments(
+
344  std::vector<CoverageRing*>& targetRings,
+
345  std::vector<std::unique_ptr<CoveragePolygon>>& adjCovPolygons);
+
346 
+
347  void markInvalidInteriorSection(
+
348  CoverageRing& ring,
+
349  std::size_t iStart,
+
350  std::size_t iEnd,
+
351  std::vector<std::unique_ptr<CoveragePolygon>>& adjCovPolygons );
+
352 
+
353  void markInvalidInteriorSegment(
+
354  CoverageRing& ring, std::size_t i, CoveragePolygon* adjPoly);
+
355 
+
356  void checkTargetRings(
+
357  std::vector<CoverageRing*>& targetRings,
+
358  std::vector<CoverageRing*>& adjRngs,
+
359  const Envelope& targetEnv);
360 
-
361 
-
362  bool polygonContainsPoint(std::size_t index,
-
363  const Polygon* poly, const Coordinate& pt);
+
361  std::unique_ptr<Geometry> createInvalidLines(std::vector<CoverageRing*>& rings);
+
362 
+
363  std::vector<CoverageRing*> createRings(const Geometry* geom);
364 
-
365  IndexedPointInAreaLocator* getLocator(std::size_t index, const Polygon* poly);
+
365  std::vector<CoverageRing*> createRings(std::vector<const Polygon*>& polygons);
366 
-
367  std::unique_ptr<Geometry> createInvalidLines(std::vector<CoverageRing*>& rings);
+
367  void createRings(const Polygon* poly, std::vector<CoverageRing*>& rings);
368 
-
369  std::vector<CoverageRing*> createRings(const Geometry* geom);
-
370 
-
371  std::vector<CoverageRing*> createRings(std::vector<const Polygon*>& polygons);
-
372 
-
373  void createRings(const Polygon* poly, std::vector<CoverageRing*>& rings);
-
374 
-
375  void addRing(
-
376  const LinearRing* ring,
-
377  bool isShell,
-
378  std::vector<CoverageRing*>& rings);
+
369  void addRing(
+
370  const LinearRing* ring,
+
371  bool isShell,
+
372  std::vector<CoverageRing*>& rings);
+
373 
+
374  CoverageRing* createRing(const LinearRing* ring, bool isShell);
+
375 
+
376 
+
377 
+
378 };
379 
-
380  CoverageRing* createRing(const LinearRing* ring, bool isShell);
-
381 
-
382 
-
383 
-
384 };
-
385 
-
386 } // namespace geos::coverage
-
387 } // namespace geos
+
380 } // namespace geos::coverage
+
381 } // namespace geos
geos::algorithm::locate::IndexedPointInAreaLocator
Determines the location of Coordinates relative to an areal geometry, using indexing for efficiency.
Definition: IndexedPointInAreaLocator.h:54
-
geos::coverage::CoveragePolygonValidator
Definition: CoveragePolygonValidator.h:97
+
geos::coverage::CoveragePolygonValidator
Definition: CoveragePolygonValidator.h:98
geos::coverage::CoveragePolygonValidator::validate
std::unique_ptr< Geometry > validate()
geos::coverage::CoveragePolygonValidator::validate
static std::unique_ptr< Geometry > validate(const Geometry *targetPolygon, std::vector< const Geometry * > &adjPolygons, double gapWidth)
geos::coverage::CoveragePolygonValidator::setGapWidth
void setGapWidth(double p_gapWidth)
diff --git a/doxygen/CoveragePolygon_8h_source.html b/doxygen/CoveragePolygon_8h_source.html new file mode 100644 index 0000000000..4ff63b42a5 --- /dev/null +++ b/doxygen/CoveragePolygon_8h_source.html @@ -0,0 +1,117 @@ + + + + + + + +GEOS: CoveragePolygon.h Source File + + + + + + +
+
+ + + + + + +
+
GEOS +  3.13.0dev +
+
+
+ + + + + + + +
+
+
+
CoveragePolygon.h
+
+
+
1 /**********************************************************************
+
2  *
+
3  * GEOS - Geometry Engine Open Source
+
4  * http://geos.osgeo.org
+
5  *
+
6  * Copyright (C) 2024 Martin Davis <mtnclimb@gmail.com>
+
7  *
+
8  * This is free software; you can redistribute and/or modify it under
+
9  * the terms of the GNU Lesser General Public Licence as published
+
10  * by the Free Software Foundation.
+
11  * See the COPYING file for more information.
+
12  *
+
13  **********************************************************************/
+
14 
+
15 #pragma once
+
16 
+
17 #include <geos/algorithm/locate/IndexedPointInAreaLocator.h>
+
18 
+
19 // Forward declarations
+
20 namespace geos {
+
21 namespace geom {
+
22 class Coordinate;
+
23 class Envelope;
+
24 class Polygon;
+
25 }
+
26 }
+
27 
+
28 using geos::geom::CoordinateXY;
+
29 using geos::geom::Envelope;
+
30 using geos::geom::Polygon;
+
31 using geos::algorithm::locate::IndexedPointInAreaLocator;
+
32 
+
33 namespace geos { // geos
+
34 namespace coverage { // geos::coverage
+
35 
+
36 class GEOS_DLL CoveragePolygon {
+
37 
+
38  // Members
+
39  const Polygon* m_polygon;
+
40  Envelope polyEnv;
+
41  mutable std::unique_ptr<IndexedPointInAreaLocator> m_locator;
+
42 
+
43 public:
+
44  CoveragePolygon(const Polygon* poly);
+
45 
+
46  bool intersectsEnv(const Envelope& env) const;
+
47  bool intersectsEnv(const CoordinateXY& p) const;
+
48  bool contains(const CoordinateXY& p) const;
+
49 
+
50 private:
+
51  IndexedPointInAreaLocator& getLocator() const;
+
52 
+
53 };
+
54 
+
55 } // namespace geos::coverage
+
56 } // namespace geos
+
57 
+
geos::algorithm::locate::IndexedPointInAreaLocator
Determines the location of Coordinates relative to an areal geometry, using indexing for efficiency.
Definition: IndexedPointInAreaLocator.h:54
+
geos::geom::Envelope
An Envelope defines a rectangulare region of the 2D coordinate plane.
Definition: Envelope.h:58
+
geos::geom::Polygon
Represents a linear polygon, which may include holes.
Definition: Polygon.h:61
+
geos
Basic namespace for all GEOS functionalities.
Definition: Angle.h:25
+
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/doxygen/CoverageRing_8h_source.html b/doxygen/CoverageRing_8h_source.html index 1e17de2be2..89f48b133d 100644 --- a/doxygen/CoverageRing_8h_source.html +++ b/doxygen/CoverageRing_8h_source.html @@ -123,45 +123,47 @@
83 
84  CoverageRing(const LinearRing* ring, bool isShell);
85 
-
93  static bool isKnown(std::vector<CoverageRing*>& rings);
-
94 
-
101  bool isInteriorOnRight() const;
-
102 
-
108  void markInvalid(std::size_t index);
-
109 
-
115  void markMatched(std::size_t index);
-
116 
-
123  bool isKnown() const;
-
124 
-
131  bool isInvalid(std::size_t i) const;
-
132 
-
138  bool isInvalid() const;
-
139 
-
145  bool hasInvalid() const;
-
146 
-
153  bool isKnown(std::size_t i) const;
-
154 
-
163  const Coordinate& findVertexPrev(std::size_t index, const Coordinate& pt) const;
-
164 
-
173  const Coordinate& findVertexNext(std::size_t index, const Coordinate& pt) const;
-
174 
-
181  std::size_t prev(std::size_t index) const;
-
182 
-
189  std::size_t next(std::size_t index) const;
-
190 
-
191  void createInvalidLines(
-
192  const GeometryFactory* geomFactory,
-
193  std::vector<std::unique_ptr<LineString>>& lines);
-
194 
-
195 };
+
86  geom::Envelope getEnvelope(std::size_t start, std::size_t end);
+
87 
+
95  static bool isKnown(std::vector<CoverageRing*>& rings);
+
96 
+
103  bool isInteriorOnRight() const;
+
104 
+
110  void markInvalid(std::size_t index);
+
111 
+
117  void markMatched(std::size_t index);
+
118 
+
125  bool isKnown() const;
+
126 
+
133  bool isInvalid(std::size_t i) const;
+
134 
+
140  bool isInvalid() const;
+
141 
+
147  bool hasInvalid() const;
+
148 
+
155  bool isKnown(std::size_t i) const;
+
156 
+
165  const Coordinate& findVertexPrev(std::size_t index, const Coordinate& pt) const;
+
166 
+
175  const Coordinate& findVertexNext(std::size_t index, const Coordinate& pt) const;
+
176 
+
183  std::size_t prev(std::size_t index) const;
+
184 
+
191  std::size_t next(std::size_t index) const;
+
192 
+
193  void createInvalidLines(
+
194  const GeometryFactory* geomFactory,
+
195  std::vector<std::unique_ptr<LineString>>& lines);
196 
-
197 } // namespace geos.coverage
-
198 } // namespace geos
-
199 
-
200 
+
197 };
+
198 
+
199 } // namespace geos.coverage
+
200 } // namespace geos
201 
202 
203 
+
204 
+
205 
geos::geom::CoordinateSequence
The internal representation of a list of coordinates inside a Geometry.
Definition: CoordinateSequence.h:56
geos::geom::Coordinate
Coordinate is the lightweight class used to store coordinates.
Definition: Coordinate.h:216
geos::geom::GeometryFactory
Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geom...
Definition: GeometryFactory.h:70
diff --git a/doxygen/files.html b/doxygen/files.html index 11c3699705..56a5cb46fb 100644 --- a/doxygen/files.html +++ b/doxygen/files.html @@ -108,431 +108,432 @@  CoverageBoundarySegmentFinder.h  CoverageEdge.h  CoverageGapFinder.h - CoveragePolygonValidator.h - CoverageRing.h - CoverageRingEdges.h - CoverageSimplifier.h - coverage/CoverageUnion.h - operation/overlayng/CoverageUnion.h - operation/union/CoverageUnion.h - CoverageValidator.h - Curve.h - CurvePolygon.h - d2fixed_full_table.h - d2s_full_table.h - d2s_intrinsics.h - DBSCANClusterFinder.h - DD.h - DelaunayTriangulationBuilder.h - Densifier.h - Depth.h - digit_table.h - Dimension.h - geomgraph/DirectedEdge.h - planargraph/DirectedEdge.h - geomgraph/DirectedEdgeStar.h - planargraph/DirectedEdgeStar.h - DiscreteFrechetDistance.h - DiscreteHausdorffDistance.h - DisjointOperation.h - DisjointSubsetUnion.h - Distance.h - DistanceOp.h - DistanceToPoint.h - DouglasPeuckerLineSimplifier.h - DouglasPeuckerSimplifier.h - geomgraph/Edge.h - operation/overlayng/Edge.h - planargraph/Edge.h - EdgeEnd.h - EdgeEndBuilder.h - EdgeEndBundle.h - EdgeEndBundleStar.h - EdgeEndStar.h - EdgeGraph.h - EdgeGraphBuilder.h - EdgeIntersection.h - EdgeIntersectionList.h - EdgeKey.h - EdgeList.h - EdgeMerger.h - EdgeNodingBuilder.h - EdgeNodingValidator.h - geomgraph/EdgeRing.h - operation/polygonize/EdgeRing.h - EdgeSetIntersector.h - EdgeSourceInfo.h - EdgeString.h - ElevationModel.h - EnhancedPrecisionOp.h - Envelope.h - EnvelopeDistanceClusterFinder.h - EnvelopeIntersectsClusterFinder.h - EnvelopeUtil.h - export.h - ExtractLineByLocation.h - FacetSequence.h - FacetSequenceTreeBuilder.h - FastNodingValidator.h - FastSegmentSetIntersectionFinder.h - FuzzyPointLocator.h - GeoJSON.h - GeoJSONReader.h - GeoJSONWriter.h - geom.h - GeometricShapeFactory.h - Geometry.h - GeometryCollection.h - GeometryCombiner.h - GeometryComponentFilter.h - GeometryDistanceClusterFinder.h - GeometryEditor.h - GeometryEditorOperation.h - GeometryExtracter.h - GeometryFactory.h - GeometryFilter.h - GeometryFixer.h - GeometryFlattener.h - GeometryGraph.h - GeometryGraphOperation.h - GeometryIntersectsClusterFinder.h - GeometryItemDistance.h - GeometryLocation.h - GeometryMapper.h - GeometryNoder.h - GeometryPrecisionReducer.h - GeometrySnapper.h - GeometryTransformer.h - geos.h - geos_c.hC API for the GEOS geometry algorithms library - GEOSException.h - geomgraph/GraphComponent.h - planargraph/GraphComponent.h - HalfEdge.h - HCoordinate.h - HeuristicOverlay.h - HilbertCode.h - HilbertEncoder.h - HoleAssigner.h - HotPixel.h - HotPixelIndex.h - HullTri.h - HullTriangulation.h - IllegalArgumentException.h - IllegalStateException.h - IncrementalDelaunayTriangulator.h - IndexedDistanceToPoint.h - IndexedFacetDistance.h - IndexedNestedHoleTester.h - IndexedNestedPolygonTester.h - IndexedPointInAreaLocator.h - IndexedPointInPolygonsLocator.h - IndexedPointOnLineLocator.h - InputGeometry.h - InteriorPointArea.h - InteriorPointLine.h - InteriorPointPoint.h - Interpolate.h - Interrupt.h - Intersection.h - IntersectionAdder.h - IntersectionFinderAdder.h - IntersectionMatrix.h - IntersectionPointBuilder.h - bintree/Interval.h - strtree/Interval.h - IntervalRTreeBranchNode.h - IntervalRTreeLeafNode.h - IntervalRTreeNode.h - IntervalSize.h - InvalidSegmentDetector.h - IsSimpleOp.h - IsValidOp.h - ItemBoundable.h - ItemDistance.h - ItemVisitor.h - IteratedNoder.h - KdNode.h - KdNodeVisitor.h - KdTree.h - bintree/Key.h - quadtree/Key.h - Label.h - LargestEmptyCircle.h - LastFoundQuadEdgeLocator.h - Length.h - LengthIndexedLine.h - LengthIndexOfPoint.h - LengthLocationMap.h - LinearComponentExtracter.h - LinearGeometryBuilder.h - LinearIterator.h - LinearLocation.h - LinearRing.h - LineBuilder.h - LineIntersector.h - LineLimiter.h - LineMergeDirectedEdge.h - LineMergeEdge.h - LineMergeGraph.h - LineMerger.h - LineSegment.h - LineSegmentIndex.h - LineSequencer.h - LineString.h - LineStringSnapper.h - LinkedLine.h - LinkedRing.h - LocateFailureException.h - Location.h - LocationIndexedLine.h - LocationIndexOfLine.h - LocationIndexOfPoint.h - Machine.h - MakeValid.h - MarkHalfEdge.h - math.h - overlay/MaximalEdgeRing.h - overlayng/MaximalEdgeRing.h - MaximumInscribedCircle.h - MCIndexNoder.h - MCIndexPointSnapper.h - MCIndexSegmentSetMutualIntersector.h - MCIndexSnapRounder.h - MinimalEdgeRing.h - MinimumAreaRectangle.h - MinimumBoundingCircle.h - MinimumClearance.h - MinimumDiameter.h - geomgraph/index/MonotoneChain.h - index/chain/MonotoneChain.h - MonotoneChainBuilder.h - MonotoneChainEdge.h - MonotoneChainIndexer.h - MonotoneChainOverlapAction.h - MonotoneChainSelectAction.h - MortonCode.h - MultiCurve.h - MultiLineString.h - MultiPoint.h - MultiPolygon.h - MultiSurface.h - namespaces.h - NodableSegmentString.h - geomgraph/Node.h - index/bintree/Node.h - index/quadtree/Node.h - planargraph/Node.h - bintree/NodeBase.h - quadtree/NodeBase.h - NodedSegmentString.h - NodeFactory.h - geomgraph/NodeMap.h - planargraph/NodeMap.h - Noder.h - NodingIntersectionFinder.h - NodingValidator.h - NoOpGeometryOperation.h - NotRepresentableException.h - Octant.h - OffsetCurve.h - OffsetCurveBuilder.h - OffsetCurveSection.h - OffsetPointGenerator.h - OffsetSegmentGenerator.h - OffsetSegmentString.h - OrdinateSet.h - Orientation.h - OrientedCoordinateArray.h - OverlapUnion.h - OverlayEdge.h - OverlayEdgeRing.h - OverlayGraph.h - OverlayLabel.h - OverlayLabeller.h - OverlayMixedPoints.h - OverlayNG.h - OverlayNGRobust.h - OverlayNodeFactory.h - OverlayPoints.h - OverlayResultValidator.h - OverlayUtil.h - ParseException.h - geomgraph/PlanarGraph.h - planargraph/PlanarGraph.h - Point.h - PointExtracter.h - PointGeometryUnion.h - PointInRing.h - PointLocation.h - PointLocator.h - PointOnGeometryLocator.h - PointPairDistance.h - PointwisePrecisionReducerTransformer.h - Polygon.h - PolygonalExtracter.h - overlay/PolygonBuilder.h - overlayng/PolygonBuilder.h - PolygonEarClipper.h - PolygonExtracter.h - PolygonHoleJoiner.h - PolygonHullSimplifier.h - PolygonIntersectionAnalyzer.h - PolygonizeDirectedEdge.h - PolygonizeEdge.h - PolygonizeGraph.h - Polygonizer.h - PolygonNoder.h - PolygonNodeTopology.h - PolygonRing.h - PolygonRingSelfNode.h - PolygonRingTouch.h - PolygonTopologyAnalyzer.h - PolygonTriangulator.h - Position.h - PrecisionModel.h - PrecisionReducer.h - PrecisionReducerCoordinateOperation.h - PrecisionReducerTransformer.h - PrecisionUtil.h - PreparedGeometry.h - PreparedGeometryFactory.h - PreparedLineString.h - PreparedLineStringDistance.h - PreparedLineStringIntersects.h - PreparedLineStringNearestPoints.h - PreparedPoint.h - PreparedPolygon.h - PreparedPolygonContains.h - PreparedPolygonContainsProperly.h - PreparedPolygonCovers.h - PreparedPolygonDistance.h - PreparedPolygonIntersects.h - PreparedPolygonPredicate.h - profiler.h - QuadEdge.h - QuadEdgeLocator.h - QuadEdgeQuartet.h - QuadEdgeSubdivision.h - Quadrant.h - Quadtree.h - RayCrossingCounter.h - algorithm/Rectangle.h - operation/intersection/Rectangle.h - RectangleContains.h - RectangleIntersection.h - RectangleIntersectionBuilder.h - RectangleIntersects.h - RelateComputer.h - RelateNode.h - RelateNodeFactory.h - RelateNodeGraph.h - RelateOp.h - RepeatedPointRemover.h - RepeatedPointTester.h - RightmostEdgeFinder.h - RingClipper.h - RingHull.h - RingHullIndex.h - RobustClipEnvelopeComputer.h - RobustDeterminant.h - bintree/Root.h - quadtree/Root.h - ryu.h - ScaledNoder.h - SegmentExtractingNoder.h - SegmentIntersectionDetector.h - SegmentIntersectionTester.h - geomgraph/index/SegmentIntersector.h - noding/SegmentIntersector.h - SegmentMCIndex.h - SegmentNode.h - SegmentNodeList.h - SegmentPointComparator.h - SegmentSetMutualIntersector.h - SegmentString.h - SegmentStringUtil.h - SharedPathsOp.h - ShortCircuitedGeometryVisitor.h - SimpleCurve.h - SimpleEdgeSetIntersector.h - SimpleGeometryPrecisionReducer.h - SimpleMCSweepLineIntersector.h - SimpleNoder.h - SimplePointInAreaLocator.h - SimplePointInRing.h - SimpleSTRdistance.h - SimpleSTRnode.h - SimpleSTRtree.h - SimpleSweepLineIntersector.h - SineStarFactory.h - SinglePassNoder.h - SIRtree.h - SnapOverlayOp.h - SnappingIntersectionAdder.h - SnappingNoder.h - SnappingPointIndex.h - SnapRoundingIntersectionAdder.h - SnapRoundingNoder.h - SortedPackedIntervalRTree.h - SpatialIndex.h - string.h - StringTokenizer.h - STRtree.h - Subgraph.h - SubgraphDepthLocater.h - Surface.h - SurfaceImpl.h - geomgraph/index/SweepLineEvent.h - index/sweepline/SweepLineEvent.h - SweepLineEventObj.h - SweepLineIndex.h - SweepLineInterval.h - SweepLineOverlapAction.h - SweepLineSegment.h - TaggedLineSegment.h - TaggedLinesSimplifier.h - TaggedLineString.h - TaggedLineStringSimplifier.h - TemplateSTRNode.h - TemplateSTRNodePair.h - TemplateSTRtree.h - TemplateSTRtreeDistance.h - TopologyException.h - TopologyLocation.h - TopologyPreservingSimplifier.h - TopologyValidationError.h - TPVWSimplifier.h - Tri.h - Triangle.h - TrianglePredicate.h - TriangleVisitor.h - TriangulationBuilder.h - TriDelaunayImprover.h - TriEdge.h - TriList.h - UnaryUnionNG.h - UnaryUnionOp.h - UnionFind.h - UnionStrategy.h - UniqueCoordinateArrayFilter.h - unload.h - UnsupportedOperationException.h - util.h - ValidatingNoder.h - Vertex.h - VertexRingCounter.h - VertexSequencePackedRtree.h - VoronoiDiagramBuilder.h - WKBConstants.h - WKBReader.h - WKBStreamReader.h - WKBWriter.h - WKTFileReader.h - WKTReader.h - WKTStreamReader.h - WKTWriter.h - Writer.h + CoveragePolygon.h + CoveragePolygonValidator.h + CoverageRing.h + CoverageRingEdges.h + CoverageSimplifier.h + coverage/CoverageUnion.h + operation/overlayng/CoverageUnion.h + operation/union/CoverageUnion.h + CoverageValidator.h + Curve.h + CurvePolygon.h + d2fixed_full_table.h + d2s_full_table.h + d2s_intrinsics.h + DBSCANClusterFinder.h + DD.h + DelaunayTriangulationBuilder.h + Densifier.h + Depth.h + digit_table.h + Dimension.h + geomgraph/DirectedEdge.h + planargraph/DirectedEdge.h + geomgraph/DirectedEdgeStar.h + planargraph/DirectedEdgeStar.h + DiscreteFrechetDistance.h + DiscreteHausdorffDistance.h + DisjointOperation.h + DisjointSubsetUnion.h + Distance.h + DistanceOp.h + DistanceToPoint.h + DouglasPeuckerLineSimplifier.h + DouglasPeuckerSimplifier.h + geomgraph/Edge.h + operation/overlayng/Edge.h + planargraph/Edge.h + EdgeEnd.h + EdgeEndBuilder.h + EdgeEndBundle.h + EdgeEndBundleStar.h + EdgeEndStar.h + EdgeGraph.h + EdgeGraphBuilder.h + EdgeIntersection.h + EdgeIntersectionList.h + EdgeKey.h + EdgeList.h + EdgeMerger.h + EdgeNodingBuilder.h + EdgeNodingValidator.h + geomgraph/EdgeRing.h + operation/polygonize/EdgeRing.h + EdgeSetIntersector.h + EdgeSourceInfo.h + EdgeString.h + ElevationModel.h + EnhancedPrecisionOp.h + Envelope.h + EnvelopeDistanceClusterFinder.h + EnvelopeIntersectsClusterFinder.h + EnvelopeUtil.h + export.h + ExtractLineByLocation.h + FacetSequence.h + FacetSequenceTreeBuilder.h + FastNodingValidator.h + FastSegmentSetIntersectionFinder.h + FuzzyPointLocator.h + GeoJSON.h + GeoJSONReader.h + GeoJSONWriter.h + geom.h + GeometricShapeFactory.h + Geometry.h + GeometryCollection.h + GeometryCombiner.h + GeometryComponentFilter.h + GeometryDistanceClusterFinder.h + GeometryEditor.h + GeometryEditorOperation.h + GeometryExtracter.h + GeometryFactory.h + GeometryFilter.h + GeometryFixer.h + GeometryFlattener.h + GeometryGraph.h + GeometryGraphOperation.h + GeometryIntersectsClusterFinder.h + GeometryItemDistance.h + GeometryLocation.h + GeometryMapper.h + GeometryNoder.h + GeometryPrecisionReducer.h + GeometrySnapper.h + GeometryTransformer.h + geos.h + geos_c.hC API for the GEOS geometry algorithms library + GEOSException.h + geomgraph/GraphComponent.h + planargraph/GraphComponent.h + HalfEdge.h + HCoordinate.h + HeuristicOverlay.h + HilbertCode.h + HilbertEncoder.h + HoleAssigner.h + HotPixel.h + HotPixelIndex.h + HullTri.h + HullTriangulation.h + IllegalArgumentException.h + IllegalStateException.h + IncrementalDelaunayTriangulator.h + IndexedDistanceToPoint.h + IndexedFacetDistance.h + IndexedNestedHoleTester.h + IndexedNestedPolygonTester.h + IndexedPointInAreaLocator.h + IndexedPointInPolygonsLocator.h + IndexedPointOnLineLocator.h + InputGeometry.h + InteriorPointArea.h + InteriorPointLine.h + InteriorPointPoint.h + Interpolate.h + Interrupt.h + Intersection.h + IntersectionAdder.h + IntersectionFinderAdder.h + IntersectionMatrix.h + IntersectionPointBuilder.h + bintree/Interval.h + strtree/Interval.h + IntervalRTreeBranchNode.h + IntervalRTreeLeafNode.h + IntervalRTreeNode.h + IntervalSize.h + InvalidSegmentDetector.h + IsSimpleOp.h + IsValidOp.h + ItemBoundable.h + ItemDistance.h + ItemVisitor.h + IteratedNoder.h + KdNode.h + KdNodeVisitor.h + KdTree.h + bintree/Key.h + quadtree/Key.h + Label.h + LargestEmptyCircle.h + LastFoundQuadEdgeLocator.h + Length.h + LengthIndexedLine.h + LengthIndexOfPoint.h + LengthLocationMap.h + LinearComponentExtracter.h + LinearGeometryBuilder.h + LinearIterator.h + LinearLocation.h + LinearRing.h + LineBuilder.h + LineIntersector.h + LineLimiter.h + LineMergeDirectedEdge.h + LineMergeEdge.h + LineMergeGraph.h + LineMerger.h + LineSegment.h + LineSegmentIndex.h + LineSequencer.h + LineString.h + LineStringSnapper.h + LinkedLine.h + LinkedRing.h + LocateFailureException.h + Location.h + LocationIndexedLine.h + LocationIndexOfLine.h + LocationIndexOfPoint.h + Machine.h + MakeValid.h + MarkHalfEdge.h + math.h + overlay/MaximalEdgeRing.h + overlayng/MaximalEdgeRing.h + MaximumInscribedCircle.h + MCIndexNoder.h + MCIndexPointSnapper.h + MCIndexSegmentSetMutualIntersector.h + MCIndexSnapRounder.h + MinimalEdgeRing.h + MinimumAreaRectangle.h + MinimumBoundingCircle.h + MinimumClearance.h + MinimumDiameter.h + geomgraph/index/MonotoneChain.h + index/chain/MonotoneChain.h + MonotoneChainBuilder.h + MonotoneChainEdge.h + MonotoneChainIndexer.h + MonotoneChainOverlapAction.h + MonotoneChainSelectAction.h + MortonCode.h + MultiCurve.h + MultiLineString.h + MultiPoint.h + MultiPolygon.h + MultiSurface.h + namespaces.h + NodableSegmentString.h + geomgraph/Node.h + index/bintree/Node.h + index/quadtree/Node.h + planargraph/Node.h + bintree/NodeBase.h + quadtree/NodeBase.h + NodedSegmentString.h + NodeFactory.h + geomgraph/NodeMap.h + planargraph/NodeMap.h + Noder.h + NodingIntersectionFinder.h + NodingValidator.h + NoOpGeometryOperation.h + NotRepresentableException.h + Octant.h + OffsetCurve.h + OffsetCurveBuilder.h + OffsetCurveSection.h + OffsetPointGenerator.h + OffsetSegmentGenerator.h + OffsetSegmentString.h + OrdinateSet.h + Orientation.h + OrientedCoordinateArray.h + OverlapUnion.h + OverlayEdge.h + OverlayEdgeRing.h + OverlayGraph.h + OverlayLabel.h + OverlayLabeller.h + OverlayMixedPoints.h + OverlayNG.h + OverlayNGRobust.h + OverlayNodeFactory.h + OverlayPoints.h + OverlayResultValidator.h + OverlayUtil.h + ParseException.h + geomgraph/PlanarGraph.h + planargraph/PlanarGraph.h + Point.h + PointExtracter.h + PointGeometryUnion.h + PointInRing.h + PointLocation.h + PointLocator.h + PointOnGeometryLocator.h + PointPairDistance.h + PointwisePrecisionReducerTransformer.h + Polygon.h + PolygonalExtracter.h + overlay/PolygonBuilder.h + overlayng/PolygonBuilder.h + PolygonEarClipper.h + PolygonExtracter.h + PolygonHoleJoiner.h + PolygonHullSimplifier.h + PolygonIntersectionAnalyzer.h + PolygonizeDirectedEdge.h + PolygonizeEdge.h + PolygonizeGraph.h + Polygonizer.h + PolygonNoder.h + PolygonNodeTopology.h + PolygonRing.h + PolygonRingSelfNode.h + PolygonRingTouch.h + PolygonTopologyAnalyzer.h + PolygonTriangulator.h + Position.h + PrecisionModel.h + PrecisionReducer.h + PrecisionReducerCoordinateOperation.h + PrecisionReducerTransformer.h + PrecisionUtil.h + PreparedGeometry.h + PreparedGeometryFactory.h + PreparedLineString.h + PreparedLineStringDistance.h + PreparedLineStringIntersects.h + PreparedLineStringNearestPoints.h + PreparedPoint.h + PreparedPolygon.h + PreparedPolygonContains.h + PreparedPolygonContainsProperly.h + PreparedPolygonCovers.h + PreparedPolygonDistance.h + PreparedPolygonIntersects.h + PreparedPolygonPredicate.h + profiler.h + QuadEdge.h + QuadEdgeLocator.h + QuadEdgeQuartet.h + QuadEdgeSubdivision.h + Quadrant.h + Quadtree.h + RayCrossingCounter.h + algorithm/Rectangle.h + operation/intersection/Rectangle.h + RectangleContains.h + RectangleIntersection.h + RectangleIntersectionBuilder.h + RectangleIntersects.h + RelateComputer.h + RelateNode.h + RelateNodeFactory.h + RelateNodeGraph.h + RelateOp.h + RepeatedPointRemover.h + RepeatedPointTester.h + RightmostEdgeFinder.h + RingClipper.h + RingHull.h + RingHullIndex.h + RobustClipEnvelopeComputer.h + RobustDeterminant.h + bintree/Root.h + quadtree/Root.h + ryu.h + ScaledNoder.h + SegmentExtractingNoder.h + SegmentIntersectionDetector.h + SegmentIntersectionTester.h + geomgraph/index/SegmentIntersector.h + noding/SegmentIntersector.h + SegmentMCIndex.h + SegmentNode.h + SegmentNodeList.h + SegmentPointComparator.h + SegmentSetMutualIntersector.h + SegmentString.h + SegmentStringUtil.h + SharedPathsOp.h + ShortCircuitedGeometryVisitor.h + SimpleCurve.h + SimpleEdgeSetIntersector.h + SimpleGeometryPrecisionReducer.h + SimpleMCSweepLineIntersector.h + SimpleNoder.h + SimplePointInAreaLocator.h + SimplePointInRing.h + SimpleSTRdistance.h + SimpleSTRnode.h + SimpleSTRtree.h + SimpleSweepLineIntersector.h + SineStarFactory.h + SinglePassNoder.h + SIRtree.h + SnapOverlayOp.h + SnappingIntersectionAdder.h + SnappingNoder.h + SnappingPointIndex.h + SnapRoundingIntersectionAdder.h + SnapRoundingNoder.h + SortedPackedIntervalRTree.h + SpatialIndex.h + string.h + StringTokenizer.h + STRtree.h + Subgraph.h + SubgraphDepthLocater.h + Surface.h + SurfaceImpl.h + geomgraph/index/SweepLineEvent.h + index/sweepline/SweepLineEvent.h + SweepLineEventObj.h + SweepLineIndex.h + SweepLineInterval.h + SweepLineOverlapAction.h + SweepLineSegment.h + TaggedLineSegment.h + TaggedLinesSimplifier.h + TaggedLineString.h + TaggedLineStringSimplifier.h + TemplateSTRNode.h + TemplateSTRNodePair.h + TemplateSTRtree.h + TemplateSTRtreeDistance.h + TopologyException.h + TopologyLocation.h + TopologyPreservingSimplifier.h + TopologyValidationError.h + TPVWSimplifier.h + Tri.h + Triangle.h + TrianglePredicate.h + TriangleVisitor.h + TriangulationBuilder.h + TriDelaunayImprover.h + TriEdge.h + TriList.h + UnaryUnionNG.h + UnaryUnionOp.h + UnionFind.h + UnionStrategy.h + UniqueCoordinateArrayFilter.h + unload.h + UnsupportedOperationException.h + util.h + ValidatingNoder.h + Vertex.h + VertexRingCounter.h + VertexSequencePackedRtree.h + VoronoiDiagramBuilder.h + WKBConstants.h + WKBReader.h + WKBStreamReader.h + WKBWriter.h + WKTFileReader.h + WKTReader.h + WKTStreamReader.h + WKTWriter.h + Writer.h diff --git a/doxygen/functions_e.html b/doxygen/functions_e.html index bb179eb49b..fdec25e81e 100644 --- a/doxygen/functions_e.html +++ b/doxygen/functions_e.html @@ -96,7 +96,7 @@

- e -