|
Preprints of the Keldysh Institute of Applied Mathematics, 2006, 009, 32 pp.
(Mi ipmp557)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Development and implementation of algorithms for constrained volume triangulations: iterative algorithms
M. P. Galanin, I. A. Sheglov
Abstract:
Three main families of iterative algorithms for free and constrained simplicial volume triangulation are described: boundary correction (including ‘octree’ algorithm), Delaunay-based methods and advancing front approach. For each method type an example algorithm is given.
Citation:
M. P. Galanin, I. A. Sheglov, “Development and implementation of algorithms for constrained volume triangulations: iterative algorithms”, Keldysh Institute preprints, 2006, 009, 32 pp.
Linking options:
https://www.mathnet.ru/eng/ipmp557 https://www.mathnet.ru/eng/ipmp/y2006/p9
|
|