Results 271 to 280 of about 32,179 (312)
Some of the next articles are maybe not open access.
Geodesics and Almost Geodesics Curves
Results in Mathematics, 2018An \textit{almost geodesic} of an affine connection \(\nabla\) on a manifold is a curve \(x(t)\) in the manifold so that \[ \nabla^2_{\dot{x}}\dot{x}=a\nabla_{\dot{x}} \dot{x}+b\dot{x}, \] for some real-valued continuous functions \(a(t)\), \(b(t)\).
Olga Belova +2 more
openaire +3 more sources
Analysis and Applications, 2003
We consider a subRiemannian geometry induced by a step 3 subelliptic partial differential operator in ℝ3. Our main result is the characterization of a canonical submanifold through the origin, all of whose points are connected to the origin by infinitely many (subRiemannian) geodesics.
Greiner, Peter, Calin, Ovidiu
openaire +1 more source
We consider a subRiemannian geometry induced by a step 3 subelliptic partial differential operator in ℝ3. Our main result is the characterization of a canonical submanifold through the origin, all of whose points are connected to the origin by infinitely many (subRiemannian) geodesics.
Greiner, Peter, Calin, Ovidiu
openaire +1 more source
Geodesic as Limit of Geodesics on PL-Surfaces
2008We study the problem of convergence of geodesics on PL-surfaces and in particular on subdivision surfaces. More precisely, if a sequence (Tn)n∈N of PL-surfaces converges in distance and in normals to a smooth surface S and if Cn is a geodesic of Tn (i.e.
André Lieutier, Boris Thibert
openaire +1 more source
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2020
Together with the curse of dimensionality, nonlinear dependencies in large data sets persist as major challenges in data mining tasks. A reliable way to accurately preserve nonlinear structure is to compute geodesic distances between data points. Manifold learning methods, such as Isomap, aim to preserve geodesic distances in a Riemannian manifold ...
Meghana Madhyastha +6 more
openaire +1 more source
Together with the curse of dimensionality, nonlinear dependencies in large data sets persist as major challenges in data mining tasks. A reliable way to accurately preserve nonlinear structure is to compute geodesic distances between data points. Manifold learning methods, such as Isomap, aim to preserve geodesic distances in a Riemannian manifold ...
Meghana Madhyastha +6 more
openaire +1 more source
Geodesic compatibility and integrability of geodesic flows
Journal of Mathematical Physics, 2003We give a natural geometric condition called geodesic compatibility that implies the existence of integrals in involution of the geodesic flow of a pseudo-Riemannian metric. We prove that if two metrics satisfy the condition of geodesic compatibility then we can produce a hierarchy of metrics that also satisfy this condition. A lot of metrics studed in
openaire +1 more source
Synthese, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Journal of Logic and Computation, 2008
The purpose of this article is to introduce a class of distance-based iterated revision operators generated by minimizing the geodesic distance on a graph. Such operators correspond bijectively to metrics and have a simple finite presentation. As distance is generated by distinguishability, our framework is appropriate for modelling contexts where ...
openaire +1 more source
The purpose of this article is to introduce a class of distance-based iterated revision operators generated by minimizing the geodesic distance on a graph. Such operators correspond bijectively to metrics and have a simple finite presentation. As distance is generated by distinguishability, our framework is appropriate for modelling contexts where ...
openaire +1 more source
GEODESICS OF THE SIERPINSKI GASKET
Fractals, 2018In this paper, we examine the number of geodesics between two points of the Sierpinski Gasket ([Formula: see text]) via code representations of the points and as a main result we show that the maximum number of geodesics between different two points with respect to the intrinsic metric on [Formula: see text] is five.
Saltan, Mustafa +2 more
openaire +2 more sources
International Journal of Computer Vision, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vicent Caselles +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vicent Caselles +2 more
openaire +1 more source
Journal of Lie Theory, 2000
In order to apply to the non-associative structures the fundamental ideas of Sophus Lie, namely to assign to any local Lie group \(G\) its tangent object in the identity element -- its Lie algebra -- which determines \(G\) in a unique way, the author studies here a very wide class of geodesic loops with respect to a linear connection the curvature of ...
openaire +2 more sources
In order to apply to the non-associative structures the fundamental ideas of Sophus Lie, namely to assign to any local Lie group \(G\) its tangent object in the identity element -- its Lie algebra -- which determines \(G\) in a unique way, the author studies here a very wide class of geodesic loops with respect to a linear connection the curvature of ...
openaire +2 more sources

