306namespace triangulate {
310 namespace quadedge {}
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
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