Title: Triangulation Algorithm of Scattered Data on Planar Domain
Abstract:After reviewing simply prevalent generation algorithms of Delaunay triangulation, divideconquer, incremental insertion and triangulation growth,presents a fast and efficient triangulation algorithm on...After reviewing simply prevalent generation algorithms of Delaunay triangulation, divideconquer, incremental insertion and triangulation growth,presents a fast and efficient triangulation algorithm on the base of incremental insertion,the scattered data on 2D shape are triangulated by this algorithm.Triangular mesh optimization is done at the same time with mesh creating,the resulted mesh is fit to Delaunay criteria.Read More
Publication Year: 2002
Publication Date: 2002-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