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.





  1. 白帽子安全琐事,日常之事 转载了此文字  到 竹意
  2. 白帽子安全琐事,日常之事 转载了此文字  到 测试想法
  3. 白帽子安全琐事,日常之事 转载了此文字  到 湛天雲海碧波影
  4. 白帽子安全琐事,日常之事 转载了此文字  到 文豆 & 文库
  5. 计算机网络技术数学日记 转载了此文字  到 行者路上有風有雨有彩虹
  6. 计算机网络技术数学日记 转载了此文字  到 绿意蛙鸣
  7. 计算机网络技术数学日记 转载了此文字  到 IT 计算机&信息网络 技术
  8. 计算机网络技术数学日记 转载了此文字
©夜如墨 / Powered by LOFTER