მანძილი: განსხვავება გადახედვებს შორის

[შეუმოწმებელი ვერსია][შეუმოწმებელი ვერსია]
შიგთავსი ამოიშალა შიგთავსი დაემატა
ხაზი 61:
</center>
Here <math>\vec{r}(t)</math> is the trajectory (path) between the two points. The value of the integral (D) represents the length of this trajectory. The distance is the minimal value of this integral and is obtained when <math>r = r^{*}</math> where <math>r^{*}</math> is the optimal trajectory. In the familiar Euclidean case (the above integral) this optimal trajectory is simply a straight line. It is well known that the shortest path between two points is a straight line. Straight lines can formally be obtained by solving the [[Euler-Lagrange equations]] for the above [[functional (mathematics)|functional]]. In [[non-Euclidean geometry|non-Euclidean]] manifolds (curved spaces) where the nature of the space is represented by a [[metric (mathematics)|metric]] <math>g_{ab}</math> the integrand has be to modified to <math>\sqrt{g^{ac}\dot{r}_{c}g_{ab}\dot{r}^{b}}</math>, where [[Einstein summation convention]] has been used.
 
=== Algebraic distance ===
{{Expand section|date=December 2008}}
The '''algebraic distance''' is a metric often used in [[computer vision]] that that can be minimized by [[least squares]] estimation. [http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL_COPIES/FISHER/ALGDIST/alg.htm][http://homepages.inf.ed.ac.uk/rbf/CVonline/LOCAL_COPIES/FISHER/CIRCLEFIT/fit2dcircle/node3.html] For curves or surfaces given by the equation <math>x^T C x=0</math> (such as a [[Conic#Homogeneous coordinates|conic in homogeneous coordinates]]), the algebraic distance from the point <math>x'</math> to the curve is simply <math>x'^T C x'</math>.
It may serve as an "initial guess" for [[geometric distance]] to refine estimations of the curve by more accurate methods, such as [[non-linear least squares]].
 
===General case===
მოძიებულია „https://ka.wikipedia.org/wiki/მანძილი“-დან