A lower bound of the distance between two elliptic orbits
Denis Mikryukov, Roman Baluev

TL;DR
This paper derives an explicit positive lower bound for the minimum orbit intersection distance (MOID) between two noncoplanar elliptic orbits, enhancing computational efficiency in asteroid catalog analysis.
Contribution
It introduces a new explicit lower bound for the MOID between two elliptic orbits, improving speed and accuracy in orbit analysis.
Findings
Lower bound is positive unless orbits intersect
Bound is expressed with elementary functions
Significant speed improvements in asteroid catalog processing
Abstract
We obtain a lower bound of the distance function (MOID) between two noncoplanar bounded Keplerian orbits (either circular or elliptic) with a common focus. This lower bound is positive and vanishes if and only if the orbits intersect. It is expressed explicitly, using only elementary functions of orbital elements, and allows us to significantly increase the speed of processing for large asteroid catalogs. Benchmarks confirm high practical benefits of the lower bound constructed.
| , AU | , s | , s | ||||||
|---|---|---|---|---|---|---|---|---|
| Pair of orbits and | , AU | , AU | , AU |
|---|---|---|---|
| 14 Irene – 32 Pomona | |||
| 4 Vesta – 17 Thetis | |||
| 722 Frieda – 1218 Aster | |||
| 946 Poesia – 954 Li | |||
| 704 Interamnia – 775 Lumiere | |||
| 1 Ceres – 512 Taurinensis | |||
| 1333 Cevenola – 4699 Sootan |
| Pair of orbits from | ||
|---|---|---|
| 3873 Roddy – 5496 1973 NA | ||
| 5496 1973 NA – 17408 McAdams | ||
| 2063 Bacchus – 3200 Phaethon | ||
| 5496 1973 NA – 5869 Tanith |
| Orbit | , AU | ||||
|---|---|---|---|---|---|
| 5335 Damocles | |||||
| 31824 Elatus |
| , AU | , AU | , AU | |||
|---|---|---|---|---|---|
| Catalog | The arithmetic mean of | The value of the distance , AU |
|---|---|---|
|
|
|
|||||||
|---|---|---|---|---|---|---|---|---|---|
| Pair of planets and | , AU | , AU | , AU | |
|---|---|---|---|---|
| Earth – Mars | ||||
| Uranus – Neptune |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
∎
11institutetext: D. V. Mikryukov 22institutetext: St. Petersburg State University, Universitetsky pr. 28, Stary Peterhof, St. Petersburg 198504, Russia
22email: [email protected] 33institutetext: R. V. Baluev 44institutetext: St. Petersburg State University, Universitetsky pr. 28, Stary Peterhof, St. Petersburg 198504, Russia;
Central Astronomical Observatory at Pulkovo of the Russian Academy of Sciences, Pulkovskoje sh. 65/1, St. Petersburg 196140, Russia
44email: [email protected]
A lower bound of the distance between two elliptic orbits
Denis V. Mikryukov
Roman V. Baluev
(Received: 09 February 2019 / Accepted: 22 May 2019)
Abstract
We obtain a lower bound of the distance function (MOID) between two noncoplanar bounded Keplerian orbits (either circular or elliptic) with a common focus. This lower bound is positive and vanishes if and only if the orbits intersect. It is expressed explicitly, using only elementary functions of orbital elements, and allows us to significantly increase the speed of processing for large asteroid catalogs. Benchmarks confirm high practical benefits of the lower bound constructed.
Keywords:
Elliptic orbits MOID Linking coefficient Distance function Catalogs Asteroids and comets Near-Earth asteroids Space debris Close encounters Collisions
††journal: Celestial Mechanics and Dynamical Astronomy
1 Introduction
The problem of computation of a distance between two confocal elliptic orbits has been intensively studied since the middle of the last century (Sitarski, 1968; Vassiliev, 1978; Dybczyński et al, 1986; Kholshevnikov and Vassiliev, 1999b; Gronchi, 2002, 2005; Armellin et al, 2010; Hedo et al, 2018).
In the present article we use the notion distance in the sense of the set theory: minimal value of distances between two points lying on two given confocal ellipses. This parameter is also known as MOID — Minimum Orbital Intersection Distance. From a practical point of view, the main difficulty of the MOID computation appears due to the lack of the general analytical solution expressing the result via explicit functions of osculating elements. A need of numerical methods arises therefore (Gronchi, 2005; Hedo et al, 2018; Baluev and Mikryukov, 2019).
As a rule, researchers are interested in finding the distance between close orbits. The precise calculation of the MOID between distant orbits is less relevant. So the problem of determining a lower bound of the MOID emerged. If the value of this bound proves to be greater than some positive number , then the distance between orbits is greater than too, and these orbits can be considered safely “far” from each other. The value of closeness threshold depends on the problem considered: which orbital distance we consider safe, and which is not.
The numeric computation of the MOID, even with fastest algorithms, is relatively expensive computationally. Therefore the direct comparison between the MOID and the threshold seems to be impractical, since modern catalogs typically have a large size. The use of relatively simple lower bound of the distance between orbits may speed up the selection of hazardously close orbits.
A simple lower bound of the distance between confocal elliptic orbits and is defined in an inequality
[TABLE]
where and are pericentre and apocentre distances of respectively. The inequality (1) holds for any two confocal ellipses and , but is informative only if the apocentre of one of the orbits lies closer to the attracting focus than the pericentre of the other. This is the case with all eight planets and Pluto except for the pair Neptune – Pluto, for which .
In practically interesting cases the estimate (1) usually appears noninformative, since becomes negative. A more practical lower bound is presented in this article. This bound is explicitly expressed through only simple functions of orbital elements.
The main idea of this lower bound is to construct in the plane of a geometrically simple two-dimensional set , containing , and then to calculate . The set is simple in the sense that it is bounded only by line segments and rays. Enclosing the orbits in such sets allows one to avoid dealing with the difficult problem of computation of the distance between second-order curves. The distance between and is easy for an analytic study, since it proves to be equal to the distance between two skew lines in , as we will show below. The distance between these skew lines serves as a positive lower bound of the quantity . It never turns negative, and vanishes if and only if and intersect.
We want to emphasize that in the present article we restrict ourselves to noncoplanar configurations of elliptic orbits (the notion of skew lines is meaningless in ). By a pair of elliptic orbits we will always mean two confocal noncoplanar conics, whose eccentricities belong to a half-open interval . We should also notice that the concept of linked or unlinked orbits (Crowell and Fox, 1963; Kholshevnikov and Vassiliev, 1999a) is essential for our work. If two orbits and have no common points ( and do not intersect), then they are either linked or unlinked. Let us recall simple geometric definitions of linked and unlinked configuration of two noncoplanar elliptic orbits. For this denote by the plane containing . The orbits and are called linked, if a part of the plane bounded by the orbit contains one and only one point belonging to the orbit . If and do not satisfy this condition, the orbits and are called unlinked. It is easy to see that these definitions are symmetrical with respect to and . Continuous transition between linked and unlinked configurations is possible only through degenerate case of intersection (see Fig. 1).
In Section 2 we formulate the problem in more precise mathematical terms. In Sections 3 and 4 auxiliary geometric constructions are given. In Section 5 we obtain the lower bound on the distance, and after that in Section 6 we examine its practical efficiency. Section 7 provides concluding discussion.
2 Mathematical setting
Let be two noncoplanar elliptic orbits with a common focus , and let Keplerian elements of both orbits refer to the inertial reference frame . Elements and all quantities related to will be marked by a stroke. Consider the orthogonal unit vectors
[TABLE]
and their cross product . Vectors , are parallel to the Laplace–Runge–Lenz vector and to the angular momentum vector, respectively. For noncoplanar orbits one always has , where is the angle between and . Hence vector never vanishes for and thereby defines the line of mutual nodes.
The point decomposes the mutual nodal line into two rays. A ray whose direction is determined by the vector intersects and at points and respectively. The points and always exist and are defined uniquely. On the opposite ray one gets two unique points and (see Fig. 1). The distance between and obviously does not exceed the quantity , so the orbits are made arbitrarily close to each other as either of quantities or approaches zero. Notice that and can tend to zero independently of each other and in various ways: one can change the size, the shape and the spatial orientation of the orbits.
Vanishing of is the necessary and sufficient condition for the intersection of noncoplanar orbits , i.e. for . But having small is only a sufficient condition for the closeness of noncoplanar in the MOID sense. In general, it is not necessary, because MOID can appear small thanks to a small or . Indeed, consider in Fig. 2 coplanar orbits and with , , . Let us turn around a common line of apses through an angle, for example, . We have
[TABLE]
If then , , while . Since endpoints of lie on different orbits, one concludes that the orbits become arbitrarily close to each other as goes to unity. Moving and along the common line of apses towards each other until their distinct foci coincide, we get an analogous example when making , the quantities , , tend to positive values, while .
We see that any of four quantities
[TABLE]
can be made arbitrarily small when the other three remain greater than some predefined positive value. The line segments and are of no interest here, since they obviously do not affect the closeness of the orbits.
Put
[TABLE]
where , and , . Then
[TABLE]
The quantities are easily expressed via osculating elements (Kholshevnikov and Vassiliev, 1999a) and hence so are (2). While and are always positive, and can vanish and change the sign. For this reason, and carry information about topological configuration of the orbits and . This question is discussed by Kholshevnikov and Vassiliev (1999a), who consider the basic properties of linking coefficient of two noncoplanar orbits111It is easy to see that if and only if and are linked, whereas if and only if , are unlinked. The case of zero corresponds to intersection and vice versa. Thus with the help of the function one can quickly find out which topological configuration the orbits and have. See (Kholshevnikov and Vassiliev, 1999a) for more details..
Let and be two arbitrary sets lying in , and let and be two arbitrary points belonging to these sets: , . By distance between and we will always mean the quantity
[TABLE]
If and are both closed and at least one of them is bounded (and thus compact), equality (3) takes the form
[TABLE]
Now we can write obvious estimates
[TABLE]
and
[TABLE]
where
[TABLE]
We take the absolute value of and in (6) for the sake of symmetry. Functions and are both continuous on the ten-dimensional set of noncoplanar pairs .
Inequalities (4) and (5) give simple upper bounds for . Kholshevnikov and Vassiliev (1999a) tried to obtain a positive lower bound for with the help of quantities considered so far. They have shown (see all details in that article) that it is reasonable to seek this bound in the form of inequality
[TABLE]
where is a positive function of three real variables . Our aim is to solve almost the same problem. We will construct a positive explicit function such that the following inequality is satisfied:
[TABLE]
Finding a suitable in the estimate (8) might be important for many practical applications. Indeed, the right-hand side of (8) is a simple and explicit function of osculating elements, so its calculation is much easier than the direct computation of . The estimate (8) also allows one to verify whether two orbits are close to an intersection spending a small CPU time.
3 Basic geometric constructions
Let be two two-dimensional closed half-planes that form a dihedral angle with the plane angle satisfying . Introduce a right-handed Cartesian coordinate system in such a way that and lies in a half-space (see Fig. 3). In the positive side of the axis draw points and such that and denote . Define lines and by vectorial parametric equations
[TABLE]
where , , ,
[TABLE]
with . We have , , , (see Fig. 3). The distance between skew lines and is given by (see, for example, Gellert et al (1989))
[TABLE]
The distance depends only on four arguments and it obviously tends to zero with . After transformations one obtains
[TABLE]
where
[TABLE]
It is easy to check that , which stems from the obvious geometric symmetry. Since , , the expression under the radical sign in (9) is always positive. Let , be two points such that . Then and (see Fig. 3). Furthermore, if any three quantities of are fixed, then tends to zero with the fourth.
Now, make free our dihedral angle from all the constructions except for the points and lying on its edge. On the face draw points and such that , where . The angle (one assumes ) with its boundary, that is a vertex and rays , , defines in the face a two-dimensional closed set (shaded in Fig. 4). Two-dimensional closed sets of type are fundamental to all further constructions. Therefore for shortness let us call them V-sets. We will define every V-set by its vertex and exterior angle. For example, we call a V-set with vertex and exterior angle . Any V-set by definition belongs to either of two faces of the dihedral angle considered. It is always assumed that vertex of any V-set lies on the edge of the dihedral angle and that exterior angle of any V-set is positive and acute.
Let be a V-set with vertex and exterior angle . The boundary of is composed from two (closed) rays and emanating from the vertex . The boundary of is also decomposed into two rays starting from a common origin . We name the rays in such a way that and intersects the plane (see Fig. 4). It is easy to prove (see Appendix) that the distance between and is equal to the distance between straight lines containing the rays and , so that .
Suppose that two V-sets having different vertices and lie in the same face of the dihedral angle, and have the same exterior angle . Then, by definition, a two-dimensional union of these V-sets will be called a W-set with vertices , and exterior angle (the graphical plot is omitted here).
Now consider another construction. Draw any four pairwise distinct points in the positive side of the axis . Let be a W-set with vertices , and exterior angle , and let be a W-set with vertices , and exterior angle (). There are three topologically different possibilities.
A) One of the segments and lies inside another.
B) These segments partly overlap each other (one endpoint of a segment belongs to another segment, but another endpoint does not).
C) These segments have no common points.
We do not consider case C), since we will not need it anywhere.
Consider case A). Let first , (see Fig. 5). Put , , . Decompose into two V-sets and with vertices and respectively. Analogously, let and be two V-sets with vertices and respectively such that (see Fig. 5). The distance between and is the smallest of the quantities
[TABLE]
Each of four quantities (10) is given by , where is supposed to be respectively. Whence
[TABLE]
On the other hand, a swap of the points and in Fig. 5 gives
[TABLE]
But anyway,
[TABLE]
If , the last formula obviously remains true.
Pass to case B) (see Fig. 6). Similar to case A) combinatorial considerations lead to the same formula (11).
In view of the above, the general formula for the cases A) and B) is (11). Notice that if any two angles of are fixed and the third tends to zero, then in all cases A), B), C) one has .
4 Basic constructions on an ellipse
Our goal in this section is to construct a two-dimensional set (see Sect. 1) that necessarily contains the given orbital ellipse. For that, we need to perform a sequence of geometric constructions layed out below.
On the plane introduce an inertial right-handed Cartesian coordinate system and consider on this plane any two different straight lines and . From now on by the angle between the lines and we will mean the angle between nonoriented lines and . Denoting by this angle, one always has .
Let us consider an elliptic orbit with an attracting focus at the origin and an empty focus lying in the negative side of the axis . Denote by the eccentricity and suppose that the orbit is oriented counterclockwise. Through the point draw an arbitrary straight line . We obtain two points of intersection and . Draw tangents and to the ellipse at the points and respectively (see Fig. 7). In the general case , where and . But if , then at any position of the line (if , one always obviously has ). The true anomaly defines the line uniquely, and the position of the line defines the quantity uniquely. Therefore if we hold fixed, we may consider as a usual function of the true anomaly . By continuity and periodicity, the function necessarily has a maximum and a minimum. The maximum value is always equal to (attained at the apses), while the minimum depends on . To find the minimum value let us write Cartesian coordinates of the position and velocity vectors (Kholshevnikov and Titov, 2007)
[TABLE]
where and are the semi-latus rectum and the gravitational parameter, respectively. Consider the function of the true anomaly
[TABLE]
that represents the cosine of the angle between the vectors and . Based on the derivative
[TABLE]
we can see that the extrema of are equal to and are attained at and (at vertices and of semi-minor axes respectively, see Fig. 7). Hence, the minimum of the periodic function is equal to (see Fig. 7). Now we are able to make the following remark.
Remark 1
Whatever the orientation of the line is, the angle between the line and either of two tangents at the points of intersection is not less than .
In Remark 1, the arbitrariness of the line (one always assumes ) is essential, since further this line will play a role of the mutual line of nodes of two orbits.
Through the points and let us draw a circumference in such a way that , where and are tangents to the circumference at the points and respectively. Such construction can be done in two possible ways, so that we obtain two (equal) circumferences sharing two common points and . We need only the shorter arcs of these circumferences subtended by a chord (see Fig. 8).
Remark 2
Whatever the orientation of the chord is, all interior points of both arcs lie inside the ellipse.
Remark 2 follows from Remark 1. The validity of Remark 2 can also be ascertained by usual means of analytic geometry.
On the segment as a base draw an isosceles triangle , whose apex lies on either of two arcs considered (see Fig. 9, where both of these arcs are dashed). A base angle is easily calculated and equals to . Draw two rays and such that , , and that points lie on one side of the line (see Fig. 9). With the help of Remark 1, one establishes that all interior points of the rays and lie outside of the ellipse, while Remark 2 guarantees that all interior points of the line segments and lie inside the ellipse. A polygonal chain on the plane defines a W-set with vertices and exterior angle . On the other side of the line we construct in an analogous way a W-set with vertices and exterior angle , that is defined in Fig. 9 by a polygonal chain .
Given any orientation of the line , the orbit is completely contained in a set . The size of the ellipse, its shape and the position of the line define the set uniquely. Further two-dimensional closed sets of type will be called by H-sets. Every H-set will be defined by vertices and exterior angle of those two (equal) W-sets, that give this H-set. For example, is an H-set with vertices and exterior angle .
Consider some properties of H-sets defined above. Every H-set is pathwise connected. The same can be said about its boundary. By rotating the line about the focus , we obtain different H-sets. But if is fixed, then all of these H-sets are similar: the only difference is the distance between the vertices. Exterior angle of any H-set satisfies . The maximum value is attained only for circular orbits. In this case a rhombus (see Fig. 9) turns into a square inscribed in a circular orbit, while this orbit itself can be considered as the result of degeneration of the circumference arcs (dashed in Fig. 9) into a union of two semicircumferences with common extremities and .
5 The lower bound of the distance between orbits
Return to the notations of the Section 2 and again consider two noncoplanar elliptic orbits and with a common focus (see Fig. 1). Denote by the mutual nodal line.
In the plane of the orbit define an H-set with vertices and exterior angle
[TABLE]
In the plane of the orbit define an H-set with vertices and exterior angle
[TABLE]
Since , , one has
[TABLE]
The planes of the orbits and decompose all the space into four dihedral angles. Divide and into W-sets , , , such that , . We name these four W-sets in such a way that and lie in the faces of that dihedral angle, whose plane angle does not exceed (so that and fall into the faces of another dihedral angle, whose plane angle does not exceed ). The sets and both have axial symmetry around the axis , which implies . Whence by (14) we obtain an estimate
[TABLE]
If the orbits and do not intersect, then they are either linked or unlinked (see Fig. 1). Suppose first that and are unlinked. Then one of the line segments and is completely contained in another one (see Fig. 1, right). Thus the relative position of and for unlinked orbits corresponds to the case A) of Section 3. Further, if and are linked, the line segments and partly overlap each other (one endpoint of the segment belongs to , but another one does not, see Fig. 1, left). So for linked orbits the relative position of and corresponds to the case B) of Section 3. Using the general formula (11) for cases A) and B) and taking into account that unlike the angle (see Section 3), the angle is allowed to lie in the second quadrant222Note that the equality defines the angle uniquely, since ., we obtain
[TABLE]
where are defined by (9), (12), (13), (6) respectively. According to (15) and (16) one obtains the final inequality
[TABLE]
where
[TABLE]
After transformations we obtain
[TABLE]
For any noncoplanar and , that is when , the function (18) is positive and satisfies .
Inequalities (5) and (17) give an effective bilateral estimate
[TABLE]
where we have put by definition
[TABLE]
If , then the functions are either together equal to zero ( intersect) or together positive ( do not intersect). The estimate (19) of the distance contains only simple and explicit functions of osculating elements. Note that the lower estimate (17), (18) formally remains true for coplanar orbits too. Indeed, from continuity of the function and boundedness of the function (see definitions (18) and (6) respectively) it follows that whenever the estimate (17) turns into a noninformative but always valid inequality .
6 On the practical efficiency of the estimate constructed
We used an asteroid orbits database of the Minor Planet Center (MPC), downloaded from the official site https://minorplanetcenter.net on November 10, 2018. On that date this database contained numbered objects. We used the first of these for constructing three different catalogs of orbit pairs. Each catalog has been constructed in accordance with the given value of an upper threshold of the distance between two orbits and (see Table 1). Namely, of all pairs in the original sample , we put in each catalog those and only those pairs and that satisfied the condition . The computation of the distance was carried out by means of the software described by Baluev and Mikryukov (2019) and available for download at http://sourceforge.net/projects/distlink. This software provides a numeric implementation of the algebraic method presented by Kholshevnikov and Vassiliev (1999b), similar to the one presented by Gronchi (2002, 2005). All calculations in our work have been carried out with an Intel Core i5-4460 PC @ 3.2GHz with 7.7GiB of RAM.
For catalogs the values of were chosen to be approximately four ( AU), two ( AU) and one ( AU) Earth–Moon distances, respectively (see Table 1). Clearly, the smaller the value of , the smaller the number of asteroid pairs contained in catalog. Thus we have . Each catalog has been constructed two times in different ways.
The first way to build was to calculate for each orbit pair in . If a pair from satisfied , then it was put in the catalog; otherwise, it was skipped. According to Table 1, the average computation time of building each catalog in such a way is approximately seconds. Whence the average computation time of per one pair is
[TABLE]
After that, the same catalogs were built in the second way, which uses the estimate (17), (18). For each pair from the function was initially calculated. The distance was calculated if and only if satisfied
[TABLE]
The pair of , was written in the catalog if and only if it satisfied . The time of constructing the catalog in the second way is expected to be less than the time of constructing the same in the first way, since in the second case is computed not for all pairs from (but only for those satisfying (22)). Obviously, the less , the more significant difference between and should be. Table 1, where we present our values of for each , confirms these evident assumptions.
In Table 2, we give for some orbit pairs from our values of the functions that are in the estimate (19).
Let us try to approximately determine how many times the average time spent on the calculating the function and verifying the condition (22) (per one pair) less than the average time computed above. To do so, notice that when is calculated in the second way the computation of and verifying (22) are performed for all pairs from . But the distance is computed only for orbit pairs, where is a number of pairs that have not satisfied (22) (a number of skipped pairs, where orbits are definitely distant from each other). So the time is roughly made up of two parts: (calculating and verifying (22) for every pair from ) and (computation of only for potentially close orbits)333A more precise calculation should take into account, for example, accompanying file IO operations.. We obtain an equation
[TABLE]
where and are supposed to correspond to the same (see Table 1). From (23), (21) one obtains , , for , , respectively, whence by (21) finally
[TABLE]
We see that a selection criterion of potentially close orbits based on the computation of the function and comparing it with some threshold value is processed approximately twenty times faster than the direct computation of . These figures are rather rough, but even so they clearly show what computational benefits can be gained when using the estimate (17), (18).
The values of timedimensional quantities and are heavily dependent on the hardware used. The same can be said about and (see Table 1). However if is computed by the same software, the dimensionless quantity should keep approximately the same value. When other software is used (see for example, Gronchi, 2005; Hedo et al, 2018), the value of may differ significantly from our one. Indeed, benchmarking tests carried out in our previous article (Baluev and Mikryukov, 2019) reveal that computational performance (time of calculating per one pair) vary considerably from one software to another (see also Hedo et al, 2018). On the other hand, the computation of the estimate (17), (18) is not a numeric issue for any computation MOID library. We conclude that the slower the MOID computation numeric algorithm (when testing on the same hardware and with the same precision), the larger the quantity should be. In contrast, the time ratio is expected to be less susceptible to a change of the software used, because mainly depends only on the number of skipped pairs . Again, this our conclusions regarding the quantities , and their dependence on the concrete MOID numeric library are rather empirical and need more thorough and complete investigation.
7 Discussion
With the result presented above we are able to quickly compute the two-sided range for the MOID without computing the MOID itself. The lower bound of the MOID is rather novel result, and it is probably more important for practical applications than the upper one. However, the efficiency of this bound still needs to be discussed.
The lower bound for is hardly optimal. Consider for example two circular perpendicular orbits (, ). The relations (17), (18) give
[TABLE]
though it is clear that in this case . The values of , given in Table 2 also suggest that the lower bound is not optimal. We calculated the ratio for all pairs in the original sample and collected in Table 3 four pairs having the largest (among all pairs) values of . As Table 3 indicates, none of the pairs from show an inequality . This result is even worse than that corresponds to circular perpendicular case considered above. Nevertheless, during our experiments with the whole database MPC we managed to find one pair of real orbits for which . Centaurs Damocles and Elatus (catalog numbers 5335 and 31824 respectively) get . In Table 4 we give the elements of these orbits, and in Table 5 we present the main characteristics of their configuration. Is there an example of a pair of orbits (real or simulated) with ? So far we have never seen such configurations, but our opinion is that these must exist. Perhaps further large scale experiments will reveal444Notice that cometary mutual elements proposed by Gronchi (2005) may prove to be more suitable for large scale experiments than usual orbital elements given in Table 4. orbital configurations showing .
According to our general observations, in the Main Belt an inequality is rather rarely satisfied. We observe big values ( – ) of mainly in pairs having a significant mutual inclination and relatively large eccentricities. Usually those pairs are composed of asteroids belonging to, for instance, Centaurs or Hungaria family. In Table 6 we give an averaged value (the usual arithmetic mean) of the ratio for the original sample and for its subcatalogs , , . An analysis of Table 6 leads to curious observation: the mean value of is very close to and becomes even closer to as the value of decreases.
The notion of the distance between two skew lines is the foundation of all constructions made in the work, so that the appearance of in the numerator of (18) is natural (see the numarator of (9)). It follows that the lower bound is heavily dependent on the mutual inclination, and that the efficiency of the estimate decreases as the orbital configuration approaches the coplanar one. To illustrate this point, we constructed three different samples , , , containing one million of pairs each. We put in the catalog only those pair configurations, where the angle between nonoriented orbital planes does not exceed . The sample contains only those pairs that have . In the catalog each pair has . The samples , , have been composed of arbitrary pairs of real orbits (we used for constructing , , all numbered objects of MPC database) and the value of was the only criterion for compiling of these catalogs. This time along with an averaged value of we also calculated the arithmetic mean of the ratio . Simple geometric considerations (see Fig. 1 and definitions (6), (20) of and respectively) lead to intuitive inference regarding the behaviour of and : the more , the closer to unity the (mean) ratios and should be555Indeed, if the planes of confocal ellipses are far from coplanar configuration, then the line segment representing the MOID most likely (especially when , are small) is located near the mutual line of nodes. It follows that and are expected to approach each other ( tends to unity) as the orbital configuration approaches the perpendicular one. Further, the function in (17) obviously increases when (provided and are hold fixed), which means that is also expected to increase as .. These assumptions are confirmed by Table 7, where we present our mean values of and for each .
Unlike , other two bounds and considered in this work (see definitions (6) and (1) respectively) are certainly optimal. Indeed, for circular perpendicular orbits () with radii and we obviously have
[TABLE]
Another simple but less obvious example of configuration with is given by two linked orbits with , where is a some small positive number. It is easy to check that if is sufficiently small, then . Note that for linked orbits one always has , though the converse statement is not true.
In conclusion let us notice that does not depend on the mutual inclination . It implies that in some evident cases — particularly when are quite small — the lower bound can be much tighter than . First of all we mean here configurations composed of main planets of our Solar System, whose orbits have significantly different physical sizes. Taking the values of the elements from (Zheleznov et al, 2017) we compare in Table 8 lower bounds and of the distance for two such configurations.
Appendix: The distance between two V-sets
The proof of the following lemma is very simple and therefore is omitted.
Lemma Let be two arbitrary sets satisfying the following three conditions:
i) .
ii) There are two points and such that .
iii) The pair is the only element of a set that gives .
Then, for any two subsets and such that and one always has .
For example, if two points and lie on skew lines and respectively and satisfy , then for any two rays and (open or closed, no matter) such that , , , we have .
Consider again two two-dimensional closed half-planes and that form a dihedral angle in with the plane angle satisfying (see Fig. 10). In the positive side of the axis draw points and such that . Given any positive acute angles and , define in the face a V-set with a vertex and an exterior angle , and in the face construct a V-set with a vertex and an exterior angle (see Fig. 10). Decompose boundaries of and into four closed rays , where , , in such a way that both intersect the plane . Further, draw two straight lines , such that and . The line defines in the plane of a closed half-plane that (completely) contains . Similarly, define a closed half-plane with the edge such that (see Fig. 10). Our aim is to prove that
[TABLE]
First of all, draw two points and that give . It is easy to check, that under the conditions
[TABLE]
we always have . This yields , and hence we can write
[TABLE]
Further, show that and satisfy all conditions of Lemma. For this, we prove that
[TABLE]
and verify that a pair is the only element of a set satisfying (26). Fix any pair distinct from the pair . It suffices to prove that . There are three possibilities.
A) , .
B) One of the points is interior for the half-plain containing it, while another is boundary one.
C) , .
Consider case A). Since straight lines and are skew, one concludes .
Consider case B). Let, for example, , (see Fig. 10). Through the point draw a straight line and denote by a point where (dashed in Fig. 10) meets the axis . We have
[TABLE]
and therefore .
Case C) differs from case B) only in that we have to draw auxiliary straight lines in both half-planes and .
We see that and satisfy all conditions of Lemma. In view of (25) by Lemma we conclude that
[TABLE]
which finally implies (24).
Acknowledgements.
We are grateful to Professor K. V. Kholshevnikov for the statement of the problem, for important remarks and for his help in preparing the manuscript. We also express gratitude to A. Ravsky for valuable discussion as well as unknown reviewers, whose constructive and valuable comments greatly helped the authors to improve the manuscript. All calculations made in the work were conducted by means of the equipment of the Computing Centre of Research Park of Saint Petersburg State University. This work is supported by the Russian Science Foundation grant no. 18-12-00050.
Compliance with Ethical Standards
Conflict of interest: The authors declare that they have no conflicts of interest. Ethical approval: This article does not contain any studies with human participants or animals performed by any of the authors. Informed consent: This research did not involve human participants.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Armellin et al (2010) Armellin R., Di Lizia P., Berz M., Makino K.: Computing the critical points of the distance function between two Keplerian orbits via rigorous global optimization. Celest. Mech. Dyn. Astr. 107, 377–395 (2010)
- 2Baluev and Mikryukov (2019) Baluev R. V., Mikryukov D. V.: Fast error-controlling MOID computation for confocal elliptic orbits. Astronomy and Computing 27, 11–22 (2019)
- 3Crowell and Fox (1963) Crowell R. H., Fox R. H.: Introduction to Knot Theory. Berlin, Springer-Verlag (1963)
- 4Dybczyński et al (1986) Dybczyński P. A., Jopek T. J., Serafin R. A.: On the minimum distance between two Keplerian orbits with a common focus. Celestial Mechanics 38, 345–356 (1986)
- 5Gellert et al (1989) Gellert W., Gottwald S., Hellwich M., Kästner H., Künstner H.: VNR Concise Encyclopedia of Mathematics, 2nd ed. New York, Van Nostrand Reinhold (1989)
- 6Gronchi (2002) Gronchi G. F.: On the stationary points of the squared distance between two ellipses with a common focus. SIAM. J. Sci. Comp. 24(1), 61–80 (2002)
- 7Gronchi (2005) Gronchi G. F.: An algebraic method to compute the critical points of the distance function between two Keplerian orbits. Celest. Mech. Dyn. Astr. 93, 295–329 (2005)
- 8Hedo et al (2018) Hedo J. M., Ruíz M., Peláez J.: On the minimum orbital intersection distance computation: a new effective method. Monthly Notices of the Royal Astronomical Society 479(3), 3288–3299 (2018)
