| ▼Ngeos | Basic namespace for all GEOS functionalities |
| ▶Nalgorithm | Contains classes and interfaces implementing fundamental computational geometry algorithms |
| ▶Ndistance | |
| CDiscreteFrechetDistance | An algorithm for computing a distance metric which is an approximation to the Frechet Distance based on a discretization of the input Geometry |
| CDiscreteHausdorffDistance | An algorithm for computing a distance metric which is an approximation to the Hausdorff Distance based on a discretization of the input Geometry |
| CDistanceToPoint | |
| CPointPairDistance | |
| ▶Nlocate | Classes which determine the Location of points in geometries |
| CIndexedPointInAreaLocator | Determines the location of Coordinates relative to a Polygon or MultiPolygon geometry, using indexing for efficiency |
| CPointOnGeometryLocator | An interface for classes which determine the Location of points in Polygon or MultiPolygon geometries |
| CSimplePointInAreaLocator | Computes the location of points relative to an areal Geometry, using a simple O(n) algorithm |
| CAngle | Utility functions for working with angles |
| CBoundaryNodeRule | |
| CCentralEndpointIntersector | Computes an approximate intersection of two line segments by taking the most central of the endpoints of the segments |
| CCentroid | |
| CCentroidArea | Computes the centroid of an area geometry |
| CCentroidLine | |
| CCentroidPoint | |
| CCGAlgorithms | Specifies and implements various fundamental Computational Geometric algorithms. The algorithms supplied in this class are robust for double-precision floating point |
| CConvexHull | |
| CHCoordinate | Represents a homogeneous coordinate in a 2-D coordinate space |
| CInteriorPointArea | Computes a point in the interior of an areal geometry |
| CInteriorPointLine | Computes a point in the interior of an linear geometry |
| CInteriorPointPoint | Computes a point in the interior of an point geometry |
| CLineIntersector | A LineIntersector is an algorithm that can both test whether two line segments intersect and compute the intersection point if they do |
| CMinimumDiameter | Computes the minimum diameter of a geom::Geometry |
| CNotRepresentableException | Indicates that a HCoordinate has been computed which is not representable on the Cartesian plane |
| CPointLocator | Computes the topological relationship (Location) of a single point to a Geometry |
| CRayCrossingCounter | Counts the number of segments crossed by a horizontal ray extending to the right from a given point, in an incremental fashion |
| CRobustDeterminant | Implements an algorithm to compute the sign of a 2x2 determinant for double precision values robustly |
| ▶Ngeom | Contains the Geometry interface hierarchy and supporting classes |
| ▶Nprep | |
| CAbstractPreparedPolygonContains | A base class containing the logic for computes the contains and covers spatial relationship predicates for a PreparedPolygon relative to all other Geometry classes |
| CBasicPreparedGeometry | A base class for PreparedGeometry subclasses |
| CPreparedGeometry | An interface for classes which prepare Geometrys in order to optimize the performance of repeated calls to specific geometric operations |
| CPreparedGeometryFactory | A factory for creating PreparedGeometrys |
| CPreparedLineString | A prepared version of LinearRing, LineString or MultiLineString geometries |
| CPreparedLineStringIntersects | Computes the intersects spatial relationship predicate for a target PreparedLineString relative to all other Geometry classes |
| CPreparedPoint | A prepared version of Point or MultiPoint geometries |
| CPreparedPolygon | A prepared version of Polygon or MultiPolygon geometries |
| CPreparedPolygonContains | Computes the contains spatial relationship predicate for a PreparedPolygon relative to all other Geometry classes |
| CPreparedPolygonContainsProperly | Computes the containsProperly spatial relationship predicate for PreparedPolygons relative to all other Geometry classes |
| CPreparedPolygonCovers | Computes the covers spatial relationship predicate for a PreparedPolygon relative to all other Geometry classes |
| CPreparedPolygonIntersects | Computes the intersects spatial relationship predicate for PreparedPolygons relative to all other Geometry classes |
| CPreparedPolygonPredicate | A base class for predicate operations on PreparedPolygons |
| ▶Nutil | Provides classes that parse and modify Geometry objects |
| CComponentCoordinateExtracter | Extracts a single representative Coordinate from each connected component of a Geometry |
| CCoordinateOperation | |
| CGeometryCombiner | |
| CGeometryEditor | |
| CGeometryEditorOperation | |
| CGeometryExtracter | |
| CGeometryTransformer | A framework for processes which transform an input Geometry into an output Geometry, possibly changing its structure and type(s) |
| CLinearComponentExtracter | |
| CPointExtracter | |
| CPolygonExtracter | |
| CShortCircuitedGeometryVisitor | A visitor to Geometry elements which can be short-circuited by a given condition |
| CSineStarFactory | |
| CCoordinate | Coordinate is the lightweight class used to store coordinates |
| CCoordinateArraySequence | The default implementation of CoordinateSequence |
| CCoordinateArraySequenceFactory | Creates CoordinateSequences internally represented as an array of Coordinates |
| CCoordinateFilter | |
| CCoordinateLessThen | Strict weak ordering Functor for Coordinate |
| CCoordinateList | A list of Coordinates, which may be set to prevent repeated coordinates from occuring in the list |
| CCoordinateSequence | The internal representation of a list of coordinates inside a Geometry |
| CCoordinateSequenceFactory | A factory to create concrete instances of CoordinateSequences |
| CCoordinateSequenceFilter | |
| CDimension | Constants representing the dimensions of a point, a curve and a surface |
| CEnvelope | An Envelope defines a rectangulare region of the 2D coordinate plane |
| CGeometry | Basic implementation of Geometry, constructed and destructed by GeometryFactory |
| CGeometryCollection | Represents a collection of heterogeneous Geometry objects |
| CGeometryComponentFilter | |
| CGeometryFactory | Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geometry objects |
| CGeometryFilter | Geometry classes support the concept of applying a Geometry filter to the Geometry |
| CIntersectionMatrix | Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix |
| CLineal | |
| CLinearRing | Models an OGC SFS LinearRing |
| CLineSegment | |
| CLineString | |
| CLocation | Constants representing the location of a point relative to a geometry |
| CMultiLineString | Models a collection of (}s |
| CMultiPoint | |
| CMultiPolygon | Models a collection of Polygons |
| CPoint | |
| CPolygon | Represents a linear polygon, which may include holes |
| CPolygonal | |
| CPrecisionModel | Specifies the precision model of the Coordinate in a Geometry |
| CPuntal | |
| CTriangle | Represents a planar triangle, and provides methods for calculating various properties of triangles |
| CTrianglePredicate | |
| ▶Ngeomgraph | Contains classes that implement topology graphs |
| ▶Nindex | |
| CMonotoneChain | |
| CSimpleMCSweepLineIntersector | Finds all intersections in one or two sets of edges, using an x-axis sweepline algorithm in conjunction with Monotone Chains |
| CSimpleSweepLineIntersector | Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm |
| CDirectedEdge | A directed EdgeEnd |
| CDirectedEdgeStar | A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node |
| CEdge | |
| CEdgeEnd | Models the end of an edge incident on a node |
| CEdgeEndStar | A EdgeEndStar is an ordered list of EdgeEnds around a node |
| CEdgeIntersection | |
| CEdgeIntersectionList | |
| CEdgeList | |
| CEdgeNodingValidator | Validates that a collection of SegmentStrings is correctly noded |
| CEdgeRing | |
| CGeometryGraph | |
| CGraphComponent | A GraphComponent is the parent class for the objects' that form a graph |
| CLabel | A Label indicates the topological relationship of a component of a topology graph to a given Geometry. This class supports labels for relationships to two Geometrys, which is sufficient for algorithms for binary operations |
| CNode | |
| CPlanarGraph | Represents a directed graph which is embeddable in a planar surface |
| CTopologyLocation | A TopologyLocation is the labelling of a GraphComponent's topological relationship to a single Geometry |
| ▶Nindex | Provides classes for various kinds of spatial indexes |
| ▶Nbintree | Contains classes that implement a Binary Interval Tree index |
| CBintree | An BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree |
| CInterval | Represents an (1-dimensional) closed interval on the Real number line |
| CKey | A Key is a unique identifier for a node in a tree |
| CNode | A node of a Bintree |
| CNodeBase | The base class for nodes in a Bintree |
| CRoot | The root node of a single Bintree |
| ▶Nchain | Contains classes that implement Monotone Chains |
| CMonotoneChain | Monotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of intersections |
| CMonotoneChainBuilder | Constructs MonotoneChains for sequences of Coordinates |
| CMonotoneChainOverlapAction | |
| CMonotoneChainSelectAction | |
| ▶Nintervalrtree | |
| CSortedPackedIntervalRTree | A static index on a set of 1-dimensional intervals, using an R-Tree packed based on the order of the interval midpoints |
| ▶Nquadtree | Contains classes that implement a Quadtree spatial index |
| CDoubleBits | DoubleBits manipulates Double numbers by using bit manipulation and bit-field extraction |
| CIntervalSize | Provides a test for whether an interval is so small it should be considered as zero for the purposes of inserting it into a binary tree |
| CKey | A Key is a unique identifier for a node in a quadtree |
| CNode | Represents a node of a Quadtree |
| CNodeBase | The base class for nodes in a Quadtree |
| CQuadtree | A Quadtree is a spatial index structure for efficient querying of 2D rectangles. If other kinds of spatial objects need to be indexed they can be represented by their envelopes |
| CRoot | QuadRoot is the root of a single Quadtree. It is centred at the origin, and does not have a defined extent |
| ▶Nstrtree | Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree |
| CAbstractNode | A node of the STR tree |
| ▶CAbstractSTRtree | Base class for STRtree and SIRtree |
| CIntersectsOp | A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds |
| CBoundable | A spatial object in an AbstractSTRtree |
| CInterval | A contiguous portion of 1D-space. Used internally by SIRtree |
| CItemBoundable | Boundable wrapper for a non-Boundable spatial object. Used internally by AbstractSTRtree |
| CSIRtree | One-dimensional version of an STR-packed R-tree |
| CSTRtree | A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data |
| ▶Nsweepline | Contains classes which implement a sweepline algorithm for scanning geometric data structures |
| CSweepLineIndex | A sweepline implements a sorted index on a set of intervals |
| CItemVisitor | A visitor for items in an index |
| CSpatialIndex | Abstract class defines basic insertion and query operations supported by classes implementing spatial index algorithms |
| ▶Nio | Contains the interfaces for converting JTS objects to and from other formats |
| CParseException | Notifies a parsing error |
| CWKBReader | Reads a Geometry from Well-Known Binary format |
| CWKBWriter | Writes a Geometry into Well-Known Binary format |
| CWKTReader | WKT parser class; see also WKTWriter |
| CWKTWriter | Outputs the textual representation of a Geometry. See also WKTReader |
| ▶Nlinearref | |
| CExtractLineByLocation | |
| CLengthIndexedLine | Supports linear referencing along a linear Geometry using the length along the line as the index. Negative length values are taken as measured in the reverse direction from the end of the geometry. Out-of-range index values are handled by clamping them to the valid range of values. Non-simple lines (i.e. which loop back to cross or touch themselves) are supported |
| CLengthIndexOfPoint | Computes the length index of the point on a linear Geometry nearest a given Coordinate |
| CLengthLocationMap | |
| CLinearGeometryBuilder | |
| CLinearIterator | An iterator over the components and coordinates of a linear geometry (LineString or MultiLineString) |
| CLinearLocation | Represents a location along a LineString or MultiLineString |
| CLocationIndexedLine | Supports linear referencing along a linear Geometry using LinearLocations as the index |
| CLocationIndexOfLine | |
| CLocationIndexOfPoint | |
| ▶Nnoding | Classes to compute nodings for arrangements of line segments and line segment sequences |
| ▶Nsnapround | Contains classes to implement the Snap Rounding algorithm for noding linestrings |
| CHotPixel | Implements a "hot pixel" as used in the Snap Rounding algorithm |
| CMCIndexPointSnapper | "Snaps" all SegmentStrings in a SpatialIndex containing MonotoneChains to a given HotPixel |
| CMCIndexSnapRounder | Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of SegmentString |
| CSimpleSnapRounder | Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of SegmentStrings |
| CBasicSegmentString | |
| CFastNodingValidator | Validates that a collection of SegmentStrings is correctly noded |
| CFastSegmentSetIntersectionFinder | Finds if two sets of SegmentStringss intersect |
| CIntersectionAdder | |
| CIntersectionFinderAdder | Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes |
| CIteratedNoder | Nodes a set of SegmentStrings completely |
| CMCIndexNoder | Nodes a set of SegmentString using a index based on index::chain::MonotoneChain and a index::SpatialIndex |
| CMCIndexSegmentSetMutualIntersector | Intersects two sets of SegmentStrings using a index based on MonotoneChains and a SpatialIndex |
| CNodableSegmentString | An interface for classes which support adding nodes to a segment string |
| CNodedSegmentString | Represents a list of contiguous line segments, and supports noding the segments |
| CNoder | Computes all intersections between segments in a set of SegmentString |
| CNodingValidator | |
| COctant | Methods for computing and working with octants of the Cartesian plane |
| COrientedCoordinateArray | Allows comparing geom::CoordinateSequences in an orientation-independent way |
| CScaledNoder | Wraps a Noder and transforms its input into the integer domain |
| CSegmentIntersectionDetector | Detects and records an intersection between two SegmentStrings, if one exists |
| CSegmentIntersector | Processes possible intersections detected by a Noder |
| CSegmentNode | Represents an intersection point between two NodedSegmentString |
| CSegmentNodeList | A list of the SegmentNode present along a NodedSegmentString |
| CSegmentPointComparator | |
| CSegmentSetMutualIntersector | An intersector for the red-blue intersection problem |
| CSegmentString | An interface for classes which represent a sequence of contiguous line segments |
| CSegmentStringUtil | Utility methods for processing SegmentStrings |
| CSimpleNoder | Nodes a set of SegmentStrings by performing a brute-force comparison of every segment to every other one |
| CSingleInteriorIntersectionFinder | Finds an interior intersection in a set of SegmentString, if one exists. Only the first intersection found is reported |
| CSinglePassNoder | |
| ▶Noperation | Provides classes for implementing operations on geometries |
| ▶Nbuffer | Provides classes for computing buffers of geometries |
| CBufferBuilder | Builds the buffer geometry for a given input geometry and precision model |
| CBufferInputLineSimplifier | Simplifies a buffer input line to remove concavities with shallow depth |
| CBufferOp | Computes the buffer of a geometry, for both positive and negative buffer distances |
| CBufferParameters | Contains the parameters which describe how a buffer should be constructed |
| CBufferSubgraph | A connected subset of the graph of DirectedEdge and geomgraph::Node |
| COffsetCurveBuilder | Computes the raw offset curve for a single Geometry component (ring, line or point) |
| COffsetCurveSetBuilder | Creates all the raw offset curves for a buffer of a Geometry |
| COffsetSegmentGenerator | |
| COffsetSegmentString | A dynamic list of the vertices in a constructed offset curve |
| CRightmostEdgeFinder | A RightmostEdgeFinder find the geomgraph::DirectedEdge in a list which has the highest coordinate, and which is oriented L to R at that point. (I.e. the right side is on the RHS of the edge.) |
| CSubgraphDepthLocater | Locates a subgraph inside a set of subgraphs, in order to determine the outside depth of the subgraph |
| ▶Ndistance | Provides classes for computing the distance between geometries |
| CConnectedElementLocationFilter | A ConnectedElementPointFilter extracts a single point from each connected element in a Geometry (e.g. a polygon, linestring or point) and returns them in a list. The elements of the list are DistanceOp::GeometryLocation |
| CConnectedElementPointFilter | Extracts a single point from each connected element in a Geometry (e.g. a polygon, linestring or point) and returns them in a list |
| CDistanceOp | Find two points on two Geometrys which lie within a given distance, or else are the nearest points on the geometries (in which case this also provides the distance between the geometries) |
| CGeometryLocation | Represents the location of a point on a Geometry |
| ▶Ngeounion | |
| CCascadedPolygonUnion | Provides an efficient method of unioning a collection of Polygonal geometries. This algorithm is faster and likely more robust than the simple iterated approach of repeatedly unioning each polygon to a result geometry |
| CCascadedUnion | Provides an efficient method of unioning a collection of Geometries |
| CGeometryListHolder | Helper class holding Geometries, part of which are held by reference others are held exclusively |
| CPointGeometryUnion | Computes the union of a Puntal geometry with another arbitrary Geometry |
| CUnaryUnionOp | |
| ▶Nintersection | |
| CRectangle | Clipping rectangle |
| CRectangleIntersection | Speed-optimized clipping of a Geometry with a rectangle |
| CRectangleIntersectionBuilder | Rebuild geometries from subpaths left by clipping with a rectangle |
| ▶Nlinemerge | Line merging package |
| CEdgeString | A sequence of LineMergeDirectedEdge forming one of the lines that will be output by the line-merging process |
| CLineMergeDirectedEdge | A planargraph::DirectedEdge of a LineMergeGraph |
| CLineMergeEdge | An edge of a LineMergeGraph. The marked field indicates whether this Edge has been logically deleted from the graph |
| CLineMergeGraph | A planar graph of edges that is analyzed to sew the edges together |
| CLineMerger | Sews together a set of fully noded LineStrings |
| CLineSequencer | Builds a sequence from a set of LineStrings so that they are ordered end to end |
| ▶Noverlay | Contains classes that perform a topological overlay to compute boolean spatial functions |
| ▶Nsnap | |
| CGeometrySnapper | Snaps the vertices and segments of a Geometry to another Geometry's vertices |
| CLineStringSnapper | Snaps the vertices and segments of a LineString to a set of target snap vertices |
| CSnapIfNeededOverlayOp | Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result |
| CSnapOverlayOp | Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result |
| ▶Nvalidate | |
| CFuzzyPointLocator | Finds the most likely Location of a point relative to the polygonal components of a geometry, using a tolerance value |
| COffsetPointGenerator | Generates points offset from both sides of all segments in a geometry |
| COverlayResultValidator | Validates that the result of an overlay operation is geometrically correct within a determined tolerance |
| CEdgeSetNoder | Nodes a set of edges |
| CLineBuilder | Forms JTS LineStrings out of a the graph of geomgraph::DirectedEdge created by an OverlayOp |
| CMaximalEdgeRing | A ring of edges which may contain nodes of degree > 2 |
| CMinimalEdgeRing | A ring of Edges with the property that no node has degree greater than 2 |
| COverlayNodeFactory | Creates nodes for use in the geomgraph::PlanarGraph constructed during overlay operations. NOTE: also used by operation::valid |
| CoverlayOp | OverlayOp::overlayOp Adapter for use with geom::BinaryOp |
| COverlayOp | Computes the geometric overlay of two Geometry |
| CPointBuilder | Constructs geom::Point s from the nodes of an overlay graph |
| CPolygonBuilder | Forms Polygon out of a graph of geomgraph::DirectedEdge |
| ▶Npolygonize | |
| CEdgeRing | Represents a ring of PolygonizeDirectedEdge which form a ring of a polygon. The ring may be either an outer shell or a hole |
| CPolygonizeDirectedEdge | A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph |
| CPolygonizeGraph | Represents a planar graph of edges that can be used to compute a polygonization, and implements the algorithms to compute the EdgeRings formed by the graph |
| CPolygonizer | Polygonizes a set of Geometrys which contain linework that represents the edges of a planar graph |
| ▶Npredicate | |
| CRectangleContains | Optimized implementation of spatial predicate "contains" for cases where the first Geometry is a rectangle |
| CRectangleIntersects | Optimized implementation of the "intersects" spatial predicate for cases where one Geometry is a rectangle |
| CSegmentIntersectionTester | Tests if any line segments in two sets of CoordinateSequences intersect |
| ▶Nrelate | Contains classes to implement the computation of the spatial relationships of Geometrys |
| CEdgeEndBuilder | Computes the geomgraph::EdgeEnd objects which arise from a noded geomgraph::Edge |
| CEdgeEndBundle | A collection of geomgraph::EdgeEnd objects which originate at the same point and have the same direction |
| CEdgeEndBundleStar | An ordered list of EdgeEndBundle objects around a RelateNode |
| CRelateComputer | Computes the topological relationship between two Geometries |
| CRelateNode | Represents a node in the topological graph used to compute spatial relationships |
| CRelateNodeFactory | Used by the geomgraph::NodeMap in a RelateNodeGraph to create RelateNode objects |
| CRelateNodeGraph | Implements the simple graph of Nodes and geomgraph::EdgeEnd which is all that is required to determine topological relationships between Geometries |
| CRelateOp | Implements the SFS relate() operation on two geom::Geometry objects |
| ▶Nsharedpaths | |
| CSharedPathsOp | Find shared paths among two linear Geometry objects |
| ▶Nvalid | Provides classes for testing the validity of geometries |
| CConnectedInteriorTester | This class tests that the interior of an area Geometry (Polygon or MultiPolygon) is connected |
| CConsistentAreaTester | Checks that a geomgraph::GeometryGraph representing an area (a Polygon or MultiPolygon ) is consistent with the OGC-SFS semantics for area geometries |
| CIndexedNestedRingTester | Tests whether any of a set of LinearRings are nested inside another ring in the set, using a spatial index to speed up the comparisons |
| CIsValidOp | Implements the algorithsm required to compute the isValid() method for Geometrys |
| CQuadtreeNestedRingTester | Tests whether any of a set of LinearRings are nested inside another ring in the set, using a Quadtree index to speed up the comparisons |
| CRepeatedPointTester | Implements the appropriate checks for repeated points (consecutive identical coordinates) as defined in the JTS spec |
| CSimpleNestedRingTester | Tests whether any of a set of LinearRings are nested inside another ring in the set, using a simple O(n^2) comparison |
| CSweeplineNestedRingTester | Tests whether any of a set of LinearRings are nested inside another ring in the set, using an index::sweepline::SweepLineIndex to speed up the comparisons |
| CTopologyValidationError | Contains information about the nature and location of a Geometry validation error |
| CGeometryGraphOperation | The base class for operations that require GeometryGraph |
| CIsSimpleOp | Tests whether a Geometry is simple |
| ▶Nplanargraph | Contains classes to implement a planar graph data structure |
| ▶Nalgorithm | Planargraph algorithms |
| CConnectedSubgraphFinder | Finds all connected Subgraphs of a PlanarGraph |
| CDirectedEdge | Represents a directed edge in a PlanarGraph |
| CDirectedEdgeStar | A sorted collection of DirectedEdge which leave a Node in a PlanarGraph |
| CEdge | Represents an undirected edge of a PlanarGraph |
| CGraphComponent | The base class for all graph component classes |
| CNode | A node in a PlanarGraph is a location where 0 or more Edge meet |
| CNodeMap | A map of Node, indexed by the coordinate of the node |
| CPlanarGraph | Represents a directed graph which is embeddable in a planar surface |
| CSubgraph | A subgraph of a PlanarGraph |
| ▶Nprecision | Provides classes for manipulating the precision model of Geometries |
| CCommonBits | Determines the maximum number of common most-significant bits in the mantissa of one or numbers |
| CCommonBitsOp | Provides versions of Geometry spatial functions which use common bit removal to reduce the likelihood of robustness problems |
| CCommonBitsRemover | Allow computing and removing common mantissa bits from one or more Geometries |
| CEnhancedPrecisionOp | Provides versions of Geometry spatial functions which use enhanced precision techniques to reduce the likelihood of robustness problems |
| CGeometryPrecisionReducer | Reduces the precision of a Geometry according to the supplied PrecisionModel, ensuring that the result is topologically valid |
| CSimpleGeometryPrecisionReducer | Reduces the precision of a Geometry according to the supplied PrecisionModel, without attempting to preserve valid topology |
| ▶Nsimplify | |
| CDouglasPeuckerLineSimplifier | Simplifies a linestring (sequence of points) using the standard Douglas-Peucker algorithm |
| CDouglasPeuckerSimplifier | Simplifies a Geometry using the standard Douglas-Peucker algorithm |
| CTaggedLineSegment | A geom::LineSegment which is tagged with its location in a geom::Geometry |
| CTaggedLinesSimplifier | Simplifies a collection of TaggedLineStrings, preserving topology (in the sense that no new intersections are introduced) |
| CTaggedLineString | Contains and owns a list of TaggedLineSegments |
| CTaggedLineStringSimplifier | Simplifies a TaggedLineString, preserving topology (in the sense that no new intersections are introduced). Uses the recursive Douglas-Peucker algorithm |
| CTopologyPreservingSimplifier | Simplifies a geometry, ensuring that the result is a valid geometry having the same dimension and number of components as the input |
| ▶Ntriangulate | |
| ▶Nquadedge | |
| CLastFoundQuadEdgeLocator | |
| CQuadEdge | |
| CQuadEdgeLocator | |
| CQuadEdgeSubdivision | |
| CTriangleVisitor | |
| CVertex | |
| CDelaunayTriangulationBuilder | |
| CIncrementalDelaunayTriangulator | |
| CVoronoiDiagramBuilder | |
| ▶Nutil | |
| CAssertionFailedException | Indicates a bug in GEOS code |
| CCoordinateArrayFilter | |
| CGeometricShapeFactory | |
| CGEOSException | Base class for all GEOS exceptions |
| CIllegalArgumentException | Indicates one or more illegal arguments |
| CIllegalStateException | Indicates an illegal state |
| CInterrupt | |
| CTopologyException | Indicates an invalid or inconsistent topological situation encountered during processing |
| CUnsupportedOperationException | Indicates that the requested operation is unsupported |
