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.buffer |
Provides classes for computing buffers of geometries
|
org.locationtech.jts.operation.overlay |
Contains classes that perform a topological overlay to compute boolean spatial functions.
|
org.locationtech.jts.operation.relate |
Contains classes to implement the computation of the spatial relationships of
Geometry s. |
Modifier and Type | Field and Description |
---|---|
(package private) Edge |
EdgeIntersectionList.edge |
protected Edge |
EdgeEnd.edge |
Modifier and Type | Method and Description |
---|---|
(package private) Edge |
EdgeIntersectionList.createSplitEdge(EdgeIntersection ei0,
EdgeIntersection ei1)
Create a new "split edge" with the section of points between
(and including) the two intersections.
|
Edge |
PlanarGraph.findEdge(Coordinate p0,
Coordinate p1)
Returns the edge whose first two coordinates are p0 and p1
|
Edge |
GeometryGraph.findEdge(LineString line) |
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 |
EdgeEnd.getEdge() |
Edge |
DirectedEdge.getEdge() |
Modifier and Type | Method and 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.
|
protected void |
EdgeRing.addPoints(Edge edge,
boolean isForward,
boolean isFirstEdge) |
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.
|
protected void |
PlanarGraph.insertEdge(Edge e) |
boolean |
Edge.isPointwiseEqual(Edge e) |
Constructor and Description |
---|
DirectedEdge(Edge edge,
boolean isForward) |
EdgeEnd(Edge edge) |
EdgeEnd(Edge edge,
Coordinate p0,
Coordinate p1) |
EdgeEnd(Edge edge,
Coordinate p0,
Coordinate p1,
Label label) |
EdgeIntersectionList(Edge edge) |
Modifier and Type | Field and Description |
---|---|
(package private) Edge |
MonotoneChainEdge.e |
(package private) Edge |
SweepLineSegment.edge |
Modifier and Type | Method and Description |
---|---|
private void |
SimpleSweepLineIntersector.add(Edge edge,
java.lang.Object edgeSet) |
private void |
SimpleMCSweepLineIntersector.addEdge(Edge edge,
java.lang.Object edgeSet) |
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.
|
private void |
SimpleEdgeSetIntersector.computeIntersects(Edge e0,
Edge e1,
SegmentIntersector si)
Performs a brute-force comparison of every segment in each Edge.
|
private boolean |
SegmentIntersector.isTrivialIntersection(Edge e0,
int segIndex0,
Edge e1,
int segIndex1)
A trivial intersection is an apparent self-intersection which in fact
is simply the point shared by adjacent line segments.
|
Constructor and Description |
---|
MonotoneChainEdge(Edge e) |
SweepLineSegment(Edge edge,
int ptIndex) |
Modifier and Type | Method and Description |
---|---|
protected void |
BufferBuilder.insertUniqueEdge(Edge e)
Inserted edges are checked to see if an identical edge already exists.
|
Modifier and Type | Method and Description |
---|---|
protected void |
OverlayOp.insertUniqueEdge(Edge e)
Insert an edge from one of the noded input graphs.
|
private void |
LineBuilder.labelIsolatedLine(Edge e,
int targetIndex)
Label an isolated node with its relationship to the target geometry.
|
Modifier and Type | Method and 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.
|
(package private) void |
EdgeEndBuilder.createEdgeEndForNext(Edge edge,
java.util.List l,
EdgeIntersection eiCurr,
EdgeIntersection eiNext)
Create a StubEdge for the edge after the intersection eiCurr.
|
(package private) void |
EdgeEndBuilder.createEdgeEndForPrev(Edge edge,
java.util.List l,
EdgeIntersection eiCurr,
EdgeIntersection eiPrev)
Create a EdgeStub for the edge before the intersection eiCurr.
|
private void |
RelateComputer.labelIsolatedEdge(Edge e,
int targetIndex,
Geometry target)
Label an isolated edge of a graph with its relationship to the target geometry.
|