Yang, Bin and Shang, Shuyuan (2012) Research on Algorithm of the Point Set in the Plane Based on Delaunay Triangulation. American Journal of Computational Mathematics, 02 (04). pp. 336-340. ISSN 2161-1203
Text
AJCM_2012123115075191.pdf - Published Version
Download (442kB)
AJCM_2012123115075191.pdf - Published Version
Download (442kB)
Official URL: https://doi.org/10.4236/ajcm.2012.24046
Abstract
In the paper, an improved algorithm is presented for Delaunay triangulation of the point-set in the plain. Based on the original algorithm, we propose the notion of removing circle. During the process of triangulation, and the circle dynamically moves, the algorithm which is simple and practical, therefore evidently accelerates the process of searching a new point, while generating a new triangle. Then it shows the effect of the algorithm in the finite element mesh.
Item Type: | Article |
---|---|
Subjects: | AP Academic Press > Mathematical Science |
Depositing User: | Unnamed user with email support@apacademicpress.com |
Date Deposited: | 19 Jun 2023 06:25 |
Last Modified: | 18 Oct 2024 04:14 |
URI: | http://info.openarchivespress.com/id/eprint/1603 |