Package | Description |
---|---|
org.locationtech.jts.operation.linemerge |
Classes to perform line merging.
|
org.locationtech.jts.operation.polygonize |
An API for polygonizing sets of lines.
|
org.locationtech.jts.planargraph |
Contains classes to implement a planar graph data structure.
|
org.locationtech.jts.planargraph.algorithm |
Classes which implement graph algorithms on planar graphs.
|
Modifier and Type | Method and Description |
---|---|
private static Node |
LineSequencer.findLowestDegreeNode(Subgraph graph) |
private Node |
LineMergeGraph.getNode(Coordinate coordinate) |
Modifier and Type | Method and Description |
---|---|
private void |
LineMerger.buildEdgeStringsStartingAt(Node node) |
private static DirectedEdge |
LineSequencer.findUnvisitedBestOrientedDE(Node node)
Finds an
DirectedEdge for an unvisited edge (if any),
choosing the dirEdge which preserves orientation, if possible. |
Constructor and Description |
---|
LineMergeDirectedEdge(Node from,
Node to,
Coordinate directionPt,
boolean edgeDirection)
Constructs a LineMergeDirectedEdge connecting the
from node to the
to node. |
Modifier and Type | Method and Description |
---|---|
private Node |
PolygonizeGraph.getNode(Coordinate pt) |
Modifier and Type | Method and Description |
---|---|
private static void |
PolygonizeGraph.computeNextCCWEdges(Node node,
long label)
Computes the next edge pointers going CCW around the given node, for the
given edgering label.
|
private static void |
PolygonizeGraph.computeNextCWEdges(Node node) |
static void |
PolygonizeGraph.deleteAllEdges(Node node)
Deletes all edges at a node
|
private static int |
PolygonizeGraph.getDegree(Node node,
long label) |
private static int |
PolygonizeGraph.getDegreeNonDeleted(Node node) |
Constructor and Description |
---|
PolygonizeDirectedEdge(Node from,
Node to,
Coordinate directionPt,
boolean edgeDirection)
Constructs a directed edge connecting the
from node to the
to node. |
Modifier and Type | Field and Description |
---|---|
protected Node |
DirectedEdge.from |
protected Node |
DirectedEdge.to |
Modifier and Type | Method and Description |
---|---|
Node |
NodeMap.add(Node n)
Adds a node to the map, replacing any that is already at that location.
|
Node |
NodeMap.find(Coordinate coord)
Returns the Node at the given location, or null if no Node was there.
|
Node |
PlanarGraph.findNode(Coordinate pt)
|
Node |
DirectedEdge.getFromNode()
Returns the node from which this DirectedEdge leaves.
|
Node |
Edge.getOppositeNode(Node node)
If
node is one of the two nodes associated with this Edge,
returns the other node; otherwise returns null. |
Node |
DirectedEdge.getToNode()
Returns the node to which this DirectedEdge goes.
|
Node |
NodeMap.remove(Coordinate pt)
Removes the Node at the given location, and returns it (or null if no Node was there).
|
Modifier and Type | Method and Description |
---|---|
protected void |
PlanarGraph.add(Node node)
Adds a node to the map, replacing any that is already at that location.
|
Node |
NodeMap.add(Node n)
Adds a node to the map, replacing any that is already at that location.
|
DirectedEdge |
Edge.getDirEdge(Node fromNode)
Returns the
DirectedEdge that starts from the given node, or null if the
node is not one of the two nodes associated with this Edge. |
static java.util.Collection |
Node.getEdgesBetween(Node node0,
Node node1)
Returns all Edges that connect the two nodes (which are assumed to be different).
|
Node |
Edge.getOppositeNode(Node node)
If
node is one of the two nodes associated with this Edge,
returns the other node; otherwise returns null. |
void |
PlanarGraph.remove(Node node)
Removes a node from the graph, along with any associated DirectedEdges and
Edges.
|
Constructor and Description |
---|
DirectedEdge(Node from,
Node to,
Coordinate directionPt,
boolean edgeDirection)
Constructs a DirectedEdge connecting the
from node to the
to node. |
Modifier and Type | Method and Description |
---|---|
private void |
ConnectedSubgraphFinder.addEdges(Node node,
java.util.Stack nodeStack,
Subgraph subgraph)
Adds the argument node and all its out edges to the subgraph.
|
private void |
ConnectedSubgraphFinder.addReachable(Node startNode,
Subgraph subgraph)
Adds all nodes and edges reachable from this node to the subgraph.
|
private Subgraph |
ConnectedSubgraphFinder.findSubgraph(Node node) |