AUTHORS - VANT | VOPROSY ATOMNOY NAUKI I TEKHNIKI

Since 1978
Published in Sarov (Arzamas-16), Nizhegorodskaya oblast

RUSSIAN FEDERAL
NUCLEAR CENTER -

ALL-RUSSIAN RESEARCH INSTITUTE
OF EXPERIMENTAL PHYSICS

Русский |

English

VISUALIZATION OF STREAM LINES AND METHODS FOR COMPLEX VISUALIZATION OF DESCRETE VECTOR FIELDS

K. V. Dedkova, D. V. Mogilenskikh, I. V. Pavlov, V. V. Fedorov
VANT. Ser.: Mat. Mod. Fiz. Proc 2005. Вып.1. С. 71-79.

The paper describes methods for post-processing and visualization of continuum mechanics problems numerically simulated with difference methods, in particular, processing and visualization of vector fields.

Simulation methods using 2D regular difference grids are used as an example. A vector variable U is set for such a grid. Two coordinate components of the vector (U_x,U_y) are specified for each node. Each component is a scalar. Vector field is stored as two matrices U_x[M, N], U_y[M,N], where M, N are grid dimensionality.

Paper describes:

1. Algorithm for approximate determination and visualization of stream lines (SL) — post-processing of the results and determination of implicit information.

2. Functions of SL visualization — visualization methods.

3. Methods of combined application of SL visualization with other visualization functions — information content increase.

Ideas of Gouraund and Phong shading algorithms are proposed for determination of SL vector field.

The paper presents methods of animating pseudo-dynamics of SL vector fields and their implementation.

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.

[ Back ]