geomgraph

package geomgraph

Ordering

Alphabetic

Visibility

Public
Protected

Package Members

package index

Type Members

class Depth extends AnyRef
class DirectedEdge extends EdgeEnd
class DirectedEdgeStar extends EdgeEndStar
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node.
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node. It supports labelling the edges as well as linking the edges to form both MaximalEdgeRings and MinimalEdgeRings.
Version
1.7
class Edge extends GraphComponent
class EdgeEnd extends Comparable[EdgeEnd]
Models the end of an edge incident on a node.
Models the end of an edge incident on a node. EdgeEnds have a direction determined by the direction of the ray from the initial point to the next point. EdgeEnds are comparable under the ordering "a has a greater angle with the x-axis than b". This ordering is used to sort EdgeEnds around a node.
Version
1.7
abstract class EdgeEndStar extends AnyRef
A EdgeEndStar is an ordered list of EdgeEnds around a node.
A EdgeEndStar is an ordered list of EdgeEnds around a node. They are maintained in CCW order (starting with the positive x-axis) around the node for efficient lookup and topology building.
Version
1.7
class EdgeIntersection extends Comparable[EdgeIntersection]
Represents a point on an edge which intersects with another edge.
Represents a point on an edge which intersects with another edge.
The intersection may either be a single point, or a line segment (in which case this point is the start of the line segment) The intersection point must be precise.
Version
1.7
class EdgeIntersectionList extends AnyRef
A list of edge intersections along an {link Edge}.
A list of edge intersections along an {link Edge}. Implements splitting an edge with intersections into multiple resultant edges.
Version
1.7
class EdgeList extends AnyRef
A EdgeList is a list of Edges.
A EdgeList is a list of Edges. It supports locating edges that are pointwise equals to a target edge.
Version
1.7
class EdgeNodingValidator extends AnyRef
abstract class EdgeRing extends AnyRef
Version
1.7
class GeometryGraph extends PlanarGraph
abstract class GraphComponent extends AnyRef
A GraphComponent is the parent class for the objects' that form a graph.
A GraphComponent is the parent class for the objects' that form a graph. Each GraphComponent can carry a Label.
Version
1.7
class Label extends AnyRef
class Node extends GraphComponent
Version
1.7
class NodeFactory extends AnyRef
Version
1.7
class NodeMap extends AnyRef
A map of nodes, indexed by the coordinate of the node
A map of nodes, indexed by the coordinate of the node
Version
1.7
class PlanarGraph extends AnyRef
class TopologyLocation extends AnyRef
A TopologyLocation is the labelling of a GraphComponent's topological relationship to a single Geometry.
A TopologyLocation is the labelling of a GraphComponent's topological relationship to a single Geometry.
If the parent component is an area edge, each side and the edge itself have a topological location. These locations are named
- ON: on the edge
- LEFT: left-hand side of the edge
- RIGHT: right-hand side
If the parent component is a line edge or node, there is a single topological relationship attribute, ON.
The possible values of a topological location are {Location.NONE, Location.EXTERIOR, Location.BOUNDARY, Location.INTERIOR}
The labelling is stored in an array location[j] where where j has the values ON, LEFT, RIGHT
Version
1.7

Value Members

object Depth
A Depth object records the topological depth of the sides of an Edge for up to two Geometries.
A Depth object records the topological depth of the sides of an Edge for up to two Geometries.
Version
1.7
object DirectedEdge
Version
1.7
object Edge
Version
1.7
object EdgeNodingValidator
Validates that a collection of {link Edge}s is correctly noded.
Validates that a collection of {link Edge}s is correctly noded. Throws an appropriate exception if an noding error is found. Uses {link FastNodingValidator} to perform the validation.
Version
1.7
See also
FastNodingValidator
object GeometryGraph
A GeometryGraph is a graph that models a given Geometry
A GeometryGraph is a graph that models a given Geometry
Version
1.7
object Label
A Label indicates the topological relationship of a component of a topology graph to a given Geometry.
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 Geometrys, which is sufficient for algorithms for binary operations. <P> Topology graphs support the concept of labeling nodes and edges in the graph. The label of a node or edge specifies its topological relationship to one or more geometries. (In fact, since JTS operations have only two arguments labels are required for only two geometries). A label for a node or edge has one or two elements, depending on whether the node or edge occurs in one or both of the input Geometrys. Elements contain attributes which categorize the topological location of the node or edge relative to the parent Geometry; that is, whether the node or edge is in the interior, boundary or exterior of the Geometry. Attributes have a value from the set {Interior, Boundary, Exterior}. In a node each element has a single attribute <On>. For an edge each element has a triplet of attributes <Left, On, Right>. <P> It is up to the client code to associate the 0 and 1 TopologyLocations with specific geometries.
Version
1.7
object PlanarGraph
The computation of the IntersectionMatrix relies on the use of a structure called a "topology graph".
The computation of the IntersectionMatrix relies on the use of a structure called a "topology graph". The topology graph contains nodes and edges corresponding to the nodes and line segments of a Geometry. Each node and edge in the graph is labeled with its topological location relative to the source geometry. <P> Note that there is no requirement that points of self-intersection be a vertex. Thus to obtain a correct topology graph, Geometrys must be self-noded before constructing their graphs. <P> Two fundamental operations are supported by topology graphs: <UL> <LI>Computing the intersections between all the edges and nodes of a single graph <LI>Computing the intersections between the edges and nodes of two different graphs </UL>
Version
1.7
object Position
A Position indicates the position of a Location relative to a graph component (Node, Edge, or Area).
A Position indicates the position of a Location relative to a graph component (Node, Edge, or Area).
Version
1.7
object Quadrant
Utility functions for working with quadrants, which are numbered as follows:
```
1 | 0
--+--
2 | 3
```
Utility functions for working with quadrants, which are numbered as follows:
```
1 | 0
--+--
2 | 3
```
Version
1.7

Packages

geomgraph

package geomgraph

Package Members

Type Members

Value Members

Ungrouped

Packages

geomgraph

package geomgraph

Package Members

Type Members

Value Members

Ungrouped

geomgraph