Class GraphArc
java.lang.Object
com.treemap.swing.fastvoronoi.convexhull.GraphArc
The Conflict Graph is completely constructed of doubly-linked lists
of GraphArcs stored in the facets and vertices of the convex hull.
Each GraphArc indicates that the given facet and vertex are visible
to each other and therefore in conflict.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoid
delete()
Delete this GraphArc from both doubly-linked lists
-
Field Details
-
facet
-
vertex
-
nextv
-
prevv
-
nextf
-
prevf
-
-
Constructor Details
-
GraphArc
Create a new arc for the conflict graph. This arc won't be connected until add() is called.
-
-
Method Details
-
delete
public void delete()Delete this GraphArc from both doubly-linked lists
-