Title: Algorithm for Delaunay triangulation of simple polygon based on minimum distance
Abstract: The Delaunay triangulation of simple polygon, being basic methods of calculating geometry, is widely applied to computer graphics and 3D geographic modeling. A algorithm for delaunay triangulation of simple polygon based on minimum distance is presented. Through the triangle minimum distance, the initial triangular net is formed and triangulated. Then the algorithm running time is analyzed. The example shows the algorithm is improved efficiently in running time and triangle configuration.
Publication Year: 2009
Publication Date: 2009-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot