BufferSubgraph class

A connected subset of the graph of {@link DirectedEdge}s and {@link Node}s. Its edges will generate either

  • a single polygon in the complete buffer, with zero or more holes, or
  • one or more connected holes

@version 1.7

Implemented types

Constructors

BufferSubgraph()

Properties

dirEdgeList List
getter/setter pair
env Envelope?
getter/setter pair
finder RightmostEdgeFinder
getter/setter pair
hashCode int
The hash code for this object.
no setterinherited
nodes List
getter/setter pair
rightMostCoord Coordinate?
getter/setter pair
runtimeType Type
A representation of the runtime type of the object.
no setterinherited

Methods

add(Node node, Queue nodeStack) → void
Adds the argument node and all its out edges to the subgraph @param node the node to add @param nodeStack the current set of nodes being traversed
addReachable(Node startNode) → void
Adds all nodes and edges reachable from this node to the subgraph. Uses an explicit stack to avoid a large depth of recursion.
clearVisitedEdges() → void
compareTo(dynamic o) int
BufferSubgraphs are compared on the x-value of their rightmost Coordinate. This defines a partial ordering on the graphs such that:
override
computeDepth(int outsideDepth) → void
computeDepths(DirectedEdge startEdge) → void
Compute depths for all dirEdges via breadth-first traversal of nodes in graph @param startEdge edge to start processing with
computeNodeDepth(Node n) → void
copySymDepths(DirectedEdge de) → void
create(Node node) → void
Creates the subgraph consisting of all edges reachable from this node. Finds the edges in the graph and the rightmost coordinate.
findResultEdges() → void
Find all edges whose depths indicates that they are in the result area(s). Since we want polygon shells to be oriented CW, choose dirEdges with the interior of the result on the RHS. Mark them as being in the result. Interior Area edges are the result of dimensional collapses. They do not form part of the result area boundary.
getDirectedEdges() List
getEnvelope() Envelope
Computes the envelope of the edges in the subgraph. The envelope is cached after being computed.
getNodes() List
getRightmostCoordinate() Coordinate?
Gets the rightmost coordinate in the edges of the subgraph
noSuchMethod(Invocation invocation) → dynamic
Invoked when a nonexistent method or property is accessed.
inherited
toString() String
A string representation of this object.
inherited

Operators

operator ==(Object other) bool
The equality operator.
inherited