Package | Description |
---|---|
com.vividsolutions.jts.geomgraph | |
com.vividsolutions.jts.operation.overlay | |
com.vividsolutions.jts.operation.valid |
Modifier and Type | Field and Description |
---|---|
protected DirectedEdge |
EdgeRing.startDe |
Modifier and Type | Method and Description |
---|---|
DirectedEdge |
DirectedEdge.getNext() |
abstract DirectedEdge |
EdgeRing.getNext(DirectedEdge de) |
DirectedEdge |
DirectedEdge.getNextMin() |
DirectedEdge |
DirectedEdgeStar.getRightmostEdge() |
DirectedEdge |
DirectedEdge.getSym()
Each Edge gives rise to a pair of symmetric DirectedEdges, in opposite
directions.
|
Modifier and Type | Method and Description |
---|---|
void |
DirectedEdgeStar.computeDepths(DirectedEdge de) |
protected void |
EdgeRing.computePoints(DirectedEdge start)
Collect all the points from the DirectedEdges of this ring into a contiguous list
|
abstract DirectedEdge |
EdgeRing.getNext(DirectedEdge de) |
abstract void |
EdgeRing.setEdgeRing(DirectedEdge de,
EdgeRing er) |
void |
DirectedEdge.setNext(DirectedEdge next) |
void |
DirectedEdge.setNextMin(DirectedEdge nextMin) |
void |
DirectedEdge.setSym(DirectedEdge de) |
Constructor and Description |
---|
EdgeRing(DirectedEdge start,
GeometryFactory geometryFactory) |
Modifier and Type | Method and Description |
---|---|
DirectedEdge |
MaximalEdgeRing.getNext(DirectedEdge de) |
DirectedEdge |
MinimalEdgeRing.getNext(DirectedEdge de) |
Modifier and Type | Method and Description |
---|---|
DirectedEdge |
MaximalEdgeRing.getNext(DirectedEdge de) |
DirectedEdge |
MinimalEdgeRing.getNext(DirectedEdge de) |
void |
MaximalEdgeRing.setEdgeRing(DirectedEdge de,
EdgeRing er) |
void |
MinimalEdgeRing.setEdgeRing(DirectedEdge de,
EdgeRing er) |
Constructor and Description |
---|
MaximalEdgeRing(DirectedEdge start,
GeometryFactory geometryFactory) |
MinimalEdgeRing(DirectedEdge start,
GeometryFactory geometryFactory) |
Modifier and Type | Method and Description |
---|---|
protected void |
ConnectedInteriorTester.visitLinkedDirectedEdges(DirectedEdge start) |
Copyright © 2016. All rights reserved.