GEOS: Class List

GEOS 3.5.0

- Main Page
- Related Pages
- Namespaces
- Classes
- Files

- Class List
- Class Hierarchy
- Class Members

Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 12345]

▼N geos | Basic namespace for all GEOS functionalities
►N algorithm | Contains classes and interfaces implementing fundamental computational geometry algorithms
►Ndistance |
C DiscreteHausdorffDistance | An algorithm for computing a distance metric which is an approximation to the Hausdorff Distance based on a discretization of the input Geometry
C DistanceToPoint |
C PointPairDistance |
►N locate | Classes which determine the Location of points in geometries
C IndexedPointInAreaLocator | Determines the location of Coordinates relative to a Polygon or MultiPolygon geometry, using indexing for efficiency
C PointOnGeometryLocator | An interface for classes which determine the Location of points in Polygon or MultiPolygon geometries
C SimplePointInAreaLocator | Computes the location of points relative to an areal Geometry, using a simple O(n) algorithm
C Angle | Utility functions for working with angles
C BoundaryNodeRule |
C CentralEndpointIntersector | Computes an approximate intersection of two line segments by taking the most central of the endpoints of the segments
C Centroid |
C CentroidArea | Computes the centroid of an area geometry
C CentroidLine |
C CentroidPoint |
C CGAlgorithms | Specifies and implements various fundamental Computational Geometric algorithms. The algorithms supplied in this class are robust for double-precision floating point
C ConvexHull |
C HCoordinate | Represents a homogeneous coordinate in a 2-D coordinate space
C InteriorPointArea | Computes a point in the interior of an areal geometry
C InteriorPointLine | Computes a point in the interior of an linear geometry
C InteriorPointPoint | Computes a point in the interior of an point geometry
C LineIntersector | A LineIntersector is an algorithm that can both test whether two line segments intersect and compute the intersection point if they do
C MinimumDiameter | Computes the minimum diameter of a geom::Geometry
C NotRepresentableException | Indicates that a HCoordinate has been computed which is not representable on the Cartesian plane
C PointLocator | Computes the topological relationship (Location) of a single point to a Geometry
C RayCrossingCounter | Counts the number of segments crossed by a horizontal ray extending to the right from a given point, in an incremental fashion
C RobustDeterminant | Implements an algorithm to compute the sign of a 2x2 determinant for double precision values robustly
►N geom | Contains the `Geometry` interface hierarchy and supporting classes
►Nprep |
C 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
C BasicPreparedGeometry | A base class for PreparedGeometry subclasses
C PreparedGeometry | An interface for classes which prepare Geometrys in order to optimize the performance of repeated calls to specific geometric operations
C PreparedGeometryFactory | A factory for creating PreparedGeometrys
C PreparedLineString | A prepared version of LinearRing, LineString or MultiLineString geometries
C PreparedLineStringIntersects | Computes the `intersects` spatial relationship predicate for a target PreparedLineString relative to all other Geometry classes
C PreparedPoint | A prepared version of Point or MultiPoint geometries
C PreparedPolygon | A prepared version of Polygon or MultiPolygon geometries
C PreparedPolygonContains | Computes the `contains` spatial relationship predicate for a PreparedPolygon relative to all other Geometry classes
C PreparedPolygonContainsProperly | Computes the `containsProperly` spatial relationship predicate for PreparedPolygons relative to all other Geometry classes
C PreparedPolygonCovers | Computes the `covers` spatial relationship predicate for a PreparedPolygon relative to all other Geometry classes
C PreparedPolygonIntersects | Computes the `intersects` spatial relationship predicate for PreparedPolygons relative to all other Geometry classes
C PreparedPolygonPredicate | A base class for predicate operations on PreparedPolygons
►N util | Provides classes that parse and modify Geometry objects
C ComponentCoordinateExtracter | Extracts a single representative Coordinate from each connected component of a Geometry
C CoordinateOperation |
C GeometryCombiner |
C GeometryEditor |
C GeometryEditorOperation |
C GeometryExtracter |
C GeometryTransformer | A framework for processes which transform an input Geometry into an output Geometry, possibly changing its structure and type(s)
C LinearComponentExtracter |
C PointExtracter |
C PolygonExtracter |
C ShortCircuitedGeometryVisitor | A visitor to Geometry elements which can be short-circuited by a given condition
C SineStarFactory |
C Coordinate | Coordinate is the lightweight class used to store coordinates
C CoordinateArraySequence | The default implementation of CoordinateSequence
C CoordinateArraySequenceFactory | Creates CoordinateSequences internally represented as an array of Coordinates
C CoordinateFilter |
C CoordinateLessThen | Strict weak ordering Functor for Coordinate
C CoordinateList | A list of Coordinates, which may be set to prevent repeated coordinates from occuring in the list
C CoordinateSequence | The internal representation of a list of coordinates inside a Geometry
C CoordinateSequenceFactory | A factory to create concrete instances of CoordinateSequences
C CoordinateSequenceFilter |
C Dimension | Constants representing the dimensions of a point, a curve and a surface
C Envelope | An Envelope defines a rectangulare region of the 2D coordinate plane
C Geometry | Basic implementation of Geometry, constructed and destructed by GeometryFactory
C GeometryCollection | Represents a collection of heterogeneous Geometry objects
C GeometryComponentFilter |
C GeometryFactory | Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geometry objects
C GeometryFilter | Geometry classes support the concept of applying a Geometry filter to the Geometry
C GeometryList | Manager of Geometry pointers. Owns the Geometries
C IntersectionMatrix | Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix
C Lineal |
C LinearRing | Models an OGC SFS `LinearRing`
C LineSegment |
C LineString |
C Location | Constants representing the location of a point relative to a geometry
C MultiLineString | Models a collection of (}s
C MultiPoint |
C MultiPolygon | Models a collection of Polygons
C Point |
C Polygon | Represents a linear polygon, which may include holes
C Polygonal |
C PrecisionModel | Specifies the precision model of the Coordinate in a Geometry
C Puntal |
C Triangle | Represents a planar triangle, and provides methods for calculating various properties of triangles
C TrianglePredicate |
►N geomgraph | Contains classes that implement topology graphs
►Nindex |
C MonotoneChain |
C SimpleMCSweepLineIntersector | Finds all intersections in one or two sets of edges, using an x-axis sweepline algorithm in conjunction with Monotone Chains
C SimpleSweepLineIntersector | Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm
C DirectedEdge | A directed EdgeEnd
C DirectedEdgeStar | A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node
C Edge |
C EdgeEnd | Models the end of an edge incident on a node
C EdgeEndStar | A EdgeEndStar is an ordered list of EdgeEnds around a node
C EdgeIntersection |
C EdgeIntersectionList |
C EdgeList |
C EdgeNodingValidator | Validates that a collection of SegmentStrings is correctly noded
C EdgeRing |
C GeometryGraph |
C GraphComponent | A GraphComponent is the parent class for the objects' that form a graph
C Label | 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 `Geometry`s, which is sufficient for algorithms for binary operations
C Node |
C PlanarGraph | Represents a directed graph which is embeddable in a planar surface
C TopologyLocation | A TopologyLocation is the labelling of a GraphComponent's topological relationship to a single Geometry
►N index | Provides classes for various kinds of spatial indexes
►N bintree | Contains classes that implement a Binary Interval Tree index
C Bintree | An BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree
C Interval | Represents an (1-dimensional) closed interval on the Real number line
C Key | A Key is a unique identifier for a node in a tree
C Node | A node of a Bintree
C NodeBase | The base class for nodes in a Bintree
C Root | The root node of a single Bintree
►N chain | Contains classes that implement Monotone Chains
C MonotoneChain | Monotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of intersections
C MonotoneChainBuilder | Constructs MonotoneChains for sequences of Coordinates
C MonotoneChainOverlapAction |
C MonotoneChainSelectAction |
►Nintervalrtree |
C SortedPackedIntervalRTree | A static index on a set of 1-dimensional intervals, using an R-Tree packed based on the order of the interval midpoints
►N quadtree | Contains classes that implement a Quadtree spatial index
C DoubleBits | DoubleBits manipulates Double numbers by using bit manipulation and bit-field extraction
C 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
C Key | A Key is a unique identifier for a node in a quadtree
C Node | Represents a node of a Quadtree
C NodeBase | The base class for nodes in a Quadtree
C 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
C Root | QuadRoot is the root of a single Quadtree. It is centred at the origin, and does not have a defined extent
►N strtree | Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree
C AbstractNode | A node of the STR tree
►C AbstractSTRtree | Base class for STRtree and SIRtree
C IntersectsOp | A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds
C Boundable | A spatial object in an AbstractSTRtree
C Interval | A contiguous portion of 1D-space. Used internally by SIRtree
C ItemBoundable | Boundable wrapper for a non-Boundable spatial object. Used internally by AbstractSTRtree
C SIRtree | One-dimensional version of an STR-packed R-tree
C STRtree | A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data
►N sweepline | Contains classes which implement a sweepline algorithm for scanning geometric data structures
C SweepLineIndex | A sweepline implements a sorted index on a set of intervals
C ItemVisitor | A visitor for items in an index
C SpatialIndex | Abstract class defines basic insertion and query operations supported by classes implementing spatial index algorithms
►N io | Contains the interfaces for converting JTS objects to and from other formats
C ParseException | Notifies a parsing error
C WKBReader | Reads a Geometry from Well-Known Binary format
C WKBWriter | Writes a Geometry into Well-Known Binary format
C WKTReader | WKT parser class; see also WKTWriter
C WKTWriter | Outputs the textual representation of a Geometry. See also WKTReader
►Nlinearref |
C ExtractLineByLocation |
C LengthIndexedLine | 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
C LengthIndexOfPoint | Computes the length index of the point on a linear Geometry nearest a given Coordinate
C LengthLocationMap |
C LinearGeometryBuilder |
C LinearIterator | An iterator over the components and coordinates of a linear geometry (LineString or MultiLineString)
C LinearLocation | Represents a location along a LineString or MultiLineString
C LocationIndexedLine | Supports linear referencing along a linear Geometry using LinearLocations as the index
C LocationIndexOfLine |
C LocationIndexOfPoint |
►N noding | Classes to compute nodings for arrangements of line segments and line segment sequences
►N snapround | Contains classes to implement the Snap Rounding algorithm for noding linestrings
C HotPixel | Implements a "hot pixel" as used in the Snap Rounding algorithm
C MCIndexPointSnapper | "Snaps" all SegmentStrings in a SpatialIndex containing MonotoneChains to a given HotPixel
C MCIndexSnapRounder | Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of SegmentString
C SimpleSnapRounder | Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of SegmentStrings
C BasicSegmentString |
C FastNodingValidator | Validates that a collection of SegmentStrings is correctly noded
C FastSegmentSetIntersectionFinder | Finds if two sets of SegmentStringss intersect
C IntersectionAdder |
C IntersectionFinderAdder | Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes
C IteratedNoder | Nodes a set of SegmentStrings completely
C MCIndexNoder | Nodes a set of SegmentString using a index based on index::chain::MonotoneChain and a index::SpatialIndex
C MCIndexSegmentSetMutualIntersector | Intersects two sets of SegmentStrings using a index based on MonotoneChains and a SpatialIndex
C NodableSegmentString | An interface for classes which support adding nodes to a segment string
C NodedSegmentString | Represents a list of contiguous line segments, and supports noding the segments
C Noder | Computes all intersections between segments in a set of SegmentString
C NodingValidator |
C Octant | Methods for computing and working with octants of the Cartesian plane
C OrientedCoordinateArray | Allows comparing geom::CoordinateSequences in an orientation-independent way
C ScaledNoder | Wraps a Noder and transforms its input into the integer domain
C SegmentIntersectionDetector | Detects and records an intersection between two SegmentStrings, if one exists
C SegmentIntersector | Processes possible intersections detected by a Noder
C SegmentNode | Represents an intersection point between two NodedSegmentString
C SegmentNodeList | A list of the SegmentNode present along a NodedSegmentString
C SegmentPointComparator |
C SegmentSetMutualIntersector | An intersector for the red-blue intersection problem
C SegmentString | An interface for classes which represent a sequence of contiguous line segments
C SegmentStringUtil | Utility methods for processing SegmentStrings
C SimpleNoder | Nodes a set of SegmentStrings by performing a brute-force comparison of every segment to every other one
C SingleInteriorIntersectionFinder | Finds an interior intersection in a set of SegmentString, if one exists. Only the first intersection found is reported
C SinglePassNoder |
►N operation | Provides classes for implementing operations on geometries
►N buffer | Provides classes for computing buffers of geometries
C BufferBuilder | Builds the buffer geometry for a given input geometry and precision model
C BufferInputLineSimplifier | Simplifies a buffer input line to remove concavities with shallow depth
C BufferOp | Computes the buffer of a geometry, for both positive and negative buffer distances
C BufferParameters | Contains the parameters which describe how a buffer should be constructed
C BufferSubgraph | A connected subset of the graph of DirectedEdge and geomgraph::Node
C OffsetCurveBuilder | Computes the raw offset curve for a single Geometry component (ring, line or point)
C OffsetCurveSetBuilder | Creates all the raw offset curves for a buffer of a Geometry
C OffsetSegmentGenerator |
C OffsetSegmentString | A dynamic list of the vertices in a constructed offset curve
C 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.)
C SubgraphDepthLocater | Locates a subgraph inside a set of subgraphs, in order to determine the outside depth of the subgraph
►N distance | Provides classes for computing the distance between geometries
C 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. The elements of the list are DistanceOp::GeometryLocation
C 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
C DistanceOp | 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)
C GeometryLocation | Represents the location of a point on a Geometry
►Ngeounion |
C CascadedPolygonUnion | 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
C CascadedUnion | Provides an efficient method of unioning a collection of Geometries
C GeometryListHolder | Helper class holding Geometries, part of which are held by reference others are held exclusively
C PointGeometryUnion | Computes the union of a Puntal geometry with another arbitrary Geometry
C UnaryUnionOp |
►Nintersection |
C Rectangle | Clipping rectangle
C RectangleIntersection | Speed-optimized clipping of a Geometry with a rectangle
C RectangleIntersectionBuilder | Rebuild geometries from subpaths left by clipping with a rectangle
►N linemerge | Line merging package
C EdgeString | A sequence of LineMergeDirectedEdge forming one of the lines that will be output by the line-merging process
C LineMergeDirectedEdge | A planargraph::DirectedEdge of a LineMergeGraph
C LineMergeEdge | An edge of a LineMergeGraph. The `marked` field indicates whether this Edge has been logically deleted from the graph
C LineMergeGraph | A planar graph of edges that is analyzed to sew the edges together
C LineMerger | Sews together a set of fully noded LineStrings
C LineSequencer | Builds a sequence from a set of LineStrings so that they are ordered end to end
►N overlay | Contains classes that perform a topological overlay to compute boolean spatial functions
►Nsnap |
C GeometrySnapper | Snaps the vertices and segments of a Geometry to another Geometry's vertices
C LineStringSnapper | Snaps the vertices and segments of a LineString to a set of target snap vertices
C SnapIfNeededOverlayOp | Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result
C SnapOverlayOp | Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result
►Nvalidate |
C FuzzyPointLocator | Finds the most likely Location of a point relative to the polygonal components of a geometry, using a tolerance value
C OffsetPointGenerator | Generates points offset from both sides of all segments in a geometry
C OverlayResultValidator | Validates that the result of an overlay operation is geometrically correct within a determined tolerance
C EdgeSetNoder | Nodes a set of edges
C LineBuilder | Forms JTS LineStrings out of a the graph of geomgraph::DirectedEdge created by an OverlayOp
C MaximalEdgeRing | A ring of edges which may contain nodes of degree > 2
C MinimalEdgeRing | A ring of Edges with the property that no node has degree greater than 2
C OverlayNodeFactory | Creates nodes for use in the geomgraph::PlanarGraph constructed during overlay operations. NOTE: also used by operation::valid
C overlayOp | OverlayOp::overlayOp Adapter for use with geom::BinaryOp
C OverlayOp | Computes the geometric overlay of two Geometry
C PointBuilder | Constructs geom::Point s from the nodes of an overlay graph
C PolygonBuilder | Forms Polygon out of a graph of geomgraph::DirectedEdge
►Npolygonize |
C EdgeRing | Represents a ring of PolygonizeDirectedEdge which form a ring of a polygon. The ring may be either an outer shell or a hole
C PolygonizeDirectedEdge | A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph
C 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
C Polygonizer | Polygonizes a set of Geometrys which contain linework that represents the edges of a planar graph
►Npredicate |
C RectangleContains | Optimized implementation of spatial predicate "contains" for cases where the first Geometry is a rectangle
C RectangleIntersects | Optimized implementation of the "intersects" spatial predicate for cases where one Geometry is a rectangle
C SegmentIntersectionTester | Tests if any line segments in two sets of CoordinateSequences intersect
►N relate | Contains classes to implement the computation of the spatial relationships of `Geometry`s
C EdgeEndBuilder | Computes the geomgraph::EdgeEnd objects which arise from a noded geomgraph::Edge
C EdgeEndBundle | A collection of geomgraph::EdgeEnd objects which originate at the same point and have the same direction
C EdgeEndBundleStar | An ordered list of EdgeEndBundle objects around a RelateNode
C RelateComputer | Computes the topological relationship between two Geometries
C RelateNode | Represents a node in the topological graph used to compute spatial relationships
C RelateNodeFactory | Used by the geomgraph::NodeMap in a RelateNodeGraph to create RelateNode objects
C RelateNodeGraph | Implements the simple graph of Nodes and geomgraph::EdgeEnd which is all that is required to determine topological relationships between Geometries
C RelateOp | Implements the SFS `relate()` operation on two geom::Geometry objects
►Nsharedpaths |
C SharedPathsOp | Find shared paths among two linear Geometry objects
►N valid | Provides classes for testing the validity of geometries
C ConnectedInteriorTester | This class tests that the interior of an area Geometry (Polygon or MultiPolygon) is connected
C ConsistentAreaTester | Checks that a geomgraph::GeometryGraph representing an area (a Polygon or MultiPolygon ) is consistent with the OGC-SFS semantics for area geometries
C IndexedNestedRingTester | 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
C IsValidOp | Implements the algorithsm required to compute the `isValid()` method for Geometrys
C QuadtreeNestedRingTester | 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
C RepeatedPointTester | Implements the appropriate checks for repeated points (consecutive identical coordinates) as defined in the JTS spec
C SimpleNestedRingTester | Tests whether any of a set of LinearRings are nested inside another ring in the set, using a simple O(n^2) comparison
C SweeplineNestedRingTester | 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
C TopologyValidationError | Contains information about the nature and location of a Geometry validation error
C GeometryGraphOperation | The base class for operations that require GeometryGraph
C IsSimpleOp | Tests whether a Geometry is simple
►N planargraph | Contains classes to implement a planar graph data structure
►N algorithm | Planargraph algorithms
C ConnectedSubgraphFinder | Finds all connected Subgraphs of a PlanarGraph
C DirectedEdge | Represents a directed edge in a PlanarGraph
C DirectedEdgeStar | A sorted collection of DirectedEdge which leave a Node in a PlanarGraph
C Edge | Represents an undirected edge of a PlanarGraph
C GraphComponent | The base class for all graph component classes
C Node | A node in a PlanarGraph is a location where 0 or more Edge meet
C NodeMap | A map of Node, indexed by the coordinate of the node
C PlanarGraph | Represents a directed graph which is embeddable in a planar surface
C Subgraph | A subgraph of a PlanarGraph
►N precision | Provides classes for manipulating the precision model of Geometries
C CommonBits | Determines the maximum number of common most-significant bits in the mantissa of one or numbers
C CommonBitsOp | Provides versions of Geometry spatial functions which use common bit removal to reduce the likelihood of robustness problems
C CommonBitsRemover | Allow computing and removing common mantissa bits from one or more Geometries
C EnhancedPrecisionOp | Provides versions of Geometry spatial functions which use enhanced precision techniques to reduce the likelihood of robustness problems
C GeometryPrecisionReducer | Reduces the precision of a Geometry according to the supplied PrecisionModel, ensuring that the result is topologically valid
C SimpleGeometryPrecisionReducer | Reduces the precision of a Geometry according to the supplied PrecisionModel, without attempting to preserve valid topology
►Nsimplify |
C DouglasPeuckerLineSimplifier | Simplifies a linestring (sequence of points) using the standard Douglas-Peucker algorithm
C DouglasPeuckerSimplifier | Simplifies a Geometry using the standard Douglas-Peucker algorithm
C TaggedLineSegment | A geom::LineSegment which is tagged with its location in a geom::Geometry
C TaggedLinesSimplifier | Simplifies a collection of TaggedLineStrings, preserving topology (in the sense that no new intersections are introduced)
C TaggedLineString | Contains and owns a list of TaggedLineSegments
C TaggedLineStringSimplifier | Simplifies a TaggedLineString, preserving topology (in the sense that no new intersections are introduced). Uses the recursive Douglas-Peucker algorithm
C TopologyPreservingSimplifier | Simplifies a geometry, ensuring that the result is a valid geometry having the same dimension and number of components as the input
►Ntriangulate |
►Nquadedge |
C LastFoundQuadEdgeLocator |
C QuadEdge |
C QuadEdgeLocator |
C QuadEdgeSubdivision |
C TriangleVisitor |
C Vertex |
C DelaunayTriangulationBuilder |
C IncrementalDelaunayTriangulator |
C VoronoiDiagramBuilder |
►Nutil |
C AssertionFailedException | Indicates a bug in GEOS code
C CoordinateArrayFilter |
C GeometricShapeFactory |
C GEOSException | Base class for all GEOS exceptions
C IllegalArgumentException | Indicates one or more illegal arguments
C IllegalStateException | Indicates an illegal state
C Interrupt |
C TopologyException | Indicates an invalid or inconsistent topological situation encountered during processing
C UnsupportedOperationException | Indicates that the requested operation is unsupported