Less Restrictive Conditions on Distance Functions: Continuity Instead of Triangle Inequality

Author(s):  
Thomas Lorenz
Author(s):  
Konstantin V. Kholshevnikov ◽  
◽  
Danila V. Milanov ◽  
Anastasia S. Shchepalova ◽  
◽  
...  

Distance functions on the set of Keplerian orbits play an important role in solving problems of searching for parent bodies of meteoroid streams. A special kind of such functions are distances in the quotient spaces of orbits. Three metrics of this type were developed earlier. These metrics allow to disregard the longitude of ascending node or the argument of pericenter or both. Here we introduce one more quotient space, where two orbits are considered identical if they differ only in their longitudes of nodes and arguments of pericenters, but have the same sum of these elements (the longitude of pericenter). The function q is defined to calculate distance between two equivalence classes of orbits. The algorithm for calculation of ̺6 value is provided along with a reference to the corresponding program, written in C++ language. Unfortunately, ̺6 is not a full-fledged metric. We proved that it satisfies first two axioms of metric space, but not the third one: the triangle inequality does not hold, at least in the case of large eccentricities. However there are two important particular cases when the triangle axiom is satisfied: one of three orbits is circular, longitudes of pericenters of all three orbits coincide. Perhaps the inequality holds for all elliptic orbits, but this is a matter of future research.


1982 ◽  
Vol 89 (2) ◽  
pp. 123-154 ◽  
Author(s):  
Amos Tversky ◽  
Itamar Gati
Keyword(s):  

2014 ◽  
Vol 13 (1) ◽  
pp. 4127-4145
Author(s):  
Madhushi Verma ◽  
Mukul Gupta ◽  
Bijeeta Pal ◽  
Prof. K. K. Shukla

Orienteering problem (OP) is an NP-Hard graph problem. The nodes of the graph are associated with scores or rewards and the edges with time delays. The goal is to obtain a Hamiltonian path connecting the two necessary check points, i.e. the source and the target along with a set of control points such that the total collected score is maximized within a specified time limit. OP finds application in several fields like logistics, transportation networks, tourism industry, etc. Most of the existing algorithms for OP can only be applied on complete graphs that satisfy the triangle inequality. Real-life scenario does not guarantee that there exists a direct link between all control point pairs or the triangle inequality is satisfied. To provide a more practical solution, we propose a stochastic greedy algorithm (RWS_OP) that uses the roulette wheel selectionmethod, does not require that the triangle inequality condition is satisfied and is capable of handling both complete as well as incomplete graphs. Based on several experiments on standard benchmark data we show that RWS_OP is faster, more efficient in terms of time budget utilization and achieves a better performance in terms of the total collected score ascompared to a recently reported algorithm for incomplete graphs.


2008 ◽  
Vol 37 (3) ◽  
Author(s):  
Jacek Urbański ◽  
Agata Ślimak

Assessing flood risk and detecting changes of salt water inflow in a coastal micro-tidal brackish marsh using GISIn order to assess changes in salt water inflow and potential flood risks due to sea level rise in a micro-tidal Beka brackish marsh on the Polish Baltic Coast GIS was used. Such wetlands are important elements of coastal zone natural environments. Creating a geodatabase within a GIS system makes it possible to carry out broad analyses of complex systems, such as coastal wetlands. The results indicate that a 40 cm sea-level rise would considerably increase the frequency of flooding in the investigated area, in part because of the small range of the annual sea level oscillations there. A map of the index of changes in saltwater inflow, created with the help of cost-weighted distance (functions), shows that changes which have occurred along the shore, consisting of filling in the drainage channel outlets, have likely had a significant impact on the vegetation of the area.


2011 ◽  
Vol 8 (1) ◽  
pp. 201-210
Author(s):  
R.M. Bogdanov

The problem of determining the repair sections of the main oil pipeline is solved, basing on the classification of images using distance functions and the clustering principle, The criteria characterizing the cluster are determined by certain given values, based on a comparison with which the defect is assigned to a given cluster, procedures for the redistribution of defects in cluster zones are provided, and the cluster zones parameters are being changed. Calculations are demonstrating the range of defect density variation depending on pipeline sections and the universal capabilities of linear objects configuration with arbitrary density, provided by cluster analysis.


Filomat ◽  
2017 ◽  
Vol 31 (14) ◽  
pp. 4587-4612 ◽  
Author(s):  
S.K. Padhan ◽  
Rao Jagannadha ◽  
Hemant Nashine ◽  
R.P. Agarwal

This paper extends and generalizes results of Mukheimer [(?,?,?)-contractive mappings in ordered partial b-metric spaces, J. Nonlinear Sci. Appl. 7(2014), 168-179]. A new concept of (?-?1-?2)-contractive mapping using two altering distance functions in ordered b-metric-like space is introduced and basic fixed point results have been studied. Useful examples are illustrated to justify the applicability and effectiveness of the results presented herein. As an application, the existence of solution of fourth-order two-point boundary value problems is discussed and rationalized by a numerical example.


2020 ◽  
Vol 70 (4) ◽  
pp. 849-862
Author(s):  
Shagun Banga ◽  
S. Sivaprasad Kumar

AbstractIn this paper, we use the novel idea of incorporating the recently derived formula for the fourth coefficient of Carathéodory functions, in place of the routine triangle inequality to achieve the sharp bounds of the Hankel determinants H3(1) and H2(3) for the well known class 𝓢𝓛* of starlike functions associated with the right lemniscate of Bernoulli. Apart from that the sharp bound of the Zalcman functional: $\begin{array}{} |a_3^2-a_5| \end{array}$ for the class 𝓢𝓛* is also estimated. Further, a couple of interesting results of 𝓢𝓛* are also discussed.


2021 ◽  
Vol 9 (1) ◽  
pp. 53-64
Author(s):  
Vitali Kapovitch ◽  
Alexander Lytchak

Abstract We discuss folklore statements about distance functions in manifolds with two-sided bounded curvature. The topics include regularity, subsets of positive reach and the cut locus.


Sign in / Sign up

Export Citation Format

Share Document