APPROXIMATION OF THE DISTANCE IN THE PLANE THROUGH THE NUMERICAL SOLUTION OF INITIAL VALUE PROBLEMS ASSOCIATED TO GEODESICS
In this paper, we proposes an algorithm to approximate the Euclidean distance between points of plane, by doing a search of geodesic that depart from the point and arrive to a neighborhood of the point . This search is done through the numerical solution of initial value problems associated with the...
Main Author: | Franco Rubio López |
---|---|
Format: | Article |
Language: | Spanish |
Published: |
Universidad Nacional de Trujillo
2015-12-01
|
Series: | Selecciones Matemáticas |
Subjects: | |
Online Access: | http://revistas.unitru.edu.pe/index.php/SSMM/article/view/1241/1139 |
Similar Items
-
APPROXIMATION OF THE DISTANCE IN THE SPHERE THROUGH OF THE NUMERICAL SOLUTION OF INITIAL VALUE PROBLEM ASSOCIATED TO GEODESICS
by: Franco Rubio, et al.
Published: (2016-12-01) -
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces
by: Wang, Xiaoning, et al.
Published: (2018) -
GEODESIC DISTRIBUTION IN GRAPH THEORY: KULLBACK-LEIBLER-SYMMETRIC
by: José Alejandro González, et al.
Published: (2014-07-01) -
Superpixel Segmentation by Forgetting Geodesic Distance
by: Bing Luo, et al.
Published: (2020-01-01) -
Modified Kernel Functions by Geodesic Distance
by: Yong Quan, et al.
Published: (2004-01-01)