Algorithm for generating a conformal quasi-hierarchical triangular mesh that weakly δ-approximates given polygonal lines
Vadim Nikolaevich Chugunov · Computational Mathematics and Mathematical Physics · 2009
An algorithm is proposed for generating a conformal quasi-hierarchical triangular mesh that approximates a set of given polygonal lines to accuracy δ. The solvability of the problem is guaranteed by the possibility of shifting the polygonal lines within their δ-neighborhood. The resulting mesh consists of a small number of triangles and admits a multigrid implementation. An estimate is given for the growing number of mesh triangles with decreasing δ (of order log 2 2 δ−1). The algorithm is applied to a particular set of polygonal lines.