Package | Description |
---|---|
org.locationtech.jts.geomgraph |
Contains classes that implement topology graphs.
|
org.locationtech.jts.geomgraph.index |
Contains classes that implement indexes for performing noding on geometry graph edges.
|
org.locationtech.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometry s. |
Modifier and Type | Method | Description |
---|---|---|
Edge |
GeometryGraph.findEdge(LineString line) |
|
Edge |
PlanarGraph.findEdge(Coordinate p0,
Coordinate p1) |
Returns the edge whose first two coordinates are p0 and p1
|
Edge |
PlanarGraph.findEdgeInSameDirection(Coordinate p0,
Coordinate p1) |
Returns the edge which starts at p0 and whose first segment is
parallel to p1
|
Edge |
EdgeList.findEqualEdge(Edge e) |
If there is an edge equal to e already in the list, return it.
|
Edge |
EdgeList.get(int i) |
|
Edge |
Edge.getCollapsedEdge() |
|
Edge |
DirectedEdge.getEdge() |
|
Edge |
EdgeEnd.getEdge() |
Modifier and Type | Method | Description |
---|---|---|
void |
EdgeList.add(Edge e) |
Insert an edge unless it is already in the list
|
void |
GeometryGraph.addEdge(Edge e) |
Add an Edge computed externally.
|
EdgeEnd |
PlanarGraph.findEdgeEnd(Edge e) |
Returns the EdgeEnd which has edge e as its base edge
(MD 18 Feb 2002 - this should return a pair of edges)
|
int |
EdgeList.findEdgeIndex(Edge e) |
If the edge e is already in the list, return its index.
|
Edge |
EdgeList.findEqualEdge(Edge e) |
If there is an edge equal to e already in the list, return it.
|
boolean |
Edge.isPointwiseEqual(Edge e) |
Constructor | Description |
---|---|
DirectedEdge(Edge edge,
boolean isForward) |
|
EdgeEnd(Edge edge,
Coordinate p0,
Coordinate p1) |
|
EdgeEnd(Edge edge,
Coordinate p0,
Coordinate p1,
Label label) |
|
EdgeIntersectionList(Edge edge) |
Modifier and Type | Method | Description |
---|---|---|
void |
SegmentIntersector.addIntersections(Edge e0,
int segIndex0,
Edge e1,
int segIndex1) |
This method is called by clients of the EdgeIntersector class to test for and add
intersections for two segments of the edges being intersected.
|
Constructor | Description |
---|---|
MonotoneChainEdge(Edge e) |
|
SweepLineSegment(Edge edge,
int ptIndex) |
Modifier and Type | Method | Description |
---|---|---|
void |
EdgeEndBuilder.computeEdgeEnds(Edge edge,
java.util.List l) |
Creates stub edges for all the intersections in this
Edge (if any) and inserts them into the graph.
|
Copyright © 2018. All rights reserved.