Delaunay 三角剖分 – 從 2-D Delaunay 到 3-D Delaynay

Delaunay Triangulation – From 2-D Delaunay to 3-D Delaunay
Author: Wang Jing
Institute: School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore

 
Delaunay triangulations are widely used in scientific computing in many diverse applications. While there are numerous algorithms for computing triangulations, it is the favorable geometric properties of the Delaunay triangulation that make it so useful.

 
 

delaunay

 
 

The fundamental property is the Delaunay criterion. In the case of 2-D triangulations, this is often called the empty circumcircle criterion. For a set of points in 2-D, a Delaunay triangulation of these points ensures the circumcircle associated with each triangle contains no other point in its interior. This property is important. In the illustration below, the circumcircle associated with T1 is empty. It does not contain a point in its interior. The circumcircle associated with T2 is empty. It does not contain a point in its interior. This triangulation is a Delaunay triangulation. This presentation discusses how to extend 2-D Delaunay to 3-D Delaynay.
 
 

Source:
http://mathpost.tumblr.com/post/118858562380/delaunay-2-d-delaunay-3-d-delaynay

 

 

 

 

Advertisements
This entry was posted in Articles, Computing, Mathematics and tagged , , , , , , , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s