Package | Description |
---|---|
com.vividsolutions.jts.geomgraph | |
com.vividsolutions.jts.geomgraph.index | |
com.vividsolutions.jts.operation.overlay | |
com.vividsolutions.jts.operation.relate |
Modifier and Type | Field and Description |
---|---|
protected Edge |
EdgeEnd.edge |
Modifier and Type | Method and Description |
---|---|
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 |
DirectedEdge.getEdge() |
Edge |
EdgeEnd.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 | Method and 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 and Description |
---|
MonotoneChainEdge(Edge e) |
SweepLineSegment(Edge edge,
int ptIndex) |
Modifier and Type | Method and Description |
---|---|
protected void |
OverlayOp.insertUniqueEdge(Edge e)
Insert an edge from one of the noded input graphs.
|
Modifier and Type | Method and Description |
---|---|
void |
EdgeEndBuilder.computeEdgeEnds(Edge edge,
List l)
Creates stub edges for all the intersections in this
Edge (if any) and inserts them into the graph.
|
Copyright © 2016. All rights reserved.