GEOS
3.8.0dev

Contains classes that implement topology graphs. More...
Classes  
class  DirectedEdge 
A directed EdgeEnd. More...  
class  DirectedEdgeStar 
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node. More...  
class  Edge 
class  EdgeEnd 
Models the end of an edge incident on a node. More...  
class  EdgeEndStar 
A EdgeEndStar is an ordered list of EdgeEnds around a node. More...  
class  EdgeIntersection 
class  EdgeIntersectionList 
class  EdgeList 
class  EdgeNodingValidator 
Validates that a collection of SegmentStrings is correctly noded. More...  
class  EdgeRing 
class  GeometryGraph 
A GeometryGraph is a graph that models a given Geometry. More...  
class  GraphComponent 
A GraphComponent is the parent class for the objects' that form a graph. More...  
class  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. More...  
class  Node 
class  PlanarGraph 
Represents a directed graph which is embeddable in a planar surface. More...  
class  Position 
A Position indicates the position of a Location relative to a graph component (Node, Edge, or Area). More...  
class  Quadrant 
class  TopologyLocation 
A TopologyLocation is the labelling of a GraphComponent's topological relationship to a single Geometry. More...  
Functions  
bool  operator== (const Edge &a, const Edge &b) 
std::ostream &  operator<< (std::ostream &os, const Edge &el) 
std::ostream &  operator<< (std::ostream &, const EdgeEnd &) 
std::ostream &  operator<< (std::ostream &, const EdgeEndStar &) 
bool  operator< (const EdgeIntersection &ei1, const EdgeIntersection &ei2) 
Strict weak ordering operator for EdgeIntersection. More...  
std::ostream &  operator<< (std::ostream &os, const EdgeIntersection &e) 
Output operator.  
std::ostream &  operator<< (std::ostream &, const EdgeIntersectionList &) 
std::ostream &  operator<< (std::ostream &os, const EdgeList &el) 
std::ostream &  operator<< (std::ostream &os, const EdgeRing &er) 
std::ostream &  operator<< (std::ostream &, const Label &) 
std::ostream &  operator<< (std::ostream &os, const Node &node) 
std::ostream &  operator<< (std::ostream &, const TopologyLocation &) 
Contains classes that implement topology graphs.
The Java Topology Suite (JTS) is a Java API that implements a core set of spatial data operations using an explicit precision model and robust geometric algorithms. JTS is int ended to be used in the development of applications that support the validation, cleaning, integration and querying of spatial datasets.
JTS attempts to implement the OpenGIS Simple Features Specification (SFS) as accurately as possible. In some cases the SFS is unclear or omits a specification; in this case JTS attempts to choose a reasonable and consistent alternative. Differences from and elaborations of the SFS are documented in this specification.

inline 
Strict weak ordering operator for EdgeIntersection.
This is the C++ equivalent of JTS's compareTo