English
Related papers

Related papers: Curve Closest to Sphere

200 papers

We prove the following results: (1) For every generic closed smooth curve in $\mathbb{R}^3$ there is a point with at least $6$ emanating normals to the curve. (2) For every generic closed piecewise linear curve in $\mathbb{R}^3$ there is a…

Differential Geometry · Mathematics 2026-03-02 Gaiane Panina , Dirk Siersma

In order to detect salient lines in spherical images, we consider the problem of minimizing the functional $\int \limits_0^l C(\gamma(s)) \sqrt{\xi^2 + k_g^2(s)} \, {\rm d}s$ for a curve $\gamma$ on a sphere with fixed boundary points and…

Optimization and Control · Mathematics 2017-03-27 A. Mashtakov , R. Duits , Yu. Sachkov , E. J. Bekkers , I. Beschastnyi

The reductivity of a spherical curve is the minimal number of a local transformation called an inverse-half-twisted splice required to obtain a reducible spherical curve from the spherical curve. It is unknown if there exists a spherical…

Geometric Topology · Mathematics 2018-10-12 Kenji Kashiwabara , Ayaka Shimizu

We show that any general semilinear elliptic problem with Dirichlet or Neumann boundary conditions in an annulus A in R^2m ;m >1, invariant by the action of a certain symmetry group can be reduced to a nonhomogenous similar problem in an…

Analysis of PDEs · Mathematics 2014-04-02 Filomena Pacella , P. N. Srikanth

Define the 1-handle stabilization distance between two surfaces properly embedded in a fixed 4-dimensional manifold to be the minimal number of 1-handle stabilizations necessary for the surfaces to become ambiently isotopic. For every…

Geometric Topology · Mathematics 2020-07-28 Allison N. Miller , Mark Powell

Let $C\subset \mathbb{S}^2$ be a spherical convex body of constant width $\tau$. It is known that (i) if $\tau<\pi/2$ then for any $\varepsilon>0$ there exists a spherical convex body $C_\varepsilon$ of constant width $\tau$ whose boundary…

Metric Geometry · Mathematics 2025-04-01 Huhe Han

The Clifford tori in the 3-sphere are a one-parameter family of flat, two-dimensional, constant mean curvature (CMC) surfaces. This paper demonstrates that new, topologically non-trivial CMC surfaces resembling a pair of neighbouring…

Differential Geometry · Mathematics 2007-05-23 Adrian Butscher , Frank Pacard

The Willmore Problem seeks the surface in $\mathbb S^3\subset\mathbb R^4$ of a given topological type minimizing the squared-mean-curvature energy $W = \int |\mathbf{H}_{\mathbb{R}^4}|^2 = \operatorname{area} + \int H_{\mathbb{S}^3}^2$. The…

Differential Geometry · Mathematics 2021-10-22 Rob Kusner , Peng Wang

In this article, we prove that there exists a unique perimeter minimizer among all piecewise smooth simple closed curves in $M_{\kappa}^2$ enclosing area $A > 0$ $(A \leq 2{\pi}$ if ${\kappa} = 1)$, and it is a circle in $M_{\kappa}^2$ of…

Differential Geometry · Mathematics 2024-08-27 A R Aithal , Anisa M H Chorwadwala

A tetrahedral curve is a space curve whose defining ideal is an intersection of powers of monomial prime ideals of height two. It is supported on a tetrahedral configuration of lines. Schwartau described when certain such curves are ACM,…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Uwe Nagel

In this paper, we study stable constant mean curvature $H$ surfaces in $\R^3$. We prove that, in such a surface, the distance from a point to the boundary is less that $\pi/(2H)$. This upper-bound is optimal and is extended to stable…

Differential Geometry · Mathematics 2008-09-29 Laurent Mazet

The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…

Differential Geometry · Mathematics 2026-04-07 Xuyan Liu

We present a new technique for efficiently removing almost all short cycles in a graph without unintentionally removing its triangles. Consequently, triangle finding problems do not become easy even in almost $k$-cycle free graphs, for any…

Data Structures and Algorithms · Computer Science 2022-10-18 Amir Abboud , Karl Bringmann , Seri Khoury , Or Zamir

In this paper, we prove, using only elementary geometric arguments and only assuming that the curves are continuous, that the geodesics on a sphere are the minor arcs of the great circles. Our result are valid for any sphere in any inner…

General Mathematics · Mathematics 2025-01-07 Mauro Patrão

We study points of moderately low degree on a curve $C$ over a number field, which is embedded on a nice toric surface $S$. Recently, Smith and Vogt related the linear equivalence classes of such points to intersections of $C$ with curves…

Algebraic Geometry · Mathematics 2025-08-07 Eden Granot

In mathematics curves are typically defined as the images of continuous real functions (parametrizations) defined on a closed interval. They can also be defined as connected one-dimensional compact subsets of points. For simple curves of…

Computational Geometry · Computer Science 2015-07-01 Xizhong Zheng , Robert Rettinger

The round Taylor method uses rational arithmetic, allowing control of both round-off and truncation errors in approximating solutions of differential equations. In this paper, we employ this method together with the Poincare-Miranda theorem…

Differential Geometry · Mathematics 2025-06-25 Oscar Perdomo

We provide a new angle and obtain new results on a class of metrics on length-normalized curves in $d$ dimensions, represented by their unit tangents expressed as a function of arc-length, which are functions from the unit interval to the…

Differential Geometry · Mathematics 2019-10-08 Laurent Younes

Let $P$ be a polygonal curve in $\mathbb{R}^d$ of length $n$, and $S$ be a point-set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that the Fr\'echet distance from $P$ is less than a…

Computational Geometry · Computer Science 2014-04-21 Paul Accisano , Alper Üngör

Let $P$ be a polygonal curve in $\mathbb{R}^D$ of length $n$, and $S$ be a point set of size $k$. The Curve/Point Set Matching problem consists of finding a polygonal curve $Q$ on $S$ such that its Fr\'echet distance from $P$ is less than a…

Computational Geometry · Computer Science 2014-05-06 Paul Accisano , Alper Üngör