Class ConflictList
java.lang.Object
com.treemap.swing.fastvoronoi.convexhull.ConflictList
Every vertex and facet in this convex hull algorithm keeps a
ConflictList. For a vertex, this list contains all of the facets
that are visible to it. For a facet, the list contains all of the
vertices that can see it. The conflict lists are stored as doubly-
connected lists of GraphArcs and are designed to support constant-
time add and remove operations.
-
Field Summary
Fields -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoid
void
clear()
boolean
empty()
void
Fill a list of facets by recursively walking the doubly-linked facet list.void
Fill a list of facets by recursively walking the doubly-linked facet list.void
getVertices
(List list) Fill a list of verticies by recursively walking the doubly-linked facet list.void
void
-
Field Details
-
head
-
-
Constructor Details
-
ConflictList
public ConflictList(boolean facet)
-
-
Method Details
-
add
-
empty
public boolean empty() -
clear
public void clear() -
getVertices
Fill a list of verticies by recursively walking the doubly-linked facet list. -
getFacets
Fill a list of facets by recursively walking the doubly-linked facet list. -
fill
Fill a list of facets by recursively walking the doubly-linked facet list. -
printFacetList
public void printFacetList() -
printVertexList
public void printVertexList()
-