GEOS 3.13.1
namespaces.h
1/**********************************************************************
2 *
3 * GEOS - Geometry Engine Open Source
4 * http://geos.osgeo.org
5 *
6 * Copyright (C) 2001-2002 Vivid Solutions Inc.
7 * Copyright (C) 2005-2006 Refractions Research Inc.
8 * Copyright (C) 2019 Nicklas Larsson
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#pragma once
18
19namespace geos {
20
65 namespace algorithm { // geos::algorithm
66
68 namespace distance {}
69
71 namespace locate {}
72} // namespace geos::algorithm
73
74namespace geom { // geos.geom
75
79 namespace prep {}
80
83 namespace util {}
84} // namespace geos.geom
85
106namespace geomgraph { // geos.geomgraph
107
111 namespace index {}
112} // namespace geos.geomgraph
113
114
116namespace index { // geos.index
117
119 namespace bintree {}
120
122 namespace chain {}
123
127 namespace intervalrtree {}
128
130 namespace quadtree {}
131
134 namespace strtree {}
135
138 namespace sweepline {}
139} // namespace geos.index
140
163namespace io {}
164
167namespace linearref {}
168
171namespace noding { // geos.noding
172
175 namespace snapround {}
176} // namespace geos.noding
177
179namespace operation { // geos.operation
180
182 namespace buffer {}
183
185 namespace distance {}
186
189 namespace intersection {}
190
192 namespace linemerge {}
193
229 namespace overlay {}
230
232 namespace polygonize {}
233
236 namespace predicate {}
237
280 namespace relate {}
281
283 namespace sharedpaths {}
284
286 namespace geounion {}
287
289 namespace valid {}
290} // namespace geos.operation
291
293namespace planargraph { // geos::planargraph
294
296 namespace algorithm {}
297} // namespace geos::planargraph
298
300namespace precision {}
301
303namespace simplify {}
304
306namespace triangulate { // geos.triangulate
307
310 namespace quadedge {}
311} // namespace geos.triangulate
312
314namespace util {}
315
316} // namespace geos
317
Classes to compute distance metrics between geometries.
Definition DiscreteFrechetDistance.h:59
Classes which determine the Location of points in geometries.
Definition IndexedPointInAreaLocator.h:40
Contains classes and interfaces implementing fundamental computational geometry algorithms.
Definition Angle.h:32
Contains classes and interfaces implementing algorithms that optimize the performance of repeated cal...
Definition AbstractPreparedPolygonContains.h:30
Provides classes that parse and modify Geometry objects.
Definition ComponentCoordinateExtracter.h:28
Definition Angle.h:26
Contains classes that implement indexes for performing noding on geometry graph edges.
Definition geomgraph/Edge.h:53
Contains classes that implement topology graphs.
Definition Depth.h:31
Contains classes that implement a Binary Interval Tree index.
Definition Bintree.h:28
Contains classes that implement Monotone Chains.
Definition index/chain/MonotoneChain.h:35
Contains classes that implement a static index on a set of 1-dimensional intervals,...
Definition DiscreteFrechetDistance.h:51
Contains classes that implement a Quadtree spatial index.
Definition IntervalSize.h:25
Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree.
Definition AbstractNode.h:31
Contains classes which implement a sweepline algorithm for scanning geometric data structures.
Definition index/sweepline/SweepLineEvent.h:23
Provides classes for various kinds of spatial indexes.
Definition DiscreteFrechetDistance.h:50
Contains the interfaces for converting JTS objects to and from other formats.
Definition Geometry.h:65
Contains classes and interfaces implementing linear referencing on linear geometries.
Definition ExtractLineByLocation.h:27
Contains classes to implement the Snap Rounding algorithm for noding linestrings.
Definition namespaces.h:175
Classes to compute nodings for arrangements of line segments and line segment sequences.
Definition InvalidSegmentDetector.h:25
Provides classes for computing buffers of geometries.
Definition namespaces.h:182
Provides classes for computing the distance between geometries.
Definition namespaces.h:185
Classes to perform efficient unioning of collections of geometries.
Definition namespaces.h:286
Provides classes for computing the intersection of a Geometry and a clipping Rectangle.
Definition namespaces.h:189
Line merging package.
Definition namespaces.h:192
Contains classes that perform a topological overlay to compute boolean spatial functions.
Definition namespaces.h:229
An API for polygonizing sets of lines.
Definition namespaces.h:232
Classes which implement topological predicates optimized for particular kinds of geometries.
Definition namespaces.h:236
Contains classes to implement the computation of the spatial relationships of Geometrys.
Definition namespaces.h:280
Find shared paths among two linear Geometry objects.
Definition namespaces.h:283
Provides classes for testing the validity of geometries.
Definition namespaces.h:289
Provides classes for implementing operations on geometries.
Definition namespaces.h:179
Planargraph algorithms.
Definition namespaces.h:296
Contains classes to implement a planar graph data structure.
Definition namespaces.h:293
Provides classes for manipulating the precision model of Geometries.
Definition namespaces.h:300
Classes which implement algorithms for simplifying or generalizing geometries.
Definition Corner.h:26
Utility classes for GEOS.
Definition namespaces.h:314
Basic namespace for all GEOS functionalities.
Definition geos.h:39