Title: Universal Point,Line and Polygon Delaunay Triangulation and Dynamic Editing
Abstract:This paper summarizes and presents a kind of universal algorithm of generic points,lines and polygon Delaunay triangulation and dynamic editing.Discrete points,constrained line,polygon,polygon feature...This paper summarizes and presents a kind of universal algorithm of generic points,lines and polygon Delaunay triangulation and dynamic editing.Discrete points,constrained line,polygon,polygon features with zone constraints(including point,line,polygon) Delaunay triangulation can be achieved.The outer boundary of Delaunay triangulation in general is the convex bumps of discrete points,and the inner islands generally do not dig out.The algorithm in process of the Delaunay triangulation,realized the inner and outer boundary processing.Read More
Publication Year: 2011
Publication Date: 2011-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