Package com.treemap.swing.fastvoronoi.convexhull


package com.treemap.swing.fastvoronoi.convexhull
  • Classes
    Class
    Description
    Every vertex and facet in this convex hull algorithm keeps a ConflictList.
    ConvexHull is a 3D polytope which implements the randomized incremental algorithm for constructing a convex hull from a point cloud.
    An edge of a 3D polytope.
    Generic superclass for all 3D face types: vertices, edges, facets, and polytopes.
    A triangular facet of a 3D polytope.
    The Conflict Graph is completely constructed of doubly-linked lists of GraphArcs stored in the facets and vertices of the convex hull.
    A collection of vertices, edges, and facets stored in an object- oriented version of a DCEL (doubly connected edge list).
    A standard 3-dimensional vector
    A point in 3-dimensional space.