文豆 & 文库

行者路上有風有雨有彩虹:

點滴的記錄:

S-E-A-S-O-N-S
Overcome with Emotion   -    拾秋

 

 

  

 拾拣落叶
 来温暖10月
 在火上借梦
 梦芳草遍野


   
   
   
秋一心一意的装点忆河   
梦畔奔波着寻找者   
吮吸梦   
撒一路泪和恨   
独自舞拨传说在风中站成笑的礁石,   
在雨中立成愉快的肖像!    



 

 

 

 

 

作者:
王晶 (Essayjeans)
写于新加坡南洋理工大学 
http://www.tetraph.com/justqdjing/

 

 

 

 

 

Delaunay 三角剖分 - 从 2-D Delaunay 到 3-D Delaynay

琐事,日常之事:

IT 计算机&信息网络 技术:

数学日记:

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.


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://www.diebiyi.com/articles/research/math/delaunay-triangulation-from-2d-delaunay-to-3d-delaunay.pdf