相关论文: Total curvature and spiralling shortest paths

A Dubins path is a shortest path with bounded curvature. The seminal result in non-holonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another…

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

In this paper, we consider the mean curvature flow of convex hypersurfaces in Euclidean spaces with a general forcing term. We show that the flow may shrink to a point in finite time if the forcing term is small, or exist for all times and…

A bounded curvature path is a continuously differentiable piece-wise $C^2$ path with bounded absolute curvature connecting two points in the tangent bundle of a surface. These paths have been widely considered in computer science and…

In this work, we propose a novel and efficient method for smoothing polylines in motion planning tasks. The algorithm applies to motion planning of vehicles with bounded curvature. In the paper, we show that the generated path: 1) has…

The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…

For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error…

It is known that any two triangulations of a compact 3-manifold are related by finite sequences of certain local transformations. We prove here an upper bound for the length of a shortest transformation sequence relating any two…

Given a smooth simply connected planar domain, the area is bounded away from zero in terms of the maximal curvature alone. We show that in higher dimensions this is not true, and for a given maximal mean curvature we provide smooth…

We study Forman--Ricci and effective resistance curvatures on the skeleta of convex polytopes. Our guiding questions are: how frequently do polytopal graphs exhibit everywhere positive curvature, and what structural constraints does…

The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between two vertices of $P$, where the path uses the edges of $P$ only. In contrast to the combinatorial diameter, the circuit diameter of $P$ is defined…

The (combinatorial) diameter of a polytope $P \subseteq \mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of…

We prove that for every metric on the torus with curvature bounded from below by -1 in the sense of Alexandrov there exists a hyperbolic cusp with convex boundary such that the induced metric on the boundary is the given metric. The proof…

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

Closed billiard trajectories in a polygon in the hyperbolic plane can be coded by the order in which they hit the sides of the polygon. In this paper, we consider the average length of cyclically related closed billiard trajectories in…

We consider a convex Euclidean hypersurface that evolves by a volume or area preserving flow with speed given by a general nonhomogeneous function of the mean curvature. For a broad class of possible speed functions, we show that any closed…

We establish a curvature estimate for classical minimal surfaces with total boundary curvature less than 4\pi. The main application is a bound on the genus of these surfaces depending solely on the geometry of the boundary curve. We also…