• Title of article

    Computing the three-dimensional convex hull Original Research Article

  • Author/Authors

    D.C.S. Allison، نويسنده , , M.T. Noga، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 1997
  • Pages
    9
  • From page
    74
  • To page
    82
  • Abstract
    The program tetra computes the three-dimensional convex hull of a set of n points in (x, y, z) space. The input consists of the coordinates of the points and the output is the identification numbers of the points that are on the convex hull. Since the convex hull is constructed as a set of triangular faces, called facets, additional output information can be requested about these interlocking facets. This additional information may be used to reconstruct and verify the correctness of the computed hull.
  • Keywords
    Binary trees , Convex hull , Facet , polytope
  • Journal title
    Computer Physics Communications
  • Serial Year
    1997
  • Journal title
    Computer Physics Communications
  • Record number

    1134388