GEOS 3.13.1
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]
 NgeosBasic namespace for all GEOS functionalities
 NalgorithmContains classes and interfaces implementing fundamental computational geometry algorithms
 Ncoverage
 Nedgegraph
 Ngeom
 NgeomgraphContains classes that implement topology graphs
 NindexProvides classes for various kinds of spatial indexes
 NioContains the interfaces for converting JTS objects to and from other formats
 NlinearrefContains classes and interfaces implementing linear referencing on linear geometries
 Nmath
 NnodingClasses to compute nodings for arrangements of line segments and line segment sequences
 NoperationProvides classes for implementing operations on geometries
 NplanargraphContains classes to implement a planar graph data structure
 NprecisionProvides classes for manipulating the precision model of Geometries
 Nshape
 NsimplifyClasses which implement algorithms for simplifying or generalizing geometries
 NtriangulateClasses to compute Delaunay triangulations
 NutilUtility classes for GEOS
 CBasicSegmentStringRepresents a list of contiguous line segments, and supports noding the segments
 CBoundaryNodeRuleAn interface for rules which determine whether node points which are in boundaries of lineal geometry components are in the boundary of the parent geometry collection
 CCoordinateCoordinate is the lightweight class used to store coordinates
 CCoordinateSequenceThe internal representation of a list of coordinates inside a Geometry
 CCoordinateSequenceFilterInterface for classes which provide operations that can be applied to the coordinates in a CoordinateSequence
 CCoverageEdge
 CDimension
 CEnvelopeAn Envelope defines a rectangulare region of the 2D coordinate plane
 CGeometryBasic implementation of Geometry, constructed and destructed by GeometryFactory
 CGeometryCollectionRepresents a collection of heterogeneous Geometry objects
 CGeometryFactorySupplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geometry objects
 CGeometryFilterGeometry classes support the concept of applying a Geometry filter to the Geometry
 CIndexedFacetDistanceComputes the distance between the facets (segments and vertices) of two Geometrys using a Branch-and-Bound algorithm
 CIndexedPointInAreaLocatorDetermines the location of Coordinates relative to an areal geometry, using indexing for efficiency
 CIntersectionMatrixImplementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix
 CLinearRingModels an OGC SFS LinearRing. A LinearRing is a LineString which is both closed and simple
 CLineIntersectorA LineIntersector is an algorithm that can both test whether two line segments intersect and compute the intersection point if they do
 CLineSegment
 CLineString
 CMonotoneChainMonotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of intersections
 CMonotoneChainOverlapActionThe action for the internal iterator for performing overlap queries on a MonotoneChain
 CMultiLineStringModels a collection of LineStrings
 CMultiPolygon
 CNodedSegmentStringRepresents a list of contiguous line segments, and supports noding the segments
 CNodeSection
 CPoint
 CPointOnGeometryLocatorAn interface for classes which determine the Location of points in Polygon or MultiPolygon geometries
 CPolygonRepresents a linear polygon, which may include holes
 CPositionA Position indicates the position of a Location relative to a graph component (Node, Edge, or Area)
 CPrecisionModelSpecifies the precision model of the Coordinate in a Geometry
 CQuadEdgeA class that represents the edge data structure which implements the quadedge algebra
 CQuadEdgeSubdivisionA class that contains the QuadEdges representing a planar subdivision that models a triangulation
 CSegmentIntersectorProcesses possible intersections detected by a Noder
 CSegmentSetMutualIntersectorAn intersector for the red-blue intersection problem
 CSegmentStringAn interface for classes which represent a sequence of contiguous line segments
 CSnapRoundingNoder
 CTri
 CTriangleRepresents a planar triangle, and provides methods for calculating various properties of triangles
 CTriangleVisitorAn interface for algorithms which process the triangles in a QuadEdgeSubdivision
 CTriList
 CVertexSequencePackedRtree