Related papers: An introduction to geodesics: the shortest distanc…
We consider planar quadrangulations with three marked vertices and discuss the geometry of triangles made of three geodesic paths joining them. We also study the geometry of minimal separating loops, i.e. paths of minimal length among all…
The search is based on the preliminary transformation of matrices or adjacency lists traditionally used in the study of graphs into projections cleared of redundant information (refined) followed by the selection of the desired shortest…
In practical purposes for some geometrical problems in computer science we have as information the coordinates of some finite points in surface instead of the whole body of a surface. The problem arised here is: "How to define a distance…
We provide a self-contained geometric description of the geodesic flow in the three-dimensional Lie group $\mathrm{Sol}$, one of Thurston's eight model geometries. The geometry of geodesics is governed by a single invariant $k\in[0,1]$, its…
Distance transformation is an image processing technique used for many different applications. Related to a binary image, the general idea is to determine the distance of all background points to the nearest object point (or vice versa). In…
This paper presents the results of a computational study related to the path-geodesic correspondence in causal sets. For intervals in flat spacetimes, and in selected curved spacetimes, we present evidence that the longest maximal chains…
This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…
In this work, we study the cellular decomposition of $S$ induced by a filling pair of curves $v$ and $w$, $Dec_{v,w}(S) = S - (v \cup w)$, and its connection to the distance function $d(v,w)$ in the curve graph of a closed orientable…
Simplification is one of the fundamental operations used in geoinformation science (GIS) to reduce size or representation complexity of geometric objects. Although different simplification methods can be applied depending on one's purpose,…
In this paper, we consider enumeration of geodesics on a polyhedron, where a geodesic means locally-shortest path between two points. Particularly, we consider the following preprocessing problem: given a point $s$ on a polyhedral surface…
We consider the problem of determining the length of the shortest paths between points on the surfaces of tetrahedra and cubes. Our approach parallels the concept of Alexandrov's star unfolding but focuses on specific polyhedra and uses…
This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…
In this paper, we study the characterization of geodesics for a class of distances between probability measures introduced by Dolbeault, Nazaret and Savar e. We first prove the existence of a potential function and then give necessary and…
Surfaces and curves play an important role in geometric design. In recent years, problem of finding a surface passing through a given curve have attracted much interest. In the present paper, we propose a new method to construct a surface…
Riemann surfaces are among the simplest and most basic geometric objects. They appear as key players in many branches of physics, mathematics, and other sciences. Despite their widespread significance, how to compute distances between pairs…
Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…
Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…
These are lecture notes for the course "MATS4120 Geometry of geodesics" given at the University of Jyv\"askyl\"a in Spring 2020. Basic differential geometry or Riemannian geometry is useful background but is not strictly necessary. Exercise…
We introduce a novel representation and optimization framework for discrete geodesics on triangle meshes that reduces artifacts of linear methods on uneven and coarse discretizations. Our method computes squared geodesic distances from…
In this paper we study the notion of geodesic curvature of smooth horizontal curves parametrized by arc lenght in the Heisenberg group, that is the simplest sub-Riemannian structure. Our goal is to give a metric interpretation of this…