Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:

geos::operation::cluster::AbstractClusterFinder |
geos::operation::cluster::DBSCANClusterFinder |
geos::operation::cluster::EnvelopeDistanceClusterFinder |
geos::operation::cluster::EnvelopeIntersectsClusterFinder |
geos::operation::cluster::GeometryDistanceClusterFinder |
geos::operation::cluster::GeometryIntersectsClusterFinder |
geos::index::strtree::AbstractSTRtree | Base class for STRtree and SIRtree
geos::index::strtree::SIRtree | One-dimensional version of an STR-packed R-tree
geos::index::strtree::STRtree | A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data
geos::operation::relateng::AdjacentEdgeLocator |
geos::algorithm::Angle | Utility functions for working with angles
geos::index::bintree::Bintree | A BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree
geos::index::strtree::Boundable | A spatial object in an AbstractSTRtree
geos::index::strtree::AbstractNode | A node of the STR tree
geos::index::strtree::ItemBoundable | Boundable wrapper for a non-Boundable spatial object. Used internally by AbstractSTRtree
geos::index::strtree::SimpleSTRnode | A node of the STR tree
geos::index::strtree::BoundablePair | A pair of Boundables, whose leaf items support a distance metric between them
geos::algorithm::BoundaryNodeRule | An 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
geos::operation::BoundaryOp |
geos::operation::buffer::BufferBuilder | Builds the buffer geometry for a given input geometry and precision model
geos::operation::buffer::BufferCurveSetBuilder | Creates all the raw offset curves for a buffer of a Geometry
geos::operation::buffer::BufferInputLineSimplifier | Simplifies a buffer input line to remove concavities with shallow depth
geos::operation::buffer::BufferNodeFactory | Creates nodes for use in the geomgraph::PlanarGraph constructed during buffer operations. NOTE: also used by operation::valid
geos::operation::buffer::BufferOp | Computes the buffer of a geometry, for both positive and negative buffer distances
geos::operation::buffer::BufferParameters | Contains the parameters which describe how a buffer should be constructed
geos::operation::buffer::BufferSubgraph | A connected subset of the graph of DirectedEdge and geomgraph::Node
geos::operation::polygonize::BuildArea | Creates an areal geometry formed by the constituent linework of given geometry
geos::io::ByteOrderDataInStream | Allows reading an stream of primitive datatypes from an underlying istream, with the representation being in either common byte ordering
geos::io::ByteOrderValues | Methods to read and write primitive datatypes from/to byte sequences, allowing the byte order to be specified
geos::operation::geounion::CascadedPolygonUnion | Provides an efficient method of unioning a collection of polygonal geometries
geos::operation::grid::Cell | Stores information about the spatial extent of a Grid cell and any cases where a line crosses that cell (recorded in a Traversal)
geos::algorithm::CentralEndpointIntersector | Computes an approximate intersection of two line segments by taking the most central of the endpoints of the segments
geos::algorithm::Centroid | Computes the centroid of a Geometry of any dimension
geos::algorithm::CGAlgorithmsDD | Implements basic computational geometry algorithms using extended precision float-point arithmetic
geos::geom::CircularArc |
geos::precision::CommonBits | Determines the maximum number of common most-significant bits in the mantissa of one or numbers
geos::precision::CommonBitsOp | Provides versions of Geometry spatial functions which use common bit removal to reduce the likelihood of robustness problems
geos::precision::CommonBitsRemover | Allow computing and removing common mantissa bits from one or more Geometries
geos::algorithm::hull::ConcaveHull |
geos::algorithm::hull::ConcaveHullOfPolygons |
geos::planargraph::algorithm::ConnectedSubgraphFinder | Finds all connected `Subgraph`s of a PlanarGraph
geos::operation::valid::ConsistentAreaTester | Checks that a geomgraph::GeometryGraph representing an area (a geom::Polygon or geom::MultiPolygon) has consistent semantics for area geometries. This check is required for any reasonable polygonal model (including the OGC-SFS model, as well as models which allow ring self-intersection at single points)
geos::triangulate::polygon::ConstrainedDelaunayTriangulator |
geos::algorithm::ConvexHull | Computes the convex hull of a Geometry
geos::geom::Coordinate | Coordinate is the lightweight class used to store coordinates
geos::geom::CoordinateFilter | Geometry classes support the concept of applying a coordinate filter to every coordinate in the Geometry
geos::operation::overlayng::PrecisionUtil::InherentScaleFilter |
geos::geom::CoordinateLessThan | Strict weak ordering Functor for Coordinate
geos::geom::CoordinateList | A list of `Coordinate`s, which may be set to prevent repeated coordinates from occurring in the list
geos::geom::CoordinateSequence | The internal representation of a list of coordinates inside a Geometry
geos::geom::CoordinateSequenceFilter | Interface for classes which provide operations that can be applied to the coordinates in a CoordinateSequence
geos::geom::CoordinateSequences | Utility methods to operate on CoordinateSequences. Methods that do not benefit from access to the CoordinateSequence internals can be placed here
geos::coverage::CoverageCleaner |
geos::coverage::CoverageEdge |
geos::coverage::CoverageGapFinder |
geos::coverage::CoveragePolygonValidator |
geos::coverage::CoverageRingEdges |
geos::coverage::CoverageSimplifier |
geos::coverage::CoverageUnion |
geos::operation::overlayng::CoverageUnion |
geos::coverage::CoverageValidator |
geos::math::DD | Wrapper for DoubleDouble higher precision mathematics operations
geos::triangulate::DelaunayTriangulationBuilder | A utility class which creates Delaunay Triangulations from collections of points and extract the resulting triangulation edges or triangles as geometries
geos::geom::util::Densifier |
geos::geomgraph::Depth | A Depth object records the topological depth of the sides of an Edge for up to two Geometries
geos::geom::Dimension |
geos::planargraph::DirectedEdgeStar | A sorted collection of DirectedEdge which leave a Node in a PlanarGraph
geos::algorithm::distance::DiscreteFrechetDistance | The Fréchet distance is a measure of similarity between curves. Thus, it can be used like the Hausdorff distance
geos::algorithm::distance::DiscreteHausdorffDistance | An algorithm for computing a distance metric which is an approximation to the Hausdorff Distance based on a discretization of the input `geom::Geometry`
geos::algorithm::Distance | Functions to compute distance between basic geometric structures
geos::operation::distance::DistanceOp | Find two points on two `geom::Geometry`s 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)
geos::algorithm::distance::DistanceToPoint |
geos::simplify::DouglasPeuckerLineSimplifier | Simplifies a linestring (sequence of points) using the standard Douglas-Peucker algorithm
geos::simplify::DouglasPeuckerSimplifier | Simplifies a Geometry using the standard Douglas-Peucker algorithm
geos::operation::overlayng::Edge |
geos::geomgraph::EdgeEnd | Models the end of an edge incident on a node
geos::geomgraph::DirectedEdge | A directed EdgeEnd
geos::operation::relate::EdgeEndBundle | A collection of geomgraph::EdgeEnd objects which originate at the same point and have the same direction
geos::operation::relate::EdgeEndBuilder | Computes the geomgraph::EdgeEnd objects which arise from a noded geomgraph::Edge
geos::geomgraph::EdgeEndStar | A EdgeEndStar is an ordered list of EdgeEnds around a node
geos::geomgraph::DirectedEdgeStar | A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node
geos::operation::relate::EdgeEndBundleStar | An ordered list of EdgeEndBundle objects around a RelateNode
geos::edgegraph::EdgeGraph |
geos::edgegraph::EdgeGraphBuilder |
geos::geomgraph::EdgeIntersection | Represents a point on an edge which intersects with another edge
geos::geomgraph::EdgeIntersectionList | A list of edge intersections along an Edge
geos::operation::overlayng::EdgeKey |
geos::geomgraph::EdgeList | A EdgeList is a list of Edges
geos::operation::overlayng::EdgeMerger |
geos::operation::overlayng::EdgeNodingBuilder |
geos::geomgraph::EdgeNodingValidator | Validates that a collection of SegmentStrings is correctly noded
geos::geomgraph::EdgeRing |
geos::operation::buffer::MaximalEdgeRing | A ring of DirectedEdges which may contain nodes of degree > 2
geos::operation::buffer::MinimalEdgeRing | A ring of Edges with the property that no node has degree greater than 2
geos::operation::polygonize::EdgeRing | Represents a ring of PolygonizeDirectedEdge which form a ring of a polygon. The ring may be either an outer shell or a hole
geos::geomgraph::index::EdgeSetIntersector | An EdgeSetIntersector computes all the intersections between the edges in the set
geos::geomgraph::index::SimpleEdgeSetIntersector | Finds all intersections in one or two sets of edges, using the straightforward method of comparing all segments
geos::geomgraph::index::SimpleMCSweepLineIntersector | Finds all intersections in one or two sets of edges, using an x-axis sweepline algorithm in conjunction with Monotone Chains
geos::geomgraph::index::SimpleSweepLineIntersector | Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm
geos::operation::overlayng::EdgeSourceInfo |
geos::operation::linemerge::EdgeString | A sequence of LineMergeDirectedEdge forming one of the lines that will be output by the line-merging process
geos::operation::overlayng::ElevationModel | A simple elevation model used to populate missing Z values in overlay results
geos::precision::EnhancedPrecisionOp | Provides versions of Geometry spatial functions which use enhanced precision techniques to reduce the likelihood of robustness problems
geos::geom::Envelope | An Envelope defines a rectangulare region of the 2D coordinate plane
geos::algorithm::construct::ExactMaxInscribedCircle |
geos::linearref::ExtractLineByLocation | Extracts the subline of a linear Geometry between two `LinearLocation`s on the line
geos::noding::FastNodingValidator | Validates that a collection of `SegmentString`s is correctly noded
geos::noding::FastSegmentSetIntersectionFinder | Finds if two sets of SegmentStrings intersect
geos::operation::overlay::validate::FuzzyPointLocator | Finds the most likely Location of a point relative to the polygonal components of a geometry, using a tolerance value
geos::io::GeoJSONReader | GeoJSON reader class; see also GeoJSONWriter
geos::io::GeoJSONWriter | Outputs the GeoJSON representation of a Geometry. See also GeoJSONReader for parsing
geos::util::GeometricShapeFactory | Computes various kinds of common geometric shapes
geos::geom::util::SineStarFactory |
geos::geom::Geometry | Basic implementation of Geometry, constructed and destructed by GeometryFactory
geos::geom::GeometryCollection | Represents a collection of heterogeneous Geometry objects
geos::geom::MultiLineString | Models a collection of LineStrings
geos::geom::MultiPoint |
geos::geom::MultiPolygon |
geos::geom::Point |
geos::geom::Surface |
geos::geom::util::GeometryCombiner | Combines Geometrys to produce a GeometryCollection of the most appropriate type
geos::geom::GeometryComponentFilter |
geos::geom::util::ComponentCoordinateExtracter | Extracts a single representative `Coordinate` from each connected component of a `Geometry`
geos::geom::util::LinearComponentExtracter |
geos::geom::util::GeometryEditor |
geos::geom::util::GeometryEditorOperation |
geos::geom::util::CoordinateOperation |
geos::geom::util::GeometryExtracter |
geos::geom::GeometryFactory | Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geometry objects
geos::geom::GeometryFilter | Geometry classes support the concept of applying a Geometry filter to the Geometry
geos::geom::util::PointExtracter |
geos::geom::util::PolygonExtracter |
geos::operation::distance::ConnectedElementLocationFilter | 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. Empty geometries do not provide a location item
geos::operation::distance::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
geos::geom::util::GeometryFixer |
geos::operation::GeometryGraphOperation | The base class for operations that require GeometryGraph
geos::operation::relate::RelateOp | Implements the SFS relate() operation on two geom::Geometry objects
geos::geom::util::GeometryLister |
geos::operation::distance::GeometryLocation | Represents the location of a point on a Geometry
geos::geom::util::GeometryMapper |
geos::precision::GeometryPrecisionReducer | Reduces the precision of a `geom::Geometry` according to the supplied `geom::PrecisionModel`, ensuring that the result is valid (unless specified otherwise)
geos::operation::overlay::snap::GeometrySnapper | Snaps the vertices and segments of a `geom::Geometry` to another Geometry's vertices
geos::geom::util::GeometryTransformer | A framework for processes which transform an input Geometry into an output Geometry, possibly changing its structure and type(s)
geos::precision::PointwisePrecisionReducerTransformer |
geos::precision::PrecisionReducerTransformer | Reduces the precision of a `geom::Geometry` according to the supplied `geom::PrecisionModel`, without attempting to preserve valid topology
geos::util::GEOSException | Base class for all GEOS exceptions
geos::algorithm::NotRepresentableException | Indicates that a HCoordinate has been computed which is not representable on the Cartesian plane
geos::io::ParseException | Notifies a parsing error
geos::util::AssertionFailedException | Indicates a bug in GEOS code
geos::util::IllegalArgumentException | Indicates one or more illegal arguments
geos::util::IllegalStateException | Indicates an illegal state
geos::util::TopologyException | Indicates an invalid or inconsistent topological situation encountered during processing
geos::util::UnsupportedOperationException | Indicates that the requested operation is unsupported
geos::geomgraph::GraphComponent | A GraphComponent is the parent class for the objects' that form a graph
geos::geomgraph::Edge |
geos::geomgraph::Node | The node component of a geometry graph
geos::operation::relate::RelateNode | Represents a node in the topological graph used to compute spatial relationships
geos::planargraph::GraphComponent | The base class for all graph component classes
geos::planargraph::DirectedEdge | Represents a directed edge in a PlanarGraph
geos::operation::linemerge::LineMergeDirectedEdge | A DirectedEdge of a LineMergeGraph
geos::operation::polygonize::PolygonizeDirectedEdge | A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph
geos::planargraph::Edge | Represents an undirected edge of a PlanarGraph
geos::operation::linemerge::LineMergeEdge | An edge of a LineMergeGraph. The `marked` field indicates whether this Edge has been logically deleted from the graph
geos::operation::polygonize::PolygonizeEdge | An edge of a polygonization graph
geos::planargraph::Node | A node in a PlanarGraph is a location where 0 or more Edge meet
geos::operation::grid::GridIntersection | Computes and stores information about intersection of a Grid and a Geometry. For a polygonal geometry, the fraction of each grid cell covered by polygon is stored. For a linear geometry, the length of the line in each grid cell is stored
geos::edgegraph::HalfEdge |
geos::operation::overlayng::OverlayEdge |
geos::algorithm::HCoordinate | Represents a homogeneous coordinate in a 2-D coordinate space
geos::shape::fractal::HilbertCode |
geos::operation::polygonize::HoleAssigner | Assigns hole rings to shell rings during polygonization
geos::noding::snapround::HotPixel | Implements a "hot pixel" as used in the Snap Rounding algorithm
geos::triangulate::IncrementalDelaunayTriangulator | Computes a Delauanay Triangulation of a set of `quadedge::Vertex`es, using an incrementatal insertion algorithm
geos::algorithm::construct::IndexedDistanceToPoint | Computes the distance between a point and a geometry (which may be a collection containing any type of geometry)
geos::operation::distance::IndexedFacetDistance | Computes the distance between the facets (segments and vertices) of two Geometrys using a Branch-and-Bound algorithm
geos::algorithm::construct::IndexedPointInPolygonsLocator | Determines the location of a point in the polygonal elements of a geometry
geos::operation::overlayng::InputGeometry |
geos::algorithm::InteriorPointArea | Computes a point in the interior of an areal geometry. The point will lie in the geometry interior in all except certain pathological cases
geos::algorithm::InteriorPointLine | Computes a point in the interior of an linear geometry
geos::algorithm::InteriorPointPoint | Computes a point in the interior of an point geometry
geos::util::Interrupt | Used to manage interruption requests and callbacks
geos::algorithm::Intersection | Functions to compute intersection points between lines and line segments
geos::geom::IntersectionMatrix | Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix
geos::operation::overlayng::IntersectionPointBuilder |
geos::index::strtree::AbstractSTRtree::IntersectsOp | A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds
geos::index::bintree::Interval | Represents an (1-dimensional) closed interval on the Real number line
geos::index::strtree::Interval | A contiguous portion of 1D-space. Used internally by SIRtree
geos::index::quadtree::IntervalSize | 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
geos::operation::valid::IsSimpleOp |
geos::operation::valid::IsValidOp |
geos::index::strtree::ItemDistance | A function method which computes the distance between two ItemBoundables in an STRtree. Used for Nearest Neighbour searches
geos::index::ItemVisitor | A visitor for items in an index
geos::index::kdtree::KdNode |
geos::index::kdtree::KdTree |
geos::index::bintree::Key | A Key is a unique identifier for a node in a tree
geos::index::quadtree::Key | A Key is a unique identifier for a node in a quadtree
geos::geomgraph::Label | A `Label` indicates the topological relationship of a component of a topology graph to a given `Geometry`
geos::algorithm::construct::LargestEmptyCircle |
geos::algorithm::Length | Functions for computing length
geos::linearref::LengthIndexedLine | Supports linear referencing along a linear geom::Geometry using the length along the line as the index
geos::linearref::LengthIndexOfPoint | Computes the length index of the point on a linear Geometry nearest a given Coordinate
geos::linearref::LengthLocationMap | Computes the LinearLocation for a given length along a linear Geometry
geos::linearref::LinearGeometryBuilder | Builds a linear geometry (LineString or MultiLineString) incrementally (point-by-point)
geos::linearref::LinearIterator | An iterator over the components and coordinates of a linear geometry (LineString or MultiLineString)
geos::linearref::LinearLocation | Represents a location along a LineString or MultiLineString
geos::operation::overlayng::LineBuilder |
geos::dissolve::LineDissolver |
geos::algorithm::LineIntersector | A LineIntersector is an algorithm that can both test whether two line segments intersect and compute the intersection point if they do
geos::operation::overlayng::LineLimiter |
geos::operation::linemerge::LineMerger | Sews together a set of fully noded LineStrings
geos::geom::LineSegment |
geos::simplify::TaggedLineSegment | A geom::LineSegment which is tagged with its location in a geom::Geometry
geos::operation::linemerge::LineSequencer | Builds a sequence from a set of LineStrings so that they are ordered end to end
geos::operation::overlay::snap::LineStringSnapper | Snaps the vertices and segments of a LineString to a set of target snap vertices
geos::linearref::LocationIndexedLine | Supports linear referencing along a linear Geometry using LinearLocations as the index
geos::linearref::LocationIndexOfLine | Determines the location of a subline along a linear Geometry
geos::linearref::LocationIndexOfPoint | Computes the LinearLocation of the point on a linear Geometry nearest a given Coordinate
geos::operation::valid::MakeValid | The function attempts to create a valid representation of a given invalid geometry without losing any of the input vertices
geos::algorithm::distance::DiscreteFrechetDistance::MatrixStorage |
geos::algorithm::distance::DiscreteFrechetDistance::CsrMatrix |
geos::algorithm::distance::DiscreteFrechetDistance::HashMapMatrix |
geos::algorithm::distance::DiscreteFrechetDistance::RectMatrix |
geos::algorithm::construct::MaximumInscribedCircle |
geos::noding::snapround::MCIndexPointSnapper | "Snaps" all SegmentStrings in a SpatialIndex containing MonotoneChains to a given HotPixel
geos::algorithm::MinimumAreaRectangle |
geos::precision::MinimumClearance | Computes the Minimum Clearance of a Geometry
geos::algorithm::MinimumDiameter | Computes the minimum diameter of a geom::Geometry
geos::geomgraph::index::MonotoneChain |
geos::index::chain::MonotoneChain | Monotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of intersections
geos::index::chain::MonotoneChainBuilder | Constructs MonotoneChains for sequences of Coordinates
geos::geomgraph::index::MonotoneChainEdge | MonotoneChains are a way of partitioning the segments of an edge to allow for fast searching of intersections
geos::geomgraph::index::MonotoneChainIndexer | MonotoneChains are a way of partitioning the segments of an edge to allow for fast searching of intersections
geos::index::chain::MonotoneChainOverlapAction | The action for the internal iterator for performing overlap queries on a MonotoneChain
geos::operation::relateng::EdgeSegmentOverlapAction | The action for the internal iterator for performing overlap queries on a MonotoneChain
geos::index::chain::MonotoneChainSelectAction |
geos::shape::fractal::MortonCode |
geos::index::bintree::NodeBase | The base class for nodes in a Bintree
geos::index::bintree::Node | A node of a Bintree
geos::index::bintree::Root | The root node of a single Bintree
geos::index::quadtree::NodeBase | The base class for nodes in a Quadtree
geos::index::quadtree::Node | Represents a node of a Quadtree
geos::index::quadtree::Root | QuadRoot is the root of a single Quadtree. It is centred at the origin, and does not have a defined extent
geos::planargraph::NodeMap | A map of Node, indexed by the coordinate of the node
geos::noding::Noder | Computes all intersections between segments in a set of SegmentString
geos::noding::BoundaryChainNoder |
geos::noding::IteratedNoder | Nodes a set of SegmentStrings completely
geos::noding::ScaledNoder | Wraps a `Noder` and transforms its input into the integer domain
geos::noding::SegmentExtractingNoder |
geos::noding::SinglePassNoder | Base class for `Noder`s which make a single pass to find intersections
geos::noding::MCIndexNoder | Nodes a set of SegmentString using a index based on MonotoneChain and a SpatialIndex
geos::noding::SimpleNoder | Nodes a set of `SegmentString`s by performing a brute-force comparison of every segment to every other one
geos::noding::ValidatingNoder |
geos::noding::snap::SnappingNoder |
geos::noding::snapround::MCIndexSnapRounder | Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of SegmentString
geos::noding::snapround::SnapRoundingNoder |
geos::operation::relateng::NodeSection |
geos::noding::NodingValidator | Validates that a collection of `SegmentString`s is correctly noded. Throws a TopologyException if a noding error is found
geos::noding::Octant | Methods for computing and working with octants of the Cartesian plane
geos::operation::buffer::OffsetCurve |
geos::operation::buffer::OffsetCurveBuilder | Computes the raw offset curve for a single Geometry component (ring, line or point)
geos::operation::buffer::OffsetCurveSection |
geos::operation::overlay::validate::OffsetPointGenerator | Generates points offset from both sides of all segments in a geometry
geos::operation::buffer::OffsetSegmentGenerator |
geos::operation::buffer::OffsetSegmentString |
geos::io::OrdinateSet | Utility class to manipulate a set of flags indicating whether X, Y, Z, or M dimensions are present. Based on JTS EnumSet<Ordinate>
geos::algorithm::Orientation | Functions to compute the orientation of basic geometric structures including point triplets (triangles) and rings
geos::noding::OrientedCoordinateArray | Allows comparing `geom::CoordinateSequence`s in an orientation-independent way
geos::algorithm::hull::OuterShellsExtracter |
geos::operation::geounion::OverlapUnion | Unions MultiPolygons efficiently by using full topological union only for polygons which may overlap by virtue of intersecting the common area of the inputs
geos::operation::overlayng::OverlayGraph |
geos::operation::overlayng::OverlayLabel |
geos::operation::overlayng::OverlayMixedPoints |
geos::operation::overlayng::OverlayNG |
geos::operation::overlayng::OverlayNGRobust |
geos::operation::overlayng::OverlayPoints |
geos::operation::overlay::validate::OverlayResultValidator | Validates that the result of an overlay operation is geometrically correct within a determined tolerance
geos::operation::overlayng::OverlayUtil |
geos::geomgraph::PlanarGraph | Represents a directed graph which is embeddable in a planar surface
geos::geomgraph::GeometryGraph | A GeometryGraph is a graph that models a given Geometry
geos::planargraph::PlanarGraph | Represents a directed graph which is embeddable in a planar surface
geos::operation::linemerge::LineMergeGraph | A planar graph of edges that is analyzed to sew the edges together
geos::operation::polygonize::PolygonizeGraph | 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
geos::operation::geounion::PointGeometryUnion | Computes the union of a puntal geometry with another arbitrary Geometry
geos::algorithm::PointLocation | Functions for locating points within basic geometric structures such as lines and rings
geos::algorithm::PointLocator | Computes the topological relationship (Location) of a single point to a Geometry
geos::algorithm::locate::PointOnGeometryLocator | An interface for classes which determine the Location of points in Polygon or MultiPolygon geometries
geos::algorithm::locate::IndexedPointInAreaLocator | Determines the location of Coordinates relative to an areal geometry, using indexing for efficiency
geos::algorithm::locate::SimplePointInAreaLocator | Computes the location of points relative to a polygonal Geometry, using a simple O(n) algorithm
geos::operation::overlayng::IndexedPointOnLineLocator |
geos::algorithm::distance::PointPairDistance |
geos::geom::util::PolygonalExtracter | Extracts the polygonal (Polygon and MultiPolygon) elements from a Geometry
geos::operation::buffer::PolygonBuilder | Forms Polygon out of a graph of geomgraph::DirectedEdge
geos::triangulate::polygon::PolygonEarClipper |
geos::triangulate::polygon::PolygonHoleJoiner |
geos::simplify::PolygonHullSimplifier |
geos::operation::polygonize::Polygonizer | Polygonizes a set of Geometrys which contain linework that represents the edges of a planar graph
geos::operation::relateng::PolygonNodeConverter |
geos::triangulate::polygon::PolygonNoder |
geos::algorithm::PolygonNodeTopology |
geos::triangulate::polygon::PolygonTriangulator |
geos::geom::Position | A Position indicates the position of a Location relative to a graph component (Node, Edge, or Area)
geos::geom::PrecisionModel | Specifies the precision model of the Coordinate in a Geometry
geos::operation::overlayng::PrecisionReducer |
geos::operation::overlayng::PrecisionUtil |
geos::geom::prep::PreparedGeometry | An interface for classes which prepare `Geometry`s in order to optimize the performance of repeated calls to specific geometric operations
geos::geom::prep::BasicPreparedGeometry | A base class for `PreparedGeometry` subclasses
geos::geom::prep::PreparedLineString | A prepared version of `LinearRing`, `LineString` or `MultiLineString` geometries
geos::geom::prep::PreparedPoint | A prepared version of `Point` or `MultiPoint` geometries
geos::geom::prep::PreparedPolygon | A prepared version of `Polygon` or `MultiPolygon` geometries
geos::geom::prep::PreparedGeometryFactory | A factory for creating `PreparedGeometry`s
geos::geom::prep::PreparedLineStringIntersects | Computes the intersects spatial relationship predicate for a target `PreparedLineString` relative to all other `Geometry` classes
geos::geom::prep::PreparedPolygonPredicate | A base class for predicate operations on `PreparedPolygon`s
geos::geom::prep::AbstractPreparedPolygonContains | A base class containing the logic for computes the contains and covers spatial relationship predicates for a `PreparedPolygon` relative to all other `Geometry` classes
geos::geom::prep::PreparedPolygonContains | Computes the contains spatial relationship predicate for a `PreparedPolygon` relative to all other `Geometry` classes
geos::geom::prep::PreparedPolygonCovers | Computes the covers spatial relationship predicate for a `PreparedPolygon` relative to all other `Geometry` classes
geos::geom::prep::PreparedPolygonContainsProperly | Computes the containsProperly spatial relationship predicate for `PreparedPolygon`s relative to all other `Geometry` classes
geos::geom::prep::PreparedPolygonIntersects | Computes the intersects spatial relationship predicate for `PreparedPolygon`s relative to all other `Geometry` classes
geos::triangulate::quadedge::QuadEdge | A class that represents the edge data structure which implements the quadedge algebra
geos::triangulate::quadedge::QuadEdgeLocator | An interface for classes which locate an edge in a `QuadEdgeSubdivision` which either contains a given `Vertex` V or is an edge of a triangle which contains V
geos::triangulate::quadedge::LastFoundQuadEdgeLocator | Locates `QuadEdge`s in a `QuadEdgeSubdivision`, optimizing the search by starting in the locality of the last edge found
geos::triangulate::quadedge::QuadEdgeSubdivision | A class that contains the QuadEdges representing a planar subdivision that models a triangulation
geos::geom::Quadrant | Utility functions for working with quadrants
geos::algorithm::RayCrossingCounter | Counts the number of segments crossed by a horizontal ray extending to the right from a given point, in an incremental fashion
geos::operation::intersection::Rectangle | Clipping rectangle
geos::operation::predicate::RectangleContains | Optimized implementation of spatial predicate "contains" for cases where the first Geometry is a rectangle
geos::operation::intersection::RectangleIntersection | Speed-optimized clipping of a Geometry with a rectangle
geos::operation::intersection::RectangleIntersectionBuilder | Rebuild geometries from subpaths left by clipping with a rectangle
geos::operation::predicate::RectangleIntersects | Optimized implementation of the "intersects" spatial predicate for cases where one Geometry is a rectangle
geos::operation::relate::RelateComputer | Computes the topological relationship between two Geometries
geos::operation::relateng::RelateNG |
geos::operation::relate::RelateNodeFactory | Used by the geomgraph::NodeMap in a RelateNodeGraph to create RelateNode objects
geos::operation::relate::RelateNodeGraph | Implements the simple graph of Nodes and geomgraph::EdgeEnd which is all that is required to determine topological relationships between Geometries
geos::operation::relateng::RelatePointLocator |
geos::operation::valid::RepeatedPointRemover |
geos::operation::valid::RepeatedPointTester | Implements the appropriate checks for repeated points (consecutive identical coordinates) as defined in the JTS spec
geos::operation::buffer::RightmostEdgeFinder | 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.)
geos::operation::overlayng::RingClipper |
geos::operation::overlayng::RobustClipEnvelopeComputer |
geos::algorithm::RobustDeterminant | Implements an algorithm to compute the sign of a 2x2 determinant for double precision values robustly
geos::operation::predicate::SegmentIntersectionTester | Tests if any line segments in two sets of CoordinateSequences intersect
geos::geomgraph::index::SegmentIntersector | Computes the intersection of line segments, and adds the intersection to the edges containing the segments
geos::noding::SegmentIntersector | Processes possible intersections detected by a Noder
geos::coverage::InvalidSegmentDetector |
geos::noding::IntersectionAdder | Computes the intersections between two line segments in SegmentString and adds them to each string
geos::noding::IntersectionFinderAdder | Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes
geos::noding::NodingIntersectionFinder | Finds non-noded intersections in a set of `SegmentString`s, if any exist
geos::noding::SegmentIntersectionDetector | Detects and records an intersection between two `SegmentString`s, if one exists
geos::noding::snapround::SnapRoundingIntersectionAdder |
geos::noding::SegmentNode | Represents an intersection point between two NodedSegmentString
geos::noding::SegmentNodeList | A list of the SegmentNode present along a NodedSegmentString
geos::noding::SegmentPointComparator | Implements a robust method of comparing the relative position of two points along the same segment
geos::noding::SegmentSetMutualIntersector | An intersector for the red-blue intersection problem
geos::noding::MCIndexSegmentSetMutualIntersector | Intersects two sets of SegmentStrings using a index based on MonotoneChains and a SpatialIndex
geos::noding::SegmentString | An interface for classes which represent a sequence of contiguous line segments
geos::noding::BasicSegmentString | Represents a list of contiguous line segments, and supports noding the segments
geos::noding::NodableSegmentString | An interface for classes which support adding nodes to a segment string
geos::noding::NodedSegmentString | Represents a list of contiguous line segments, and supports noding the segments
geos::noding::SegmentStringUtil | Utility methods for processing `SegmentString`s
geos::operation::sharedpaths::SharedPathsOp | Find shared paths among two linear Geometry objects
geos::geom::util::ShortCircuitedGeometryVisitor | A visitor to Geometry elements which can be short-circuited by a given condition
geos::precision::SimpleGeometryPrecisionReducer | Reduces the precision of a `geom::Geometry` according to the supplied `geom::PrecisionModel`, without attempting to preserve valid topology
geos::operation::overlay::snap::SnapOverlayOp | Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result
geos::index::intervalrtree::SortedPackedIntervalRTree | A static index on a set of 1-dimensional intervals, using an R-Tree packed based on the order of the interval midpoints
geos::index::SpatialIndex | Abstract class defines basic insertion and query operations supported by classes implementing spatial index algorithms
geos::index::quadtree::Quadtree | 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
geos::index::strtree::STRtree | A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data
geos::index::strtree::SimpleSTRtree | A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data
geos::planargraph::Subgraph | A subgraph of a PlanarGraph
geos::operation::buffer::SubgraphDepthLocater | Locates a subgraph inside a set of subgraphs, in order to determine the outside depth of the subgraph
geos::index::sweepline::SweepLineIndex | A sweepline implements a sorted index on a set of intervals
geos::simplify::TaggedLinesSimplifier | Simplifies a collection of TaggedLineStrings, preserving topology (in the sense that no new intersections are introduced)
geos::simplify::TaggedLineString | Contains and owns a list of TaggedLineSegments
geos::simplify::TaggedLineStringSimplifier | Simplifies a TaggedLineString, preserving topology (in the sense that no new intersections are introduced). Uses the recursive Douglas-Peucker algorithm
geos::index::strtree::TemplateSTRtreeImpl< ItemType, BoundsTraits > | A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For one- or two-dimensional spatial data
geos::index::strtree::TemplateSTRtreeImpl< const FacetSequence *, EnvelopeTraits > |
geos::index::strtree::TemplateSTRtreeImpl< const geos::geom::LinearRing *, EnvelopeTraits > |
geos::index::strtree::TemplateSTRtreeImpl< const geos::index::chain::MonotoneChain *, EnvelopeTraits > |
geos::index::strtree::TemplateSTRtreeImpl< geos::operation::polygonize::EdgeRing *, EnvelopeTraits > |
geos::index::strtree::TemplateSTRtreeImpl< ItemType *, EnvelopeTraits > |
geos::index::strtree::TemplateSTRtreeImpl< ItemType, EnvelopeTraits > |
geos::index::strtree::TemplateSTRtreeImpl< SegmentView, index::strtree::IntervalTraits > |
geos::geomgraph::TopologyLocation | A TopologyLocation is the labelling of a GraphComponent's topological relationship to a single Geometry
geos::simplify::TopologyPreservingSimplifier | Simplifies a geometry, ensuring that the result is a valid geometry having the same dimension and number of components as the input
geos::operation::valid::TopologyValidationError | Contains information about the nature and location of a geom::Geometry validation error
geos::coverage::TPVWSimplifier |
geos::operation::grid::Traversal | Records the coordinates of a line that are within a grid cell, as well as the Side from which the line entered and exited the cell
geos::triangulate::tri::Tri |
geos::geom::Triangle | Represents a planar triangle, and provides methods for calculating various properties of triangles
geos::triangulate::quadedge::TrianglePredicate | Algorithms for computing values and predicates associated with triangles
geos::triangulate::quadedge::TriangleVisitor | An interface for algorithms which process the triangles in a `QuadEdgeSubdivision`
geos::triangulate::tri::TriangulationBuilder |
geos::triangulate::polygon::TriDelaunayImprover |
geos::triangulate::tri::TriEdge |
geos::triangulate::tri::TriList< TriType > |
geos::operation::overlayng::UnaryUnionNG |
geos::operation::geounion::UnaryUnionOp | Unions a collection of Geometry or a single Geometry (which may be a collection) together
geos::operation::cluster::UnionFind |
geos::operation::geounion::UnionStrategy |
geos::operation::geounion::ClassicUnionStrategy | Implementation of UnionStrategy that provides overlay using the first generation overlay routines
geos::operation::overlayng::UnaryUnionNG::NGUnionStrategy |
geos::triangulate::quadedge::Vertex | Models a site (node) in a QuadEdgeSubdivision
geos::index::VertexSequencePackedRtree |
geos::triangulate::VoronoiDiagramBuilder | A utility class which creates Voronoi Diagrams from collections of points
geos::io::WKBReader | Reads a Geometry from Well-Known Binary format
geos::io::WKBWriter | Writes a Geometry into Well-Known Binary format
geos::io::WKTReader | WKT parser class; see also WKTWriter
geos::io::WKTWriter | Outputs the textual representation of a Geometry. See also WKTReader