Global balancing of a triangular mesh
New algorithm for Steiner triangular mesh balancing is proposed. The algorithm is based on the least squares method and minimizes the standart deviation of triangulation angles cosines from the optimal value of 0.5. The algorithm has no limitations and therefore can be applied to any triangulations...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Belarusian |
| Published: |
Belarusian State University
2018-05-01
|
| Series: | Журнал Белорусского государственного университета: Математика, информатика |
| Subjects: | |
| Online Access: | https://journals.bsu.by/index.php/mathematics/article/view/889 |
| Summary: | New algorithm for Steiner triangular mesh balancing is proposed. The algorithm is based on the least squares method and minimizes the standart deviation of triangulation angles cosines from the optimal value of 0.5. The algorithm has no limitations and therefore can be applied to any triangulations obtained by triangular mesh refinement algorithms, for example Ruppert or Erten and Üngör algorithms, without increasing the resulting number of points and without breaking the edge connections. Experiments indicate that the proposed algorithm significantly increases the number of angles in range from 50 to 70° and doesnʼt lead to create triangles with significantly smaller minimum angles. The algorithm can be effectively implemented using specialized software packages for quick solving sparse linear systems using the leastsquares method, for example SuiteSparse. Therefore the algorithm is easy to implement. |
|---|---|
| ISSN: | 2520-6508 2617-3956 |