• DocumentCode
    3061558
  • Title

    The Merge Phase of Parallel Divide-and-Conquer Scheme for 3D Delaunay Triangulation

  • Author

    Chen, Min-Bin

  • Author_Institution
    Dept. of Comput. Sci. & Inf., China Univ. of Technol., Taipei, Taiwan
  • fYear
    2010
  • fDate
    6-9 Sept. 2010
  • Firstpage
    224
  • Lastpage
    230
  • Abstract
    In parallel generation of 3D Delaunay triangulation, the merge phase is the main part that affects the parallel efficiency. In this work, the geometric properties of the merging triangulation between two Delaunay triangulations were identified. Several Delaunay triangulations of random point sets were used to generate merging triangulation two by two. From the experimental results, the generated interface triangulation are all point free which satisfy the criterion of Delaunay triangulation.
  • Keywords
    computational geometry; divide and conquer methods; merging; mesh generation; parallel algorithms; 3D Delaunay triangulation; geometric properties; merge phase; parallel divide-and-conquer scheme; parallel generation; Arrays; Clustering algorithms; Complexity theory; Merging; Mesh generation; Three dimensional displays; Delaunay triangulation; tetrahedralization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing with Applications (ISPA), 2010 International Symposium on
  • Conference_Location
    Taipei
  • Print_ISBN
    978-1-4244-8095-1
  • Electronic_ISBN
    978-0-7695-4190-7
  • Type

    conf

  • DOI
    10.1109/ISPA.2010.71
  • Filename
    5634334