• DocumentCode
    883981
  • Title

    Delaunay triangulation in three dimensions

  • Author

    Fang, Tsung-Pao ; Piegl, Les A.

  • Author_Institution
    Univ. of South Florida, USA
  • Volume
    15
  • Issue
    5
  • fYear
    1995
  • fDate
    9/1/1995 12:00:00 AM
  • Firstpage
    62
  • Lastpage
    69
  • Abstract
    Triangulation in two and higher dimensions began with Dirichlet, Voronoi, Thiessen, and Delaunay. A number of textbooks and papers have extensively covered the properties of triangulations and algorithms for their construction. Most dealt with theoretical aspects of the algorithms and gave upper bounds on their complexity. Here we present a new algorithm and its implementation. Instead of providing a theoretical analysis, we present implementation details, and tests and examples. The algorithm is a generalization of our previous method
  • Keywords
    mesh generation; Delaunay triangulation; algorithm; completeness; correctness; implementation details; shelling mechanism; Data structures; Testing; Upper bound;
  • fLanguage
    English
  • Journal_Title
    Computer Graphics and Applications, IEEE
  • Publisher
    ieee
  • ISSN
    0272-1716
  • Type

    jour

  • DOI
    10.1109/38.403829
  • Filename
    403829
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=883981