Title: Constructing Delaunay Triangulated of Network Digital Elevation Model Based on Triangular Growth Algorithm
Abstract:This article discussed the establishment Delaunay Triangulation Net of DEM by triangular growth algorithm.First we finded the first triangle by optimal edge,following by a straight line and point geom...This article discussed the establishment Delaunay Triangulation Net of DEM by triangular growth algorithm.First we finded the first triangle by optimal edge,following by a straight line and point geometry to find possible extension points and through to find the largest angle to judge the law of Delaunay expansion to meet,the finally through the new edges and extended edges the number we judged a repeat Delaunay expansion point if or not.If the conditions are meeting,the point is used.After construction of triangulation,we used the empty circum-circle law to do the verification of the triangulation,and the result is the triangulation network to meet the requirements of Delaunay rules.Construction of triangulation and empty circum-circle law of process are compiled by m language.Read More
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