Uses of Class
org.locationtech.jts.planargraph.Node
Packages that use Node
Package
Description
Classes to perform line merging.
An API for polygonizing sets of lines.
Contains classes to implement a planar graph data structure.
Classes which implement graph algorithms on planar graphs.
-
Uses of Node in org.locationtech.jts.operation.linemerge
Methods in org.locationtech.jts.operation.linemerge that return NodeModifier and TypeMethodDescriptionprivate static NodeLineSequencer.findLowestDegreeNode(Subgraph graph) private NodeLineMergeGraph.getNode(Coordinate coordinate) Methods in org.locationtech.jts.operation.linemerge with parameters of type NodeModifier and TypeMethodDescriptionprivate voidLineMerger.buildEdgeStringsStartingAt(Node node) private static DirectedEdgeLineSequencer.findUnvisitedBestOrientedDE(Node node) Finds anDirectedEdgefor an unvisited edge (if any), choosing the dirEdge which preserves orientation, if possible.Constructors in org.locationtech.jts.operation.linemerge with parameters of type NodeModifierConstructorDescriptionLineMergeDirectedEdge(Node from, Node to, Coordinate directionPt, boolean edgeDirection) Constructs a LineMergeDirectedEdge connecting thefromnode to thetonode. -
Uses of Node in org.locationtech.jts.operation.polygonize
Methods in org.locationtech.jts.operation.polygonize that return NodeMethods in org.locationtech.jts.operation.polygonize with parameters of type NodeModifier and TypeMethodDescriptionprivate static voidPolygonizeGraph.computeNextCCWEdges(Node node, long label) Computes the next edge pointers going CCW around the given node, for the given edgering label.private static voidPolygonizeGraph.computeNextCWEdges(Node node) static voidPolygonizeGraph.deleteAllEdges(Node node) Deletes all edges at a nodeprivate static intprivate static intPolygonizeGraph.getDegreeNonDeleted(Node node) Constructors in org.locationtech.jts.operation.polygonize with parameters of type NodeModifierConstructorDescriptionPolygonizeDirectedEdge(Node from, Node to, Coordinate directionPt, boolean edgeDirection) Constructs a directed edge connecting thefromnode to thetonode. -
Uses of Node in org.locationtech.jts.planargraph
Fields in org.locationtech.jts.planargraph declared as NodeMethods in org.locationtech.jts.planargraph that return NodeModifier and TypeMethodDescriptionAdds a node to the map, replacing any that is already at that location.NodeMap.find(Coordinate coord) Returns the Node at the given location, or null if no Node was there.PlanarGraph.findNode(Coordinate pt) DirectedEdge.getFromNode()Returns the node from which this DirectedEdge leaves.Edge.getOppositeNode(Node node) Ifnodeis one of the two nodes associated with this Edge, returns the other node; otherwise returns null.DirectedEdge.getToNode()Returns the node to which this DirectedEdge goes.NodeMap.remove(Coordinate pt) Removes the Node at the given location, and returns it (or null if no Node was there).Methods in org.locationtech.jts.planargraph with parameters of type NodeModifier and TypeMethodDescriptionAdds a node to the map, replacing any that is already at that location.protected voidAdds a node to the map, replacing any that is already at that location.Edge.getDirEdge(Node fromNode) Returns theDirectedEdgethat starts from the given node, or null if the node is not one of the two nodes associated with this Edge.static CollectionNode.getEdgesBetween(Node node0, Node node1) Returns all Edges that connect the two nodes (which are assumed to be different).Edge.getOppositeNode(Node node) Ifnodeis one of the two nodes associated with this Edge, returns the other node; otherwise returns null.voidRemoves a node from the graph, along with any associated DirectedEdges and Edges.Constructors in org.locationtech.jts.planargraph with parameters of type NodeModifierConstructorDescriptionDirectedEdge(Node from, Node to, Coordinate directionPt, boolean edgeDirection) Constructs a DirectedEdge connecting thefromnode to thetonode. -
Uses of Node in org.locationtech.jts.planargraph.algorithm
Methods in org.locationtech.jts.planargraph.algorithm with parameters of type NodeModifier and TypeMethodDescriptionprivate voidAdds the argument node and all its out edges to the subgraph.private voidConnectedSubgraphFinder.addReachable(Node startNode, Subgraph subgraph) Adds all nodes and edges reachable from this node to the subgraph.private SubgraphConnectedSubgraphFinder.findSubgraph(Node node)