• DOI:10.1007/BF02274210
Corpus ID: 41810825

Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation

@article{Baker2005AutomaticMG,
  title={Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation},
  author={T. Baker},
  journal={Engineering with Computers},
  year={2005},
  volume={5},
  pages={161-175}
}

T. Baker

Published 2005

Mathematics

Engineering with Computers

This paper describes a method for generating tetrahedral meshes. The algorithm, based on the Delaunay triangulation, can treat objects of essentially arbitrary complexity. In order to preserve the surface triangulation of solid objects, it is necessary to override the Delaunay property and redefine the triangulation when points are introduced that are close to solid boundaries. Details of this constrained Delaunay algorithm are presented and an efficient implementation of the triangulation… CONTINUE READING

View on Springer

Save to Library

Create Alert

Cite

Launch Research Feed