ALGORITHM CONTOUR FOR FINDING AND VISUALIZATION OF FLAT SECTIONS OF 3D-OBJECTS
S. V. Kolomeyko, S. N. Melnikova, D. V. Mogilenskikh
VANT. Ser.: Mat. Mod. Fiz. Proc 2005. Вып.1. С. 80-91.
Combinatorial geometry is applied in Monte-Carlo methods for 3D-objects definition that allows prompt logical localization of particles. The evident advantage of the method lies in the relative shortness of complex geometry description. However, certain difficulties in geometry visual control exist because in this case visualization is more difficult than in the case of grid models. The paper discusses a solution (algorithm CONTOUR) for defining and visualization of arbitrary plane sections on the basis of procedures present in any code using Monte-Carlo method. It should be noted that the most evident method of visualization is section plane dense routing (rendering). The method has several shortcomings. The contour algorithm does not change the rule of rendering but interprets and processes rendering results in another way. The basis idea consists in considering the section plane as a discrete grid domain.
|
English
