Sophie

Sophie

distrib > Fedora > 14 > x86_64 > by-pkgid > 5035839f674c88dea1f7928a86fbdc64 > files > 645

geos-devel-3.2.1-3.fc14.x86_64.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>GEOS: Class List</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.1 -->
<div class="navigation" id="top">
  <div class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
      <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
    </ul>
  </div>
  <div class="tabs2">
    <ul class="tablist">
      <li class="current"><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
      <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<h1>Class List</h1>  </div>
</div>
<div class="contents">
Here are the classes, structs, unions and interfaces with brief descriptions:<table>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1AbstractNode.html">geos::index::strtree::AbstractNode</a></td><td class="indexvalue">A node of the STR tree </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1AbstractPreparedPolygonContains.html">geos::geom::prep::AbstractPreparedPolygonContains</a></td><td class="indexvalue">A base class containing the logic for computes the <code>contains</code> and <code>covers</code> spatial relationship predicates for a <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">PreparedPolygon</a> relative to all other <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html">geos::index::strtree::AbstractSTRtree</a></td><td class="indexvalue">Base class for <a class="el" href="classgeos_1_1index_1_1strtree_1_1STRtree.html" title="A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatia...">STRtree</a> and <a class="el" href="classgeos_1_1index_1_1strtree_1_1SIRtree.html" title="One-dimensional version of an STR-packed R-tree.">SIRtree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1Angle.html">geos::algorithm::Angle</a></td><td class="indexvalue">Utility functions for working with angles </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1AssertionFailedException.html">geos::util::AssertionFailedException</a></td><td class="indexvalue">Indicates a bug in GEOS code </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1BasicPreparedGeometry.html">geos::geom::prep::BasicPreparedGeometry</a></td><td class="indexvalue">A base class for <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedGeometry.html">PreparedGeometry</a> subclasses </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1BasicSegmentString.html">geos::noding::BasicSegmentString</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1bintree_1_1Bintree.html">geos::index::bintree::Bintree</a></td><td class="indexvalue">An BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1Boundable.html">geos::index::strtree::Boundable</a></td><td class="indexvalue">A spatial object in an <a class="el" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html" title="Base class for STRtree and SIRtree.">AbstractSTRtree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1BoundaryNodeRule.html">geos::algorithm::BoundaryNodeRule</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1BufferBuilder.html">geos::operation::buffer::BufferBuilder</a></td><td class="indexvalue">Builds the buffer geometry for a given input geometry and precision model </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1BufferInputLineSimplifier.html">geos::operation::buffer::BufferInputLineSimplifier</a></td><td class="indexvalue">Simplifies a buffer input line to remove concavities with shallow depth </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1BufferOp.html">geos::operation::buffer::BufferOp</a></td><td class="indexvalue">Computes the buffer of a geometry, for both positive and negative buffer distances </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1BufferParameters.html">geos::operation::buffer::BufferParameters</a></td><td class="indexvalue">Contains the parameters which describe how a buffer should be constructed </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1BufferSubgraph.html">geos::operation::buffer::BufferSubgraph</a></td><td class="indexvalue">A connected subset of the graph of DirectedEdge and geomgraph::Node </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1geounion_1_1CascadedPolygonUnion.html">geos::operation::geounion::CascadedPolygonUnion</a></td><td class="indexvalue">Provides an efficient method of unioning a collection of <a class="el" href="">Polygonal</a> geometries. This algorithm is faster and likely more robust than the simple iterated approach of repeatedly unioning each polygon to a result geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1CentralEndpointIntersector.html">geos::algorithm::CentralEndpointIntersector</a></td><td class="indexvalue">Computes an approximate intersection of two line segments by taking the most central of the endpoints of the segments </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1CentroidArea.html">geos::algorithm::CentroidArea</a></td><td class="indexvalue">Computes the centroid of an area geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1CGAlgorithms.html">geos::algorithm::CGAlgorithms</a></td><td class="indexvalue">Specifies and implements various fundamental Computational Geometric algorithms. The algorithms supplied in this class are robust for double-precision floating point </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1precision_1_1CommonBits.html">geos::precision::CommonBits</a></td><td class="indexvalue">Determines the maximum number of common most-significant bits in the mantissa of one or numbers </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1precision_1_1CommonBitsOp.html">geos::precision::CommonBitsOp</a></td><td class="indexvalue">Provides versions of Geometry spatial functions which use common bit removal to reduce the likelihood of robustness problems </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1precision_1_1CommonBitsRemover.html">geos::precision::CommonBitsRemover</a></td><td class="indexvalue">Allow computing and removing common mantissa bits from one or more Geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1ComponentCoordinateExtracter.html">geos::geom::util::ComponentCoordinateExtracter</a></td><td class="indexvalue">Extracts a single representative <a class="el" href="classgeos_1_1geom_1_1Coordinate.html">Coordinate</a> from each connected component of a <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1distance_1_1ConnectedElementLocationFilter.html">geos::operation::distance::ConnectedElementLocationFilter</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1operation_1_1distance_1_1ConnectedElementPointFilter.html" title="Extracts a single point from each connected element in a Geometry (e.g. a polygon, linestring or point) and returns them in a list.">ConnectedElementPointFilter</a> 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 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1distance_1_1ConnectedElementPointFilter.html">geos::operation::distance::ConnectedElementPointFilter</a></td><td class="indexvalue">Extracts a single point from each connected element in a Geometry (e.g. a polygon, linestring or point) and returns them in a list </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1ConnectedInteriorTester.html">geos::operation::valid::ConnectedInteriorTester</a></td><td class="indexvalue">This class tests that the interior of an area Geometry (Polygon or MultiPolygon) is connected </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1algorithm_1_1ConnectedSubgraphFinder.html">geos::planargraph::algorithm::ConnectedSubgraphFinder</a></td><td class="indexvalue">Finds all connected <a class="el" href="classgeos_1_1planargraph_1_1Subgraph.html">Subgraph</a>s of a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">PlanarGraph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1ConsistentAreaTester.html">geos::operation::valid::ConsistentAreaTester</a></td><td class="indexvalue">Checks that a <a class="el" href="">geomgraph::GeometryGraph</a> representing an area (a <a class="el" href="">Polygon</a> or <a class="el" href="">MultiPolygon</a> ) is consistent with the OGC-SFS semantics for area geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1ConvexHull.html">geos::algorithm::ConvexHull</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Coordinate.html">geos::geom::Coordinate</a></td><td class="indexvalue"><a class="el" href="classgeos_1_1geom_1_1Coordinate.html" title="Coordinate is the lightweight class used to store coordinates.">Coordinate</a> is the lightweight class used to store coordinates </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1CoordinateArrayFilter.html">geos::util::CoordinateArrayFilter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateArraySequence.html">geos::geom::CoordinateArraySequence</a></td><td class="indexvalue">The default implementation of <a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html" title="The internal representation of a list of coordinates inside a Geometry.">CoordinateSequence</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateArraySequenceFactory.html">geos::geom::CoordinateArraySequenceFactory</a></td><td class="indexvalue">Creates CoordinateSequences internally represented as an array of Coordinates </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateFilter.html">geos::geom::CoordinateFilter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="structgeos_1_1geom_1_1CoordinateLessThen.html">geos::geom::CoordinateLessThen</a></td><td class="indexvalue">Strict weak ordering Functor for <a class="el" href="classgeos_1_1geom_1_1Coordinate.html" title="Coordinate is the lightweight class used to store coordinates.">Coordinate</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateList.html">geos::geom::CoordinateList</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1CoordinateOperation.html">geos::geom::util::CoordinateOperation</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html">geos::geom::CoordinateSequence</a></td><td class="indexvalue">The internal representation of a list of coordinates inside a <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateSequenceFactory.html">geos::geom::CoordinateSequenceFactory</a></td><td class="indexvalue">A factory to create concrete instances of <a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html">CoordinateSequence</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1CoordinateSequenceFilter.html">geos::geom::CoordinateSequenceFilter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Dimension.html">geos::geom::Dimension</a></td><td class="indexvalue">Constants representing the dimensions of a point, a curve and a surface </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html">geos::planargraph::DirectedEdge</a></td><td class="indexvalue">Represents a directed edge in a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">PlanarGraph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1DirectedEdge.html">geos::geomgraph::DirectedEdge</a></td><td class="indexvalue">A directed <a class="el" href="classgeos_1_1geomgraph_1_1EdgeEnd.html" title="Models the end of an edge incident on a node.">EdgeEnd</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1DirectedEdgeStar.html">geos::planargraph::DirectedEdgeStar</a></td><td class="indexvalue">A sorted collection of <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html" title="Represents a directed edge in a PlanarGraph.">DirectedEdge</a> which leave a <a class="el" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">Node</a> in a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">PlanarGraph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1DirectedEdgeStar.html">geos::geomgraph::DirectedEdgeStar</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1geomgraph_1_1DirectedEdgeStar.html" title="A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node.">DirectedEdgeStar</a> is an ordered list of <b>outgoing</b> DirectedEdges around a node </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1distance_1_1DiscreteHausdorffDistance.html">geos::algorithm::distance::DiscreteHausdorffDistance</a></td><td class="indexvalue">An algorithm for computing a distance metric which is an approximation to the Hausdorff Distance based on a discretization of the input <a class="el" href="">Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1distance_1_1DistanceOp.html">geos::operation::distance::DistanceOp</a></td><td class="indexvalue">Find two points on two <a class="el" href="">Geometry</a>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) </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1distance_1_1DistanceToPoint.html">geos::algorithm::distance::DistanceToPoint</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1DoubleBits.html">geos::index::quadtree::DoubleBits</a></td><td class="indexvalue"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1DoubleBits.html" title="DoubleBits manipulates Double numbers by using bit manipulation and bit-field extraction.">DoubleBits</a> manipulates Double numbers by using bit manipulation and bit-field extraction </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1DouglasPeuckerLineSimplifier.html">geos::simplify::DouglasPeuckerLineSimplifier</a></td><td class="indexvalue">Simplifies a linestring (sequence of points) using the standard Douglas-Peucker algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1DouglasPeuckerSimplifier.html">geos::simplify::DouglasPeuckerSimplifier</a></td><td class="indexvalue">Simplifies a Geometry using the standard Douglas-Peucker algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1Edge.html">geos::planargraph::Edge</a></td><td class="indexvalue">Represents an undirected edge of a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">PlanarGraph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1EdgeEnd.html">geos::geomgraph::EdgeEnd</a></td><td class="indexvalue">Models the end of an edge incident on a node </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1EdgeEndBuilder.html">geos::operation::relate::EdgeEndBuilder</a></td><td class="indexvalue">Computes the <a class="el" href="classgeos_1_1geomgraph_1_1EdgeEnd.html" title="Models the end of an edge incident on a node.">geomgraph::EdgeEnd</a> objects which arise from a noded geomgraph::Edge </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1EdgeEndBundle.html">geos::operation::relate::EdgeEndBundle</a></td><td class="indexvalue">A collection of <a class="el" href="classgeos_1_1geomgraph_1_1EdgeEnd.html" title="Models the end of an edge incident on a node.">geomgraph::EdgeEnd</a> objects which originate at the same point and have the same direction </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1EdgeEndBundleStar.html">geos::operation::relate::EdgeEndBundleStar</a></td><td class="indexvalue">An ordered list of <a class="el" href="classgeos_1_1operation_1_1relate_1_1EdgeEndBundle.html" title="A collection of geomgraph::EdgeEnd objects which originate at the same point and have the same direct...">EdgeEndBundle</a> objects around a <a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateNode.html" title="Represents a node in the topological graph used to compute spatial relationships.">RelateNode</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1EdgeEndStar.html">geos::geomgraph::EdgeEndStar</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1geomgraph_1_1EdgeEndStar.html" title="A EdgeEndStar is an ordered list of EdgeEnds around a node.">EdgeEndStar</a> is an ordered list of EdgeEnds around a node </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1EdgeIntersection.html">geos::geomgraph::EdgeIntersection</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1EdgeIntersectionList.html">geos::geomgraph::EdgeIntersectionList</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1EdgeList.html">geos::geomgraph::EdgeList</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1EdgeNodingValidator.html">geos::geomgraph::EdgeNodingValidator</a></td><td class="indexvalue">Validates that a collection of SegmentStrings is correctly noded </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1EdgeRing.html">geos::operation::polygonize::EdgeRing</a></td><td class="indexvalue">Represents a ring of <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html" title="A DirectedEdge of a PolygonizeGraph, which represents an edge of a polygon formed by the graph...">PolygonizeDirectedEdge</a> which form a ring of a polygon. The ring may be either an outer shell or a hole </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1EdgeSetNoder.html">geos::operation::overlay::EdgeSetNoder</a></td><td class="indexvalue">Nodes a set of edges </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1linemerge_1_1EdgeString.html">geos::operation::linemerge::EdgeString</a></td><td class="indexvalue">A sequence of <a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMergeDirectedEdge.html" title="A planargraph::DirectedEdge of a LineMergeGraph.">LineMergeDirectedEdge</a> forming one of the lines that will be output by the line-merging process </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1precision_1_1EnhancedPrecisionOp.html">geos::precision::EnhancedPrecisionOp</a></td><td class="indexvalue">Provides versions of Geometry spatial functions which use enhanced precision techniques to reduce the likelihood of robustness problems </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Envelope.html">geos::geom::Envelope</a></td><td class="indexvalue">An <a class="el" href="classgeos_1_1geom_1_1Envelope.html" title="An Envelope defines a rectangulare region of the 2D coordinate plane.">Envelope</a> defines a rectangulare region of the 2D coordinate plane </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1ExtractLineByLocation.html">geos::linearref::ExtractLineByLocation</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1FastNodingValidator.html">geos::noding::FastNodingValidator</a></td><td class="indexvalue">Validates that a collection of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html">SegmentString</a>s is correctly noded </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1FastSegmentSetIntersectionFinder.html">geos::noding::FastSegmentSetIntersectionFinder</a></td><td class="indexvalue">Finds if two sets of <a class="el" href="">SegmentStrings</a>s intersect </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1validate_1_1FuzzyPointLocator.html">geos::operation::overlay::validate::FuzzyPointLocator</a></td><td class="indexvalue">Finds the most likely Location of a point relative to the polygonal components of a geometry, using a tolerance value </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1GeometricShapeFactory.html">geos::util::GeometricShapeFactory</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Geometry.html">geos::geom::Geometry</a></td><td class="indexvalue">Basic implementation of <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a>, constructed and destructed by <a class="el" href="classgeos_1_1geom_1_1GeometryFactory.html" title="Supplies a set of utility methods for building Geometry objects from CoordinateSequence or other Geom...">GeometryFactory</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1GeometryCollection.html">geos::geom::GeometryCollection</a></td><td class="indexvalue">Represents a collection of heterogeneous <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> objects </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1GeometryCombiner.html">geos::geom::util::GeometryCombiner</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1GeometryComponentFilter.html">geos::geom::GeometryComponentFilter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1GeometryEditor.html">geos::geom::util::GeometryEditor</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1GeometryEditorOperation.html">geos::geom::util::GeometryEditorOperation</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1GeometryFactory.html">geos::geom::GeometryFactory</a></td><td class="indexvalue">Supplies a set of utility methods for building <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> objects from <a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html" title="The internal representation of a list of coordinates inside a Geometry.">CoordinateSequence</a> or other <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> objects </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1GeometryFilter.html">geos::geom::GeometryFilter</a></td><td class="indexvalue"><a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> classes support the concept of applying a <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> filter to the <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1GeometryGraphOperation.html">geos::operation::GeometryGraphOperation</a></td><td class="indexvalue">The base class for operations that require GeometryGraph </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1GeometryList.html">geos::geom::GeometryList</a></td><td class="indexvalue">Manager of <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> pointers. Owns the Geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1geounion_1_1GeometryListHolder.html">geos::operation::geounion::GeometryListHolder</a></td><td class="indexvalue">Helper class holding Geometries, part of which are held by reference others are held exclusively </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1distance_1_1GeometryLocation.html">geos::operation::distance::GeometryLocation</a></td><td class="indexvalue">Represents the location of a point on a Geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1snap_1_1GeometrySnapper.html">geos::operation::overlay::snap::GeometrySnapper</a></td><td class="indexvalue">Snaps the vertices and segments of a geometry to another's vertices. Should improve robustness for overlay operations </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1GeometryTransformer.html">geos::geom::util::GeometryTransformer</a></td><td class="indexvalue">A framework for processes which transform an input <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> into an output <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a>, possibly changing its structure and type(s) </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1GEOSException.html">geos::util::GEOSException</a></td><td class="indexvalue">Base class for all GEOS exceptions </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1GraphComponent.html">geos::planargraph::GraphComponent</a></td><td class="indexvalue">The base class for all graph component classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1HCoordinate.html">geos::algorithm::HCoordinate</a></td><td class="indexvalue">Represents a homogeneous coordinate in a 2-D coordinate space </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1snapround_1_1HotPixel.html">geos::noding::snapround::HotPixel</a></td><td class="indexvalue">Implements a "hot pixel" as used in the Snap Rounding algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1IllegalArgumentException.html">geos::util::IllegalArgumentException</a></td><td class="indexvalue">Indicates one or more legal arguments </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1IndexedNestedRingTester.html">geos::operation::valid::IndexedNestedRingTester</a></td><td class="indexvalue">Tests whether any of a set of <a class="el" href="">LinearRing</a>s are nested inside another ring in the set, using a spatial index to speed up the comparisons </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1locate_1_1IndexedPointInAreaLocator.html">geos::algorithm::locate::IndexedPointInAreaLocator</a></td><td class="indexvalue">Determines the location of <a class="el" href="">Coordinate</a>s relative to a <a class="el" href="">Polygon</a> or <a class="el" href="">MultiPolygon</a> geometry, using indexing for efficiency </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1InteriorPointArea.html">geos::algorithm::InteriorPointArea</a></td><td class="indexvalue">Computes a point in the interior of an area geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1InteriorPointLine.html">geos::algorithm::InteriorPointLine</a></td><td class="indexvalue">Computes a point in the interior of an linear geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1InteriorPointPoint.html">geos::algorithm::InteriorPointPoint</a></td><td class="indexvalue">Computes a point in the interior of an point geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1IntersectionAdder.html">geos::noding::IntersectionAdder</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1IntersectionFinderAdder.html">geos::noding::IntersectionFinderAdder</a></td><td class="indexvalue">Finds proper and interior intersections in a set of SegmentStrings, and adds them as nodes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1IntersectionMatrix.html">geos::geom::IntersectionMatrix</a></td><td class="indexvalue">Implementation of Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree_1_1IntersectsOp.html">geos::index::strtree::AbstractSTRtree::IntersectsOp</a></td><td class="indexvalue">A test for intersection between two bounds, necessary because subclasses of <a class="el" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html" title="Base class for STRtree and SIRtree.">AbstractSTRtree</a> have different implementations of bounds </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1Interval.html">geos::index::strtree::Interval</a></td><td class="indexvalue">A contiguous portion of 1D-space. Used internally by <a class="el" href="classgeos_1_1index_1_1strtree_1_1SIRtree.html" title="One-dimensional version of an STR-packed R-tree.">SIRtree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1bintree_1_1Interval.html">geos::index::bintree::Interval</a></td><td class="indexvalue">Represents an (1-dimensional) closed interval on the Real number line </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1IntervalSize.html">geos::index::quadtree::IntervalSize</a></td><td class="indexvalue">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 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1IsSimpleOp.html">geos::operation::IsSimpleOp</a></td><td class="indexvalue">Tests whether a Geometry is simple </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1IsValidOp.html">geos::operation::valid::IsValidOp</a></td><td class="indexvalue">Implements the algorithsm required to compute the <code>isValid()</code> method for <a class="el" href="">Geometry</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1ItemBoundable.html">geos::index::strtree::ItemBoundable</a></td><td class="indexvalue"><a class="el" href="classgeos_1_1index_1_1strtree_1_1Boundable.html" title="A spatial object in an AbstractSTRtree.">Boundable</a> wrapper for a non-Boundable spatial object. Used internally by <a class="el" href="classgeos_1_1index_1_1strtree_1_1AbstractSTRtree.html" title="Base class for STRtree and SIRtree.">AbstractSTRtree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1ItemVisitor.html">geos::index::ItemVisitor</a></td><td class="indexvalue">A visitor for items in an index </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1IteratedNoder.html">geos::noding::IteratedNoder</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1Key.html">geos::index::quadtree::Key</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1index_1_1quadtree_1_1Key.html" title="A Key is a unique identifier for a node in a quadtree.">Key</a> is a unique identifier for a node in a quadtree </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1bintree_1_1Key.html">geos::index::bintree::Key</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1index_1_1bintree_1_1Key.html" title="A Key is a unique identifier for a node in a tree.">Key</a> is a unique identifier for a node in a tree </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1Label.html">geos::geomgraph::Label</a></td><td class="indexvalue">A <code><a class="el" href="classgeos_1_1geomgraph_1_1Label.html" title="A Label indicates the topological relationship of a component of a topology graph to a given Geometry...">Label</a></code> indicates the topological relationship of a component of a topology graph to a given <code>Geometry</code>. This class supports labels for relationships to two <code>Geometry</code>s, which is sufficient for algorithms for binary operations </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LengthIndexedLine.html">geos::linearref::LengthIndexedLine</a></td><td class="indexvalue">Supports linear referencing along a linear <a class="el" href="">Geometry</a> 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 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LengthLocationMap.html">geos::linearref::LengthLocationMap</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1LinearComponentExtracter.html">geos::geom::util::LinearComponentExtracter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LinearGeometryBuilder.html">geos::linearref::LinearGeometryBuilder</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LinearIterator.html">geos::linearref::LinearIterator</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LinearLocation.html">geos::linearref::LinearLocation</a></td><td class="indexvalue">Represents a location along a <a class="el" href="">LineString</a> or <a class="el" href="">MultiLineString</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1LinearRing.html">geos::geom::LinearRing</a></td><td class="indexvalue">Models an OGC SFS <code><a class="el" href="classgeos_1_1geom_1_1LinearRing.html" title="Models an OGC SFS LinearRing.">LinearRing</a></code> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1LineBuilder.html">geos::operation::overlay::LineBuilder</a></td><td class="indexvalue">Forms JTS LineStrings out of a the graph of <a class="el" href="classgeos_1_1geomgraph_1_1DirectedEdge.html" title="A directed EdgeEnd.">geomgraph::DirectedEdge</a> created by an <a class="el" href="classgeos_1_1operation_1_1overlay_1_1OverlayOp.html" title="Computes the overlay of two Geometry.">OverlayOp</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1LineIntersector.html">geos::algorithm::LineIntersector</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1algorithm_1_1LineIntersector.html" title="A LineIntersector is an algorithm that can both test whether two line segments intersect and compute ...">LineIntersector</a> is an algorithm that can both test whether two line segments intersect and compute the intersection point if they do </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMergeDirectedEdge.html">geos::operation::linemerge::LineMergeDirectedEdge</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1planargraph_1_1DirectedEdge.html" title="Represents a directed edge in a PlanarGraph.">planargraph::DirectedEdge</a> of a <a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMergeGraph.html" title="A planar graph of edges that is analyzed to sew the edges together.">LineMergeGraph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMergeEdge.html">geos::operation::linemerge::LineMergeEdge</a></td><td class="indexvalue">An edge of a <a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMergeGraph.html" title="A planar graph of edges that is analyzed to sew the edges together.">LineMergeGraph</a>. The <code>marked</code> field indicates whether this Edge has been logically deleted from the graph </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMergeGraph.html">geos::operation::linemerge::LineMergeGraph</a></td><td class="indexvalue">A planar graph of edges that is analyzed to sew the edges together </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineMerger.html">geos::operation::linemerge::LineMerger</a></td><td class="indexvalue">Sews together a set of fully noded LineStrings </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1LineSegment.html">geos::geom::LineSegment</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1linemerge_1_1LineSequencer.html">geos::operation::linemerge::LineSequencer</a></td><td class="indexvalue">Builds a sequence from a set of LineStrings so that they are ordered end to end </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1LineString.html">geos::geom::LineString</a></td><td class="indexvalue">Basic implementation of <a class="el" href="classgeos_1_1geom_1_1LineString.html" title="Basic implementation of LineString.">LineString</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1snap_1_1LineStringSnapper.html">geos::operation::overlay::snap::LineStringSnapper</a></td><td class="indexvalue">Snaps the vertices and segments of a LineString to a set of target snap vertices </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Location.html">geos::geom::Location</a></td><td class="indexvalue">Constants representing the location of a point relative to a geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LocationIndexOfLine.html">geos::linearref::LocationIndexOfLine</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1linearref_1_1LocationIndexOfPoint.html">geos::linearref::LocationIndexOfPoint</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1MaximalEdgeRing.html">geos::operation::overlay::MaximalEdgeRing</a></td><td class="indexvalue">A ring of <a class="el" href="">edges</a> which may contain nodes of degree &gt; 2 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1MCIndexNoder.html">geos::noding::MCIndexNoder</a></td><td class="indexvalue">Nodes a set of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html" title="An interface for classes which represent a sequence of contiguous line segments.">SegmentString</a> using a index based on <a class="el" href="classgeos_1_1index_1_1chain_1_1MonotoneChain.html" title="Monotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of...">index::chain::MonotoneChain</a> and a <a class="el" href="classgeos_1_1index_1_1SpatialIndex.html" title="Abstract class defines basic insertion and query operations supported by classes implementing spatial...">index::SpatialIndex</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1snapround_1_1MCIndexPointSnapper.html">geos::noding::snapround::MCIndexPointSnapper</a></td><td class="indexvalue">"Snaps" all <a class="el" href="classgeos_1_1noding_1_1SegmentString.html">SegmentString</a>s in a <a class="el" href="">SpatialIndex</a> containing <a class="el" href="">MonotoneChain</a>s to a given <a class="el" href="classgeos_1_1noding_1_1snapround_1_1HotPixel.html">HotPixel</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1MCIndexSegmentSetMutualIntersector.html">geos::noding::MCIndexSegmentSetMutualIntersector</a></td><td class="indexvalue">Intersects two sets of <a class="el" href="">SegmentStrings</a> using a index based on <a class="el" href="">MonotoneChain</a>s and a <a class="el" href="">SpatialIndex</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1snapround_1_1MCIndexSnapRounder.html">geos::noding::snapround::MCIndexSnapRounder</a></td><td class="indexvalue">Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html" title="An interface for classes which represent a sequence of contiguous line segments.">SegmentString</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1MinimalEdgeRing.html">geos::operation::overlay::MinimalEdgeRing</a></td><td class="indexvalue">A ring of <a class="el" href="">Edge</a>s with the property that no node has degree greater than 2 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1MinimumDiameter.html">geos::algorithm::MinimumDiameter</a></td><td class="indexvalue">Computes the minimum diameter of a <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">geom::Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1chain_1_1MonotoneChain.html">geos::index::chain::MonotoneChain</a></td><td class="indexvalue">Monotone Chains are a way of partitioning the segments of a linestring to allow for fast searching of intersections </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1index_1_1MonotoneChain.html">geos::geomgraph::index::MonotoneChain</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1chain_1_1MonotoneChainBuilder.html">geos::index::chain::MonotoneChainBuilder</a></td><td class="indexvalue">Constructs <a class="el" href="classgeos_1_1index_1_1chain_1_1MonotoneChain.html">MonotoneChain</a>s for sequences of <a class="el" href="">Coordinate</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1chain_1_1MonotoneChainOverlapAction.html">geos::index::chain::MonotoneChainOverlapAction</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1chain_1_1MonotoneChainSelectAction.html">geos::index::chain::MonotoneChainSelectAction</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1MultiLineString.html">geos::geom::MultiLineString</a></td><td class="indexvalue">Basic implementation of <a class="el" href="classgeos_1_1geom_1_1MultiLineString.html" title="Basic implementation of MultiLineString objects.">MultiLineString</a> objects </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1MultiPoint.html">geos::geom::MultiPoint</a></td><td class="indexvalue">Models a collection of <a class="el" href="classgeos_1_1geom_1_1Point.html" title="Basic implementation of Point.">Point</a> objects </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1MultiPolygon.html">geos::geom::MultiPolygon</a></td><td class="indexvalue">Basic implementation of <code><a class="el" href="classgeos_1_1geom_1_1MultiPolygon.html" title="Basic implementation of MultiPolygon.">MultiPolygon</a></code> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1NodableSegmentString.html">geos::noding::NodableSegmentString</a></td><td class="indexvalue">An interface for classes which support adding nodes to a segment string </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1bintree_1_1Node.html">geos::index::bintree::Node</a></td><td class="indexvalue">A node of a <a class="el" href="classgeos_1_1index_1_1bintree_1_1Bintree.html" title="An BinTree (or &quot;Binary Interval Tree&quot;) is a 1-dimensional version of a quadtree.">Bintree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1Node.html">geos::index::quadtree::Node</a></td><td class="indexvalue">Represents a node of a <a class="el" href="classgeos_1_1index_1_1quadtree_1_1Quadtree.html" title="A Quadtree is a spatial index structure for efficient querying of 2D rectangles. If other kinds of sp...">Quadtree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1Node.html">geos::planargraph::Node</a></td><td class="indexvalue">A node in a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">PlanarGraph</a> is a location where 0 or more <a class="el" href="classgeos_1_1planargraph_1_1Edge.html" title="Represents an undirected edge of a PlanarGraph.">Edge</a> meet </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1bintree_1_1NodeBase.html">geos::index::bintree::NodeBase</a></td><td class="indexvalue">The base class for nodes in a <a class="el" href="classgeos_1_1index_1_1bintree_1_1Bintree.html" title="An BinTree (or &quot;Binary Interval Tree&quot;) is a 1-dimensional version of a quadtree.">Bintree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1NodeBase.html">geos::index::quadtree::NodeBase</a></td><td class="indexvalue">The base class for nodes in a <a class="el" href="classgeos_1_1index_1_1quadtree_1_1Quadtree.html" title="A Quadtree is a spatial index structure for efficient querying of 2D rectangles. If other kinds of sp...">Quadtree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1NodedSegmentString.html">geos::noding::NodedSegmentString</a></td><td class="indexvalue">Represents a list of contiguous line segments, and supports noding the segments </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1NodeMap.html">geos::planargraph::NodeMap</a></td><td class="indexvalue">A map of <a class="el" href="classgeos_1_1planargraph_1_1Node.html" title="A node in a PlanarGraph is a location where 0 or more Edge meet.">Node</a>, indexed by the coordinate of the node </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1Noder.html">geos::noding::Noder</a></td><td class="indexvalue">Computes all intersections between segments in a set of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html" title="An interface for classes which represent a sequence of contiguous line segments.">SegmentString</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1NodingValidator.html">geos::noding::NodingValidator</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1NotRepresentableException.html">geos::algorithm::NotRepresentableException</a></td><td class="indexvalue">Indicates that a <a class="el" href="classgeos_1_1algorithm_1_1HCoordinate.html" title="Represents a homogeneous coordinate in a 2-D coordinate space.">HCoordinate</a> has been computed which is not representable on the Cartesian plane </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1Octant.html">geos::noding::Octant</a></td><td class="indexvalue">Methods for computing and working with octants of the Cartesian plane </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1OffsetCurveBuilder.html">geos::operation::buffer::OffsetCurveBuilder</a></td><td class="indexvalue">Computes the raw offset curve for a single Geometry component (ring, line or point) </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1OffsetCurveSetBuilder.html">geos::operation::buffer::OffsetCurveSetBuilder</a></td><td class="indexvalue">Creates all the raw offset curves for a buffer of a Geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1OffsetCurveVertexList.html">geos::operation::buffer::OffsetCurveVertexList</a></td><td class="indexvalue">A list of the vertices in a constructed offset curve </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1validate_1_1OffsetPointGenerator.html">geos::operation::overlay::validate::OffsetPointGenerator</a></td><td class="indexvalue">Generates points offset from both sides of all segments in a geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1OrientedCoordinateArray.html">geos::noding::OrientedCoordinateArray</a></td><td class="indexvalue">Allows comparing <a class="el" href="classgeos_1_1geom_1_1CoordinateSequence.html">geom::CoordinateSequence</a>s in an orientation-independent way </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1OverlayNodeFactory.html">geos::operation::overlay::OverlayNodeFactory</a></td><td class="indexvalue">Creates nodes for use in the <a class="el" href="classgeos_1_1geomgraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">geomgraph::PlanarGraph</a> constructed during overlay operations. NOTE: also used by <a class="el" href="namespacegeos_1_1operation_1_1valid.html" title="Provides classes for testing the validity of geometries.">operation::valid</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1OverlayOp.html">geos::operation::overlay::OverlayOp</a></td><td class="indexvalue">Computes the overlay of two Geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="structgeos_1_1operation_1_1overlay_1_1overlayOp.html">geos::operation::overlay::overlayOp</a></td><td class="indexvalue">OverlayOp::overlayOp Adapter for use with geom::BinaryOp </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1validate_1_1OverlayResultValidator.html">geos::operation::overlay::validate::OverlayResultValidator</a></td><td class="indexvalue">Validates that the result of an overlay operation is geometrically correct within a determined tolerance </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1io_1_1ParseException.html">geos::io::ParseException</a></td><td class="indexvalue">Notifies a parsing error </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1PlanarGraph.html">geos::geomgraph::PlanarGraph</a></td><td class="indexvalue">Represents a directed graph which is embeddable in a planar surface </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html">geos::planargraph::PlanarGraph</a></td><td class="indexvalue">Represents a directed graph which is embeddable in a planar surface </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Point.html">geos::geom::Point</a></td><td class="indexvalue">Basic implementation of <a class="el" href="classgeos_1_1geom_1_1Point.html" title="Basic implementation of Point.">Point</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1PointBuilder.html">geos::operation::overlay::PointBuilder</a></td><td class="indexvalue">Constructs <a class="el" href="classgeos_1_1geom_1_1Point.html" title="Basic implementation of Point.">geom::Point</a> s from the nodes of an overlay graph </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1PointExtracter.html">geos::geom::util::PointExtracter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1PointLocator.html">geos::algorithm::PointLocator</a></td><td class="indexvalue">Computes the topological relationship (Location) of a single point to a Geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1locate_1_1PointOnGeometryLocator.html">geos::algorithm::locate::PointOnGeometryLocator</a></td><td class="indexvalue">An interface for classes which determine the <a class="el" href="">Location</a> of points in <a class="el" href="">Polygon</a> or <a class="el" href="">MultiPolygon</a> geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1distance_1_1PointPairDistance.html">geos::algorithm::distance::PointPairDistance</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Polygon.html">geos::geom::Polygon</a></td><td class="indexvalue">Represents a linear polygon, which may include holes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1PolygonBuilder.html">geos::operation::overlay::PolygonBuilder</a></td><td class="indexvalue">Forms Polygon out of a graph of <a class="el" href="classgeos_1_1geomgraph_1_1DirectedEdge.html" title="A directed EdgeEnd.">geomgraph::DirectedEdge</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1PolygonExtracter.html">geos::geom::util::PolygonExtracter</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeDirectedEdge.html">geos::operation::polygonize::PolygonizeDirectedEdge</a></td><td class="indexvalue">A DirectedEdge of a <a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html" title="Represents a planar graph of edges that can be used to compute a polygonization, and implements the a...">PolygonizeGraph</a>, which represents an edge of a polygon formed by the graph </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1PolygonizeGraph.html">geos::operation::polygonize::PolygonizeGraph</a></td><td class="indexvalue">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 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1polygonize_1_1Polygonizer.html">geos::operation::polygonize::Polygonizer</a></td><td class="indexvalue">Polygonizes a set of Geometrys which contain linework that represents the edges of a planar graph </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1PrecisionModel.html">geos::geom::PrecisionModel</a></td><td class="indexvalue">Specifies the precision model of the <a class="el" href="classgeos_1_1geom_1_1Coordinate.html" title="Coordinate is the lightweight class used to store coordinates.">Coordinate</a> in a <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedGeometry.html">geos::geom::prep::PreparedGeometry</a></td><td class="indexvalue">An interface for classes which prepare <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a>s in order to optimize the performance of repeated calls to specific geometric operations </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedGeometryFactory.html">geos::geom::prep::PreparedGeometryFactory</a></td><td class="indexvalue">A factory for creating <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedGeometry.html">PreparedGeometry</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedLineString.html">geos::geom::prep::PreparedLineString</a></td><td class="indexvalue">A prepared version of <a class="el" href="classgeos_1_1geom_1_1LinearRing.html">LinearRing</a>, <a class="el" href="classgeos_1_1geom_1_1LineString.html">LineString</a> or <a class="el" href="classgeos_1_1geom_1_1MultiLineString.html">MultiLineString</a> geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedLineStringIntersects.html">geos::geom::prep::PreparedLineStringIntersects</a></td><td class="indexvalue">Computes the <code>intersects</code> spatial relationship predicate for a target <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedLineString.html">PreparedLineString</a> relative to all other <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPoint.html">geos::geom::prep::PreparedPoint</a></td><td class="indexvalue">A prepared version of <a class="el" href="classgeos_1_1geom_1_1Point.html">Point</a> or <a class="el" href="classgeos_1_1geom_1_1MultiPoint.html">MultiPoint</a> geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">geos::geom::prep::PreparedPolygon</a></td><td class="indexvalue">A prepared version of <a class="el" href="classgeos_1_1geom_1_1Polygon.html">Polygon</a> or <a class="el" href="classgeos_1_1geom_1_1MultiPolygon.html">MultiPolygon</a> geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygonContains.html">geos::geom::prep::PreparedPolygonContains</a></td><td class="indexvalue">Computes the <code>contains</code> spatial relationship predicate for a <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">PreparedPolygon</a> relative to all other <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygonContainsProperly.html">geos::geom::prep::PreparedPolygonContainsProperly</a></td><td class="indexvalue">Computes the <code>containsProperly</code> spatial relationship predicate for <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">PreparedPolygon</a>s relative to all other <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygonCovers.html">geos::geom::prep::PreparedPolygonCovers</a></td><td class="indexvalue">Computes the <code>covers</code> spatial relationship predicate for a <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">PreparedPolygon</a> relative to all other <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygonIntersects.html">geos::geom::prep::PreparedPolygonIntersects</a></td><td class="indexvalue">Computes the <code>intersects</code> spatial relationship predicate for <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">PreparedPolygon</a>s relative to all other <a class="el" href="classgeos_1_1geom_1_1Geometry.html">Geometry</a> classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygonPredicate.html">geos::geom::prep::PreparedPolygonPredicate</a></td><td class="indexvalue">A base class for predicate operations on <a class="el" href="classgeos_1_1geom_1_1prep_1_1PreparedPolygon.html">PreparedPolygon</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1Quadrant.html">geos::geomgraph::Quadrant</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1Quadtree.html">geos::index::quadtree::Quadtree</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1index_1_1quadtree_1_1Quadtree.html" title="A Quadtree is a spatial index structure for efficient querying of 2D rectangles. If other kinds of sp...">Quadtree</a> 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 </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1QuadtreeNestedRingTester.html">geos::operation::valid::QuadtreeNestedRingTester</a></td><td class="indexvalue">Tests whether any of a set of <a class="el" href="">LinearRing</a>s are nested inside another ring in the set, using a <a class="el" href="">Quadtree</a> index to speed up the comparisons </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1RayCrossingCounter.html">geos::algorithm::RayCrossingCounter</a></td><td class="indexvalue">Counts the number of segments crossed by a horizontal ray extending to the right from a given point, in an incremental fashion </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1predicate_1_1RectangleContains.html">geos::operation::predicate::RectangleContains</a></td><td class="indexvalue">Optimized implementation of spatial predicate "contains" for cases where the first Geometry is a rectangle </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1predicate_1_1RectangleIntersects.html">geos::operation::predicate::RectangleIntersects</a></td><td class="indexvalue">Optimized implementation of spatial predicate "intersects" for cases where the first Geometry is a rectangle </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateComputer.html">geos::operation::relate::RelateComputer</a></td><td class="indexvalue">Computes the topological relationship between two Geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateNode.html">geos::operation::relate::RelateNode</a></td><td class="indexvalue">Represents a node in the topological graph used to compute spatial relationships </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateNodeFactory.html">geos::operation::relate::RelateNodeFactory</a></td><td class="indexvalue">Used by the geomgraph::NodeMap in a <a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateNodeGraph.html" title="Implements the simple graph of Nodes and geomgraph::EdgeEnd which is all that is required to determin...">RelateNodeGraph</a> to create <a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateNode.html" title="Represents a node in the topological graph used to compute spatial relationships.">RelateNode</a> objects </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateNodeGraph.html">geos::operation::relate::RelateNodeGraph</a></td><td class="indexvalue">Implements the simple graph of Nodes and <a class="el" href="classgeos_1_1geomgraph_1_1EdgeEnd.html" title="Models the end of an edge incident on a node.">geomgraph::EdgeEnd</a> which is all that is required to determine topological relationships between Geometries </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateOp.html">geos::operation::relate::RelateOp</a></td><td class="indexvalue">Implements the SFS <code><a class="el" href="classgeos_1_1operation_1_1relate_1_1RelateOp.html#a694d50ad7d847328be1e9d4caad2373b" title="Computes the geom::IntersectionMatrix for the spatial relationship between two geom::Geometry objects...">relate()</a></code> operation on two <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">geom::Geometry</a> objects </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1RepeatedPointTester.html">geos::operation::valid::RepeatedPointTester</a></td><td class="indexvalue">Implements the appropriate checks for repeated points (consecutive identical coordinates) as defined in the JTS spec </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1RightmostEdgeFinder.html">geos::operation::buffer::RightmostEdgeFinder</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1operation_1_1buffer_1_1RightmostEdgeFinder.html" title="A RightmostEdgeFinder find the geomgraph::DirectedEdge in a list which has the highest coordinate...">RightmostEdgeFinder</a> find the <a class="el" href="classgeos_1_1geomgraph_1_1DirectedEdge.html" title="A directed EdgeEnd.">geomgraph::DirectedEdge</a> 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.) </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1RobustDeterminant.html">geos::algorithm::RobustDeterminant</a></td><td class="indexvalue">Implements an algorithm to compute the sign of a 2x2 determinant for double precision values robustly </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1quadtree_1_1Root.html">geos::index::quadtree::Root</a></td><td class="indexvalue">QuadRoot is the root of a single <a class="el" href="classgeos_1_1index_1_1quadtree_1_1Quadtree.html" title="A Quadtree is a spatial index structure for efficient querying of 2D rectangles. If other kinds of sp...">Quadtree</a>. It is centred at the origin, and does not have a defined extent </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1bintree_1_1Root.html">geos::index::bintree::Root</a></td><td class="indexvalue">The root node of a single <a class="el" href="classgeos_1_1index_1_1bintree_1_1Bintree.html" title="An BinTree (or &quot;Binary Interval Tree&quot;) is a 1-dimensional version of a quadtree.">Bintree</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1ScaledNoder.html">geos::noding::ScaledNoder</a></td><td class="indexvalue">Wraps a <a class="el" href="classgeos_1_1noding_1_1Noder.html">Noder</a> and transforms its input into the integer domain </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentIntersectionDetector.html">geos::noding::SegmentIntersectionDetector</a></td><td class="indexvalue">Detects and records an intersection between two <a class="el" href="classgeos_1_1noding_1_1SegmentString.html">SegmentString</a>s, if one exists </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1predicate_1_1SegmentIntersectionTester.html">geos::operation::predicate::SegmentIntersectionTester</a></td><td class="indexvalue">Tests if any line segments in two sets of CoordinateSequences intersect. Optimized for use when at least one input is of small size </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentIntersector.html">geos::noding::SegmentIntersector</a></td><td class="indexvalue">Processes possible intersections detected by a <a class="el" href="classgeos_1_1noding_1_1Noder.html" title="Computes all intersections between segments in a set of SegmentString.">Noder</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentNode.html">geos::noding::SegmentNode</a></td><td class="indexvalue">Represents an intersection point between two <a class="el" href="classgeos_1_1noding_1_1NodedSegmentString.html" title="Represents a list of contiguous line segments, and supports noding the segments.">NodedSegmentString</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentNodeList.html">geos::noding::SegmentNodeList</a></td><td class="indexvalue">A list of the <a class="el" href="classgeos_1_1noding_1_1SegmentNode.html" title="Represents an intersection point between two NodedSegmentString.">SegmentNode</a> present along a <a class="el" href="classgeos_1_1noding_1_1NodedSegmentString.html" title="Represents a list of contiguous line segments, and supports noding the segments.">NodedSegmentString</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentSetMutualIntersector.html">geos::noding::SegmentSetMutualIntersector</a></td><td class="indexvalue">An intersector for the red-blue intersection problem </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentString.html">geos::noding::SegmentString</a></td><td class="indexvalue">An interface for classes which represent a sequence of contiguous line segments </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SegmentStringUtil.html">geos::noding::SegmentStringUtil</a></td><td class="indexvalue">Utility methods for processing <a class="el" href="classgeos_1_1noding_1_1SegmentString.html">SegmentString</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1util_1_1ShortCircuitedGeometryVisitor.html">geos::geom::util::ShortCircuitedGeometryVisitor</a></td><td class="indexvalue">A visitor to <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">Geometry</a> elements which can be short-circuited by a given condition </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1precision_1_1SimpleGeometryPrecisionReducer.html">geos::precision::SimpleGeometryPrecisionReducer</a></td><td class="indexvalue">Reduces the precision of a <a class="el" href="">Geometry</a> according to the supplied <a class="el" href="">PrecisionModel</a>, without attempting to preserve valid topology </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1index_1_1SimpleMCSweepLineIntersector.html">geos::geomgraph::index::SimpleMCSweepLineIntersector</a></td><td class="indexvalue">Finds all intersections in one or two sets of edges, using an x-axis sweepline algorithm in conjunction with Monotone Chains </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1SimpleNestedRingTester.html">geos::operation::valid::SimpleNestedRingTester</a></td><td class="indexvalue">Tests whether any of a set of <a class="el" href="">LinearRing</a>s are nested inside another ring in the set, using a simple O(n^2) comparison </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SimpleNoder.html">geos::noding::SimpleNoder</a></td><td class="indexvalue">Nodes a set of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html">SegmentString</a>s by performing a brute-force comparison of every segment to every other one </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1algorithm_1_1locate_1_1SimplePointInAreaLocator.html">geos::algorithm::locate::SimplePointInAreaLocator</a></td><td class="indexvalue">Computes the location of points relative to an areal <a class="el" href="">Geometry</a>, using a simple O(n) algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1snapround_1_1SimpleSnapRounder.html">geos::noding::snapround::SimpleSnapRounder</a></td><td class="indexvalue">Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html">SegmentString</a>s </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1index_1_1SimpleSweepLineIntersector.html">geos::geomgraph::index::SimpleSweepLineIntersector</a></td><td class="indexvalue">Finds all intersections in one or two sets of edges, using a simple x-axis sweepline algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SingleInteriorIntersectionFinder.html">geos::noding::SingleInteriorIntersectionFinder</a></td><td class="indexvalue">Finds an interior intersection in a set of <a class="el" href="classgeos_1_1noding_1_1SegmentString.html" title="An interface for classes which represent a sequence of contiguous line segments.">SegmentString</a>, if one exists. Only the first intersection found is reported </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1noding_1_1SinglePassNoder.html">geos::noding::SinglePassNoder</a></td><td class="indexvalue"></td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1SIRtree.html">geos::index::strtree::SIRtree</a></td><td class="indexvalue">One-dimensional version of an STR-packed R-tree </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1snap_1_1SnapIfNeededOverlayOp.html">geos::operation::overlay::snap::SnapIfNeededOverlayOp</a></td><td class="indexvalue">Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1overlay_1_1snap_1_1SnapOverlayOp.html">geos::operation::overlay::snap::SnapOverlayOp</a></td><td class="indexvalue">Performs an overlay operation using snapping and enhanced precision to improve the robustness of the result </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1intervalrtree_1_1SortedPackedIntervalRTree.html">geos::index::intervalrtree::SortedPackedIntervalRTree</a></td><td class="indexvalue">A static index on a set of 1-dimensional intervals, using an R-Tree packed based on the order of the interval midpoints </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1SpatialIndex.html">geos::index::SpatialIndex</a></td><td class="indexvalue">Abstract class defines basic insertion and query operations supported by classes implementing spatial index algorithms </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1strtree_1_1STRtree.html">geos::index::strtree::STRtree</a></td><td class="indexvalue">A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatial data </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1planargraph_1_1Subgraph.html">geos::planargraph::Subgraph</a></td><td class="indexvalue">A subgraph of a <a class="el" href="classgeos_1_1planargraph_1_1PlanarGraph.html" title="Represents a directed graph which is embeddable in a planar surface.">PlanarGraph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1buffer_1_1SubgraphDepthLocater.html">geos::operation::buffer::SubgraphDepthLocater</a></td><td class="indexvalue">Locates a subgraph inside a set of subgraphs, in order to determine the outside depth of the subgraph </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1index_1_1sweepline_1_1SweepLineIndex.html">geos::index::sweepline::SweepLineIndex</a></td><td class="indexvalue">A sweepline implements a sorted index on a set of intervals </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1SweeplineNestedRingTester.html">geos::operation::valid::SweeplineNestedRingTester</a></td><td class="indexvalue">Tests whether any of a set of <a class="el" href="">LinearRing</a>s are nested inside another ring in the set, using an <a class="el" href="classgeos_1_1index_1_1sweepline_1_1SweepLineIndex.html" title="A sweepline implements a sorted index on a set of intervals.">index::sweepline::SweepLineIndex</a> to speed up the comparisons </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1TaggedLineSegment.html">geos::simplify::TaggedLineSegment</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1geom_1_1LineSegment.html">geom::LineSegment</a> which is tagged with its location in a <a class="el" href="classgeos_1_1geom_1_1Geometry.html" title="Basic implementation of Geometry, constructed and destructed by GeometryFactory.">geom::Geometry</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1TaggedLinesSimplifier.html">geos::simplify::TaggedLinesSimplifier</a></td><td class="indexvalue">Simplifies a collection of TaggedLineStrings, preserving topology (in the sense that no new intersections are introduced) </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1TaggedLineString.html">geos::simplify::TaggedLineString</a></td><td class="indexvalue">Contains and owns a list of TaggedLineSegments </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1TaggedLineStringSimplifier.html">geos::simplify::TaggedLineStringSimplifier</a></td><td class="indexvalue">Simplifies a <a class="el" href="classgeos_1_1simplify_1_1TaggedLineString.html" title="Contains and owns a list of TaggedLineSegments.">TaggedLineString</a>, preserving topology (in the sense that no new intersections are introduced). Uses the recursive Douglas-Peucker algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1TopologyException.html">geos::util::TopologyException</a></td><td class="indexvalue">Indicates an invalid or inconsistent topological situation encountered during processing </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geomgraph_1_1TopologyLocation.html">geos::geomgraph::TopologyLocation</a></td><td class="indexvalue">A <a class="el" href="classgeos_1_1geomgraph_1_1TopologyLocation.html" title="A TopologyLocation is the labelling of a GraphComponent&#39;s topological relationship to a single Ge...">TopologyLocation</a> is the labelling of a GraphComponent's topological relationship to a single Geometry </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1simplify_1_1TopologyPreservingSimplifier.html">geos::simplify::TopologyPreservingSimplifier</a></td><td class="indexvalue">Simplifies a geometry, ensuring that the result is a valid geometry having the same dimension and number of components as the input </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1operation_1_1valid_1_1TopologyValidationError.html">geos::operation::valid::TopologyValidationError</a></td><td class="indexvalue">Contains information about the nature and location of a <a class="el" href="">Geometry</a> validation error </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1geom_1_1Triangle.html">geos::geom::Triangle</a></td><td class="indexvalue">Represents a planar triangle, and provides methods for calculating various properties of triangles </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1util_1_1UnsupportedOperationException.html">geos::util::UnsupportedOperationException</a></td><td class="indexvalue">Indicates that the requested operation is unsopported </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1io_1_1WKBReader.html">geos::io::WKBReader</a></td><td class="indexvalue">Reads a Geometry from Well-Known Binary format </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1io_1_1WKBWriter.html">geos::io::WKBWriter</a></td><td class="indexvalue">Writes a Geometry into Well-Known Binary format </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1io_1_1WKTReader.html">geos::io::WKTReader</a></td><td class="indexvalue">WKT parser class; see also <a class="el" href="classgeos_1_1io_1_1WKTWriter.html" title="Outputs the textual representation of a Geometry. See also WKTReader.">WKTWriter</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="classgeos_1_1io_1_1WKTWriter.html">geos::io::WKTWriter</a></td><td class="indexvalue">Outputs the textual representation of a Geometry. See also <a class="el" href="classgeos_1_1io_1_1WKTReader.html" title="WKT parser class; see also WKTWriter.">WKTReader</a> </td></tr>
</table>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Thu Jul 22 2010 for GEOS by&nbsp;
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.1 </small></address>
</body>
</html>