|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectcom.vividsolutions.jts.geomgraph.EdgeEndStar
com.vividsolutions.jts.geomgraph.DirectedEdgeStar
public class DirectedEdgeStar
A DirectedEdgeStar is an ordered list of outgoing DirectedEdges around a node. It supports labelling the edges as well as linking the edges to form both MaximalEdgeRings and MinimalEdgeRings.
Field Summary |
---|
Fields inherited from class com.vividsolutions.jts.geomgraph.EdgeEndStar |
---|
edgeList, edgeMap |
Constructor Summary | |
---|---|
DirectedEdgeStar()
|
Method Summary | |
---|---|
void |
computeDepths(DirectedEdge de)
|
void |
computeLabelling(GeometryGraph[] geom)
Compute the labelling for all dirEdges in this star, as well as the overall labelling |
void |
findCoveredLineEdges()
Traverse the star of edges, maintaing the current location in the result area at this node (if any). |
Label |
getLabel()
|
int |
getOutgoingDegree()
|
int |
getOutgoingDegree(EdgeRing er)
|
DirectedEdge |
getRightmostEdge()
|
void |
insert(EdgeEnd ee)
Insert a directed edge in the list |
void |
linkAllDirectedEdges()
|
void |
linkMinimalDirectedEdges(EdgeRing er)
|
void |
linkResultDirectedEdges()
Traverse the star of DirectedEdges, linking the included edges together. |
void |
mergeSymLabels()
For each dirEdge in the star, merge the label from the sym dirEdge into the label |
void |
print(java.io.PrintStream out)
|
void |
updateLabelling(Label nodeLabel)
Update incomplete dirEdge labels from the labelling for the node |
Methods inherited from class com.vividsolutions.jts.geomgraph.EdgeEndStar |
---|
findIndex, getCoordinate, getDegree, getEdges, getNextCW, insertEdgeEnd, isAreaLabelsConsistent, iterator |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public DirectedEdgeStar()
Method Detail |
---|
public void insert(EdgeEnd ee)
insert
in class EdgeEndStar
public Label getLabel()
public int getOutgoingDegree()
public int getOutgoingDegree(EdgeRing er)
public DirectedEdge getRightmostEdge()
public void computeLabelling(GeometryGraph[] geom)
computeLabelling
in class EdgeEndStar
public void mergeSymLabels()
public void updateLabelling(Label nodeLabel)
public void linkResultDirectedEdges()
DirEdges are only linked if:
Edges are linked in CCW order (the order they are stored). This means that rings have their face on the Right (in other words, the topological location of the face is given by the RHS label of the DirectedEdge)
PRECONDITION: No pair of dirEdges are both marked as being in the result
public void linkMinimalDirectedEdges(EdgeRing er)
public void linkAllDirectedEdges()
public void findCoveredLineEdges()
public void computeDepths(DirectedEdge de)
public void print(java.io.PrintStream out)
print
in class EdgeEndStar
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |