Triangulation of scattered date in 3D space
1988; Elsevier BV; Volume: 20; Issue: 5 Linguagem: Inglês
10.1016/0010-4485(88)90069-3
ISSN1879-2685
AutoresByoung-Chul Choi, Hayong Shin, Youngwoo Yoon, J. W. LEE,
Tópico(s)Advanced Numerical Analysis Techniques
ResumoTriangular interpolants are widely used to construct smooth surfaces from scattered data in 3D. To apply smooth triangular interpolants, the input 3D points have to be triangulated. This paper presents an algorithmic procedure for 3D triangulation. Relevant algorithms and datastructures are described in detail. Existing methods of 2D triangulation are based on Thiessen polygonization, which is an optimal partitioning of a geometric domain. To obtain an optimal triangular grid on the domain, the max-min angle criterion is frequently used. As there is no domain for 3D points, a new criterion called the smoothness criterion is proposed.
Referência(s)