Related papers: Census of bounded curvature paths
This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space…
Let $G=(V,E)$ be a finite, combinatorial graph. We define a notion of curvature on the vertices $V$ via the inverse of the resistance distance matrix. We prove that this notion of curvature has a number of desirable properties. Graphs with…
As a continuation of \cite{NSY:local}, we mainly discuss the global structure of two-dimensional locally compact geodesically complete metric spaces with curvature bounded above. We first obtain the result on the Lipschitz homotopy…
Continuum robots are typically slender and flexible with infinite freedoms in theory, which poses a challenge for their control and application. The shape sensing of continuum robots is vital to realise accuracy control. This letter…
In this paper, we classify the class of constant weighted curvature curves in the plane with a log-linear density, or in other words, classify all traveling curved fronts with a constant forcing term in $\Bbb R^2.$ The classification gives…
This final degree project is devoted to study the topological classification of complex plane curves. These are subsets of $\mathbb{C}^2$ that can be described by an equation $f(x,y)=0$. Loosely speaking, curves are said to be equivalent in…
In the context of a quantum critical spin chain whose low energy physics corresponds to a conformal field theory (CFT), it was recently demonstrated [A. Milsted G. Vidal, arXiv:1805.12524] that certain classes of tensor networks used for…
A horoboundary is one of the attempts to compactify metric spaces, and is constructed using continuous functions on metric spaces. It is a concept that includes global information of metric spaces, and its correspondence with an ideal…
Recent research on graph embedding has achieved success in various applications. Most graph embedding methods preserve the proximity in a graph into a manifold in an embedding space. We argue an important but neglected problem about this…
Embedding diagrams have been used extensively to visualize the properties of curved space in Relativity. We introduce a new kind of embedding diagram based on the {\it extrinsic} curvature (instead of the intrinsic curvature). Such an…
The curvature discussed in this paper is a rather far going generalization of the Riemannian sectional curvature. We define it for a wide class of optimal control problems: a unified framework including geometric structures such as…
Persistent homology provides information about the lifetime of homology classes along a filtration of cell complexes. Persistence barcode is a graphical representation of such information. A filtration might be determined by time in a set…
The central curve of a linear program is an algebraic curve specified by linear and quadratic constraints arising from complementary slackness. It is the union of the various central paths for minimizing or maximizing the cost function over…
Suppose $C$ is a compact, $n$-edged two-cell of the centered dual decomposition of a locally finite set in the hyperbolic plane, a coarsening of the Delaunay tessellation which was introduced in the author's prior work. We describe an…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
A geometric graph is a graph embedded in the plane with vertices at points and edges drawn as curves (which are usually straight line segments) between those points. The average transversal complexity of a geometric graph is the number of…
This work presents a new path classification criterion to distinguish paths geometrically and topologically from the workspace, which is divided through cell decomposition, generating a medial-axis-like skeleton structure. We use this…
This article deals with the modeling for an individual car path through a road network, where the dynamics is driven by a coupled system of ordinary and partial differential equations. The network is characterized by bounded buffers at…
The theory of linear transports along paths in vector bundles, generalizing the parallel transports generated by linear connections, is developed. The normal frames for them are defined as ones in which their matrices are the identity…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…