References
- Computational Geometry and Computer Graphics in C++ Michael, J. Laszlo
- Computing in Euclidean Geometry Ding-Zhu Du;Frank Hwang
- Algorithmica v.2 A Faster Divide and Conquer Algorithm for Constructing Delaunay Triangulations Rex A. Dwyer https://doi.org/10.1007/BF01840356
- Algorithmica v.4 Primitives for the Manipulation of Three-Dimensional Subdivisions David P. Dobkin;Michael J. Laszlo https://doi.org/10.1007/BF01553877
- 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
- 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
- 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
- Computing In Euclidean Geometry Dign-Zhu Du;Frank Hwang
- The Computer J. v.24 no.2 Computing Dirichlet Tessellations A. Bowyer https://doi.org/10.1093/comjnl/24.2.162
- 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
- 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
- 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
- 한국과학기술원, 석사학위논문 셀 분할을 이용한 3D 삼각형망 생성 정원형
- CAD/CAM학회 논문집 v.1 no.3 삼차원 곡면에서 삼각형 유한요소망의 자동 생성 채수원;손창현