Package com.macrofocus.treemap.fastvoronoi.convexhull

Class ConflictList

  • public class ConflictList
extends java.lang.Object
    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 
      Modifier and Type Field Description
      protected GraphArc head  

    • Constructor Summary

      Constructors 
      Constructor Description
      ConflictList​(boolean facet)  

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      void add​(GraphArc arc)  
      void clear()  
      boolean empty()  
      void fill​(java.util.List list)
      Fill a list of facets by recursively walking the doubly-linked facet list.
      void getFacets​(java.util.List list)
      Fill a list of facets by recursively walking the doubly-linked facet list.
      void getVertices​(java.util.List list)
      Fill a list of verticies by recursively walking the doubly-linked facet list.
      void printFacetList()  
      void printVertexList()  

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

    • Constructor Detail

      • ConflictList

        public ConflictList​(boolean facet)

    • Method Detail

      • add

        public void add​(GraphArc arc)

      • empty

        public boolean empty()

      • clear

        public void clear()

      • getVertices

        public void getVertices​(java.util.List list)
        Fill a list of verticies by recursively walking the doubly-linked facet list.

      • getFacets

        public void getFacets​(java.util.List list)
        Fill a list of facets by recursively walking the doubly-linked facet list.

      • fill

        public void fill​(java.util.List list)
        Fill a list of facets by recursively walking the doubly-linked facet list.

      • printFacetList

        public void printFacetList()

      • printVertexList

        public void printVertexList()