Computational complexity of the advancing front triangulation

  • Petr Krysl
  • Published 2005 in Engineering with Computers

Abstract

An attempt to reduce the computational complexity of the advancing front triangulation is described. The method is first decomposed into subtasks, and the computational complexity is investigated separately for them. It is shown that a major subtask, namely the geometric ompatibility (mesh correctness) checks can be carried out with linear growth rate. The… (More)
DOI: 10.1007/BF01200258

Topics

4 Figures and Tables

Cite this paper

@article{Krysl2005ComputationalCO, title={Computational complexity of the advancing front triangulation}, author={Petr Krysl}, journal={Engineering with Computers}, year={2005}, volume={12}, pages={16-22} }