분할 Delaunay 삼각화 알고리즘 개발

Development of Delaunay Triangulation Algorithm Using Subdivision

  • 박시형 (건국대학교 대학원 기계설계학과) ;
  • 이성수 (건국대학교 공과대학 기계설계학과)
  • 발행 : 2002.12.01

초록

Delaunay triangulation is well balanced in the sense that the triangles tend toward equiangularity. And so, Delaunay triangulation hasn't some slivers triangle. It's commonly used in various field of CAD applications, such as reverse engineering, shape reconstruction, solid modeling and volume rendering. For Example, In this paper, an improved Delaunay triangulation is proposed in 2-dimensions. The suggested algorithm subdivides a uniform grids into sub-quad grids, and so efficient where points are nonuniform distribution. To get the mate from quad-subdivision algorithm, the area where triangulation-patch will be most likely created should be searched first.

키워드

참고문헌

  1. Computational Geometry and Computer Graphics in C++ Michael, J. Laszlo
  2. Computing in Euclidean Geometry Ding-Zhu Du;Frank Hwang
  3. Algorithmica v.2 A Faster Divide and Conquer Algorithm for Constructing Delaunay Triangulations Rex A. Dwyer https://doi.org/10.1007/BF01840356
  4. Algorithmica v.4 Primitives for the Manipulation of Three-Dimensional Subdivisions David P. Dobkin;Michael J. Laszlo https://doi.org/10.1007/BF01553877
  5. Computer-Aided Design v.30 no.5 Dewall : A fast divide and conquer Delaunay triangulation algorithm in Eb P. Cignoni;C. Montani;R. Scopigno https://doi.org/10.1016/S0010-4485(97)00082-1
  6. IEEE Computer Graphics and Applications v.13 no.3 Delaunay Triangulation Using a Uniform Grid Tsung-Pao Fang;Les A. Piegl https://doi.org/10.1109/38.210490
  7. IEEE Computer Graphics and Applications v.15 no.5 Delaunay Triangulation in Three Dimensions Tsung-Pao Fang;Les A. Piegl https://doi.org/10.1109/38.403829
  8. Computing In Euclidean Geometry Dign-Zhu Du;Frank Hwang
  9. The Computer J. v.24 no.2 Computing Dirichlet Tessellations A. Bowyer https://doi.org/10.1093/comjnl/24.2.162
  10. ACM Trans, Graphics v.9 no.1 Simulation of Simplicity a technique to cope with degenerate cases in geometric computations H. Edelsbrunner;E.P. Mucke https://doi.org/10.1145/77635.77639
  11. ACM Trans. Graphics v.10 no.1 Efficient Delaunay triangulation using rational arithmetic M. Karasick;D. Lieber;L. Nackman https://doi.org/10.1145/99902.99905
  12. Algorithmica v.7 Randomized Incremental Construction of Delaunay and Voronoi diagrams L.J. Guibas;D.E. Knuth;M. Sharir https://doi.org/10.1007/BF01758770
  13. 한국과학기술원, 석사학위논문 셀 분할을 이용한 3D 삼각형망 생성 정원형
  14. CAD/CAM학회 논문집 v.1 no.3 삼차원 곡면에서 삼각형 유한요소망의 자동 생성 채수원;손창현