English
Related papers

Related papers: Minimal Paths on Some Simple Surfaces with Singula…

200 papers

In this paper, we introduced a novel approach to computing the fewest-turn map directions or routes based on the concept of natural roads. Natural roads are joined road segments that perceptually constitute good continuity. This approach…

Computational Geometry · Computer Science 2013-07-17 Bin Jiang , Xintao Liu

In this article we introduce a definition of topological minimal sets, which is a generalization of that of Mumford-Shah-minimal sets. We prove some general properties as well as two existence theorems for topological minimal sets. As an…

Classical Analysis and ODEs · Mathematics 2011-03-22 Xiangyu Liang

We discuss the global regularity of 2 dimensional minimal sets that are near a union of two planes, and prove that every global minimal set in R^4 that looks like a union of two almost orthogonal planes at infinity is a cone. The main point…

Classical Analysis and ODEs · Mathematics 2012-05-15 Xiangyu Liang

We study configurations of immersed curves in surfaces and surfaces in 3-manifolds. Among other results, we show that primitive curves have only finitely many configurations which minimize the number of double points. We give examples of…

Geometric Topology · Mathematics 2007-05-23 Joel Hass , Peter Scott

We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…

Combinatorics · Mathematics 2025-11-14 Erica Flapan , Hugh Howards

We study the problem of finding the shortest path with increasing chords in a simple polygon. A path has increasing chords if and only if for any points a, b, c, and d that lie on the path in that order, |ad| >= |bc|. In this paper we show…

Computational Geometry · Computer Science 2022-02-25 Mart Hagedoorn , Irina Kostitsyna

In this note, we construct nine families of projective complex minimal surfaces of general type having the canonical map of degree 8 and irregularity 0 or 1. For six of these families the canonical system has a non trivial fixed part.

Algebraic Geometry · Mathematics 2019-08-30 Nguyen Bin

We study minimum degree conditions under which a graph $G$ contains $k$th powers of paths and cycles of arbitrary specified lengths. We determine precise thresholds, assuming that the order of $G$ is large. This extends a result of Allen,…

Combinatorics · Mathematics 2023-06-05 Eng Keat Hng

In this paper, we consider complete non-catenoidal minimal surfaces of finite total curvature with two ends. A family of such minimal surfaces with least total absolute curvature is given. Moreover, we obtain a uniqueness theorem for this…

Differential Geometry · Mathematics 2016-03-09 Shoichi Fujimori , Toshihiro Shoda

For a graph $G$, an edge-separating (resp. vertex-separating) path system of $G$ is a family of paths in $G$ such that for any pair of edges $e_1, e_2$ (resp. pair of vertices $v_1, v_2$) of $G$ there is at least one path in the family that…

Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry processing, scientific computing, computer graphics, and…

Graphics · Computer Science 2020-07-22 Keenan Crane , Marco Livesu , Enrico Puppo , Yipeng Qin

The shortest path problem is related to many dynamic processes on networks, ranging from routing in communication networks to signaling in molecular interaction networks. When the network is fully known, the shortest path problem can be…

Physics and Society · Physics 2026-02-05 Zhihao Qiu , Sámuel G. Balogh , Xinhan Liu , Piet Van Mieghem , Maksim Kitsak

We classify the minimal surfaces of general type with $K^2 \leq 4\chi-8$ whose canonical map is composed with a pencil, up to a finite number of families. More precisely we prove that there is exactly one irreducible family for each value…

Algebraic Geometry · Mathematics 2010-10-28 Roberto Pignatelli

A graph is an apex graph if it contains a vertex whose deletion leaves a planar graph. The family of apex graphs is minor-closed and so it is characterized by a finite list of minor-minimal non-members. The long-standing problem of…

Combinatorics · Mathematics 2021-11-29 Adam S. Jobson , André E. Kézdy

Minimal surfaces and Einstein manifolds are among the most natural structures in differential geometry. Whilst minimal surfaces are well understood, Einstein manifolds remain far less so. This exposition synthesises together a set of…

Differential Geometry · Mathematics 2025-08-19 Mia Beard

We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…

Combinatorics · Mathematics 2009-05-20 Kari Ragnarsson , Bridget Eileen Tenner

A well-known Lemma in Riemannian geometry by Klingenberg says that if $x_0$ is a minimum point of the distance function $d(p,\cdot)$ to $p$ in the cut locus $C_p$ of $p$, then either there is a minimal geodesic from $p$ to $x_0$ along which…

Differential Geometry · Mathematics 2017-01-18 Shicheng Xu

We study arrangements of geodesic arcs on a sphere, where all arcs are internally disjoint and each arc has its endpoints located within the interior of other arcs. We establish fundamental results concerning the minimum number of arcs in…

Combinatorics · Mathematics 2024-04-05 Giovanni Viglietta

We determine which connected surfaces can be partitioned into topological circles. There are exactly seven such surfaces up to homeomorphism: those of finite type, of Euler characteristic zero, and with compact boundary components. As a…

General Topology · Mathematics 2011-01-04 Gábor Moussong , Nándor Simányi

A connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is…

Data Structures and Algorithms · Computer Science 2021-01-19 Dariusz Dereniowski , Dorota Osula , Paweł Rzążewski