RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2006 010, 32 pp. (Mi ipmp558)

This article is cited in 8 papers

Development and implementation of algorithms for constrained volume triangulations: direct methods

M. P. Galanin, I. A. Sheglov


Abstract: A short overview and a classification of existing simplicial discretization algorithms are given. A mesh quality evaluation method is proposed. Direct discretization methods are discussed with the emphasis on optimal patterns for sphere-like, cylinder-like and box-like volumes. Also a method for mesh mapping (based on isoparametric mapping) is described.



© Steklov Math. Inst. of RAS, 2024