An adaptive triangulation optimization algorithm based on empty circumcircle
| Autor: | Lianhong Shen, Zhongshan Yang, Shougang Hao |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Basis (linear algebra)
Computer science Delaunay triangulation Diagonal Triangle mesh Trigonometric functions Triangulation (social science) Point (geometry) Computer Science::Computational Geometry Circumscribed circle Algorithm ComputingMethodologies_COMPUTERGRAPHICS MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | 2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC). |
| Popis: | Delaunay triangulation is widely used in the field of geosciences and computer because of its good geometric characteristics. This article is optimized on the basis of the traditional growth method. Starting from the empty circle relationship between the extension point and the extension edge, the optimization algorithm is used to compare adjacent The size relationship of the diagonal cosine value of the triangle realizes the rapid detection and optimization of the quality of the triangle mesh. The algorithm in this paper can quickly generate an adaptive triangulation network, which can dissect irregular models such as bridges, single ore, and piers. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|