An algorithm of generating unstructured tetrahedron from 3D discrete points

Juan Hua Kong, Jiang Bin Zheng

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Delaunay tetrahedron generation is one of the important techniques to construct surface mesh using 3D discrete points. Because there is a common seen case of the inconsistent tetrahedrons in the Delaunay triangulation algorithm based on local constructing with the recursion principle of triangular meshes. To solve the problem, this paper presents a novel delaunay tetrahedralization scheme which considered both tetrahedrons constructed during the local computation of current point and those constructed before the local computation as constraint information in the procedure of constructing a new delaunay tetrahedron. Therefore, the consistent compatibility of delaunay tetaherdralization has been improved. At the end of this paper, several experiments are given to show that the proposed algorithm is more efficient.

Original languageEnglish
Title of host publicationProceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
Pages2770-2774
Number of pages5
DOIs
StatePublished - 2008
Event7th International Conference on Machine Learning and Cybernetics, ICMLC - Kunming, China
Duration: 12 Jul 200815 Jul 2008

Publication series

NameProceedings of the 7th International Conference on Machine Learning and Cybernetics, ICMLC
Volume5

Conference

Conference7th International Conference on Machine Learning and Cybernetics, ICMLC
Country/TerritoryChina
CityKunming
Period12/07/0815/07/08

Keywords

  • Delaunay tetrahedron
  • Inconsistent tetrahedrons
  • Triangular meshes

Fingerprint

Dive into the research topics of 'An algorithm of generating unstructured tetrahedron from 3D discrete points'. Together they form a unique fingerprint.

Cite this