ICCSA 2003: Computational Science and Its Applications — ICCSA 2003 pp 407-417 | Cite as
“CONTOUR” Algorithm for Finding and Visualizing Flat Sections of 3D-Objects
Abstract
One of the visualization problems implies finding boundaries and insides of flat sections of 3D objects specified analytically. This problem is to be solved to analyze the results and to control the geometry specification. On the one hand, the analytic definition of profiles for “not simple” 3D-objects in general case is actually unsolvable problem; on the other hand, it is necessary to apply virtual designing of 3D-objects in the field of numerical simulation.
The numerical algorithm “CONTOUR” is proposed for finding the connected section contour of 3D-objects, which are specified analytically in the form of second-order planes and rotation connected by multiple-theoretic operations. “CONTOUR” algorithm suggests using topologically parallel scanning for generating the empirical values, and then, considering them in the process of isoline generation, the polygonal section contour is constructed.
Keywords
Vertical Generation Flat Section Section Contour Contour Algorithm Additional GridPreview
Unable to display preview. Download preview PDF.
References
- 1.A.V. Adeev, I.V. Adeeva, N.A. Pavlova. Set-Theoretical Approach for 3D Geometry in MC Software Package at ELBRUS-2//VII All-Union Conference “Monte Carlo Technique in Calculation Mathematics and Mathematical Physics”. Theses. — Novosibirsk: AUC SB AS USSR, 1991.Google Scholar
- 2.Ogibin V. N., Kholushkin V. S., Nesterenko L. V. Problem-Oriented Interface for Solution for Equations with Partial Derivatives//Computational Technologies. — Novosibirsk: IVT RAS, 1992.Google Scholar
- 3.A.V. Adeev, I.V. Addeva, N.A. Pavlova On Geometrical Provision of Calculations by Monte Carlo Technique in RFNC-VNIITF. Preprint №160. Published in RFNC-VNIITF. Snezhinsk 1999.Google Scholar
- 4.Arnautova M. A., Kandiev Ya. Z., Lukhminsky B. E., Malyshkin G.N. Monte Carlo Simulation in Nuclear Geophysics. Intercomparison of the PRIZMA Monte Carlo Program and Benchmark Experiments // Nucl. Geophys. — 1993. — Vol. 7,N3. — P. 407–418.Google Scholar
- 5.Kandiev Ya. Z., Malyshkin G. N. Modeling by Value Implemented in Prizma Code / V Joint Russian-American Computational Mathematics Conference. Sandia Report. SAN98-1591.-1998.-P. 149–158.Google Scholar
- 6.Kuratovski K., Mostovski A. Set Theory.-M:.Mir, 1970.Google Scholar
- 7.Bayakovsky Yu. M., Galaktionov V.A., Mikhailova T. N. Grafor. Graphical enhancement of Fortran.-M.:Nauka, 1985.Google Scholar