Main Page | Namespace List | Class Hierarchy | Class List | File List | Namespace Members | Class Members | Related Pages

geos::operation::overlay Namespace Reference

Contains classes that perform a topological overlay to compute boolean spatial functions. More...


Classes

class  geos::operation::overlay::EdgeSetNoder
 Nodes a set of edges. More...
class  geos::operation::overlay::LineBuilder
 Forms JTS LineStrings out of a the graph of geomgraph::DirectedEdge created by an OverlayOp. More...
class  geos::operation::overlay::MaximalEdgeRing
 A ring of edges which may contain nodes of degree > 2. More...
class  geos::operation::overlay::MinimalEdgeRing
 A ring of Edges with the property that no node has degree greater than 2. More...
class  geos::operation::overlay::OverlayNodeFactory
 Creates nodes for use in the geomgraph::PlanarGraph constructed during overlay operations. NOTE: also used by operation::valid. More...
class  geos::operation::overlay::OverlayOp
 Computes the overlay of two Geometry. More...
struct  geos::operation::overlay::overlayOp
 OverlayOp::overlayOp Adapter for use with geom::BinaryOp. More...
class  geos::operation::overlay::PointBuilder
 Constructs geom::Point s from the nodes of an overlay graph. More...
class  geos::operation::overlay::PolygonBuilder
 Forms Polygon out of a graph of geomgraph::DirectedEdge. More...


Detailed Description

Contains classes that perform a topological overlay to compute boolean spatial functions.

The Overlay Algorithm is used in spatial analysis methods for computing set-theoretic operations (boolean combinations) of input Geometrys. The algorithm for computing the overlay uses the intersection operations supported by topology graphs. To compute an overlay it is necessary to explicitly compute the resultant graph formed by the computed intersections.

The algorithm to compute a set-theoretic spatial analysis method has the following steps:

Package Specification


Generated on Tue Jun 5 11:39:13 2012 for GEOS by  doxygen 1.3.9.1