Related papers: Geodesic intersections
In this paper we survey several intersection and non-intersection phenomena appearing in the realm of symplectic topology. We discuss their implications and finally outline some new relations of the subject to algebraic geometry.
Since edge detection is in the forefront of image processing for object detection, it is crucial to have a good understanding of edge detection algorithms. The reason for this is that edges form the outline of an object. An edge is the…
By "geodesic" we mean any sequence of vertices $(v_1,v_2,...,v_k)$ of a graph $G$ that constitute a shortest path from $v_1$ to $v_k$. We propose a novel, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica)…
We define an evolution of multiple particles on a discrete manifold $G$. Each particle alone moves on geodesics and particles can interact if they are on the same facet. They move deterministically and reversibly on the frame bundle $P$ of…
The solution of the geodesic problem for an oblate ellipsoid is developed in terms of series. Tables are provided to simplify the computation. [This is a transcription of F. W. Bessel, Astronomische Nachrichten 4(86), 241-254 (1825). The…
In well-studied graph modification problems, adding and deleting vertices and edges are used as graph editing operations. We propose a model for graph modification on geometric intersection graphs called Geometric Graph Edit Distance that…
This note is about a type of quantitative density of closed geodesics on closed hyperbolic surfaces. The main results are upper bounds on the length of the shortest closed geodesic that $\varepsilon$-fills the surface.
We investigate local and global properties of timelike geodesics in three static spherically symmetric spacetimes. These properties are of its own mathematical relevance and provide a solution of the physical `twin paradox' problem. The…
In this paper, we present a new method for computing approximate geodesic distances. We introduce the wave method for approximating geodesic distances from a point on a manifold mesh. Our method involves the solution of two linear systems…
Given a surface $\Sigma$ equipped with a set $P$ of marked points, we consider the triangulations of $\Sigma$ with vertex set $P$. The flip-graph of $\Sigma$ whose vertices are these triangulations, and whose edges correspond to flipping…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…
A closed-form solution for the boundary of the flat state of an orthogonal cross section of contiguous surface geometry formed by the intersection of two cylinders of equal radii oriented in dual directions of rotation about their…
We determine explicit formulas for geodesics (in the Euclidean metric) in the configuration space of ordered pairs (x,x') of points in R^n which satisfy d(x,x')>=epsilon. We interpret this as two or three (depending on the parity of n)…
Several physical problems such as the `twin paradox' in curved spacetimes have purely geometrical nature and may be reduced to studying properties of bundles of timelike geodesics. The paper is a general introduction to systematic…
Intersection algorithms are very important in computation of geometrical problems. Algorithms for a line intersection with linear or quadratic surfaces are quite efficient. However, algorithms for a line intersection with other surfaces are…
Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
Solving the so-called geodesic endpoint problem, i.e., finding a geodesic that connects two given points on a manifold, is at the basis of virtually all data processing operations, including averaging, clustering, interpolation and…
Circular and radial geodesics are studied in the spacetime described by the $\gamma$ metric. Their behaviour is compared with the spherically symmetric situation, bringing out the sensitivity of the trajectories to deviations from spherical…