AN ALGORITHM FOR DEFINING THE SHORTEST DISTANCE BETWEEN TWO POINTS WITH ENVELOPING OF AN ELLIPSOID OF REVOLUTION
D. Yu. D’yanov, K. V. Tsiberev VANT. Ser.: Mat. Mod. Fiz. Proc 2008. Вып.2. С. 31-40.
This paper describes basic principles of solving the problem of defining the shortest distance between two points in space with enveloping of an ellipsoid of revolution. Some aspects of software implementation in the LEGAK-3D computational technique are given.
|