A method for estimating the minimum distance between two flight vehicles during their separation
Abstract
A method is proposed for estimating the minimum distance between two flight vehicles (the carrier and the cargo) that are in the process of separation. For this purpose, the surface areas for which the contact is most probable are approximated by a set of triangular and a set of quadrilateral facets, and the minimum distance between these sets is determined through an exhaustive search. Two methods are proposed for reducing the number of combinations that need to be processed: (1) by examining the elements of both sets in the vicinities of 'dangerous' points (which are few); and (2) by examining only those 'facetapex' combinations where the outer surface of a facet could be illuminated by light beams emanating from the apex as a source. The efficiencies of these methods are compared.
 Publication:

TsAGI Uchenye Zapiski
 Pub Date:
 1990
 Bibcode:
 1990ZaTsA..21..107I
 Keywords:

 Approximation;
 Computational Geometry;
 Distance;
 Stage Separation;
 Algorithms;
 Flight Safety;
 Fuselages;
 Polygons;
 Triangles;
 Launch Vehicles and Space Vehicles