com.vividsolutions.jts.operation.buffer
public class BufferSubgraph extends java.lang.Object implements java.lang.Comparable
DirectedEdge
s and Node
s.
Its edges will generate either
Constructor and Description |
---|
BufferSubgraph() |
Modifier and Type | Method and Description |
---|---|
int |
compareTo(java.lang.Object o)
BufferSubgraphs are compared on the x-value of their rightmost Coordinate.
|
void |
computeDepth(int outsideDepth) |
void |
create(Node node)
Creates the subgraph consisting of all edges reachable from this node.
|
void |
findResultEdges()
Find all edges whose depths indicates that they are in the result area(s).
|
java.util.List |
getDirectedEdges() |
Envelope |
getEnvelope()
Computes the envelope of the edges in the subgraph.
|
java.util.List |
getNodes() |
Coordinate |
getRightmostCoordinate()
Gets the rightmost coordinate in the edges of the subgraph
|
public java.util.List getDirectedEdges()
public java.util.List getNodes()
public Envelope getEnvelope()
public Coordinate getRightmostCoordinate()
public void create(Node node)
node
- a node to start the graph traversal frompublic void computeDepth(int outsideDepth)
public void findResultEdges()
public int compareTo(java.lang.Object o)
g1 >= g2 <==> Ring(g2) does not contain Ring(g1)
where Polygon(g) is the buffer polygon that is built from g.
This relationship is used to sort the BufferSubgraphs so that shells are guaranteed to be built before holes.
compareTo
in interface java.lang.Comparable