English
Related papers

Related papers: Finding Weakly Simple Closed Quasigeodesics on Pol…

200 papers

In this paper, we propose new basis functions defined on curved sides or faces of curvilinear elements (polygons or polyhedrons with curved sides or faces) for the weak Galerkin finite element method. Those basis functions are constructed…

Numerical Analysis · Mathematics 2023-09-12 Qingguang Guan , Gillian Queisser , Wenju Zhao

In this paper, we establish a sufficient condition for a geodesic in a Riemannian manifold to be homogeneous, i.e. an orbit of an $1$-parameter isometry group. As an application of this result, we provide a new proof of the fact that every…

Differential Geometry · Mathematics 2019-04-22 V. N. Berestovskii , Yu. G. Nikonorov

In this work we solve a couple of well known open problems related to the quasihyperbolic metric. In the case of planar domains, our first main result states that quasihyperbolic geodesics are unique in simply connected domains. As the…

Metric Geometry · Mathematics 2015-04-09 Hannes Luiro

The purpose of this paper is the formal verification of a counterexample of Santos et al. to the so-called Hirsch Conjecture on the diameter of polytopes (bounded convex polyhedra). In contrast with the pen-and-paper proof, our approach is…

Logic in Computer Science · Computer Science 2023-01-11 Xavier Allamigeon , Quentin Canu , Pierre-Yves Strub

In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…

Optimization and Control · Mathematics 2024-02-06 Alberto Del Pia

Algorithms for minimal enclosing ball problems are often geometric in nature. To highlight the metric ingredients underlying their efficiency, we focus here on a particularly simple geodesic-based method. A recent subgradient-based study…

Optimization and Control · Mathematics 2026-04-08 Ariel Goodwin , Adrian S. Lewis

In [B.Gruenbaum, G.C. Shephard, Spherical tilings with transitivity properties, in: The geometric vein, Springer, New York, 1981, pp. 65-98], they proved "for every spherical normal tiling by congruent tiles, if it is isohedral, then the…

Metric Geometry · Mathematics 2013-12-12 Yohji Akama , Yudai Sakano

The classic Lusternik--Schnirelmann theorem states that there are three distinct simple periodic geodesics on any Riemannian 2-sphere $M$. It has been proven by Y. Liokumovich, A. Nabutovsky and R. Rotman that the shortest three such curves…

Differential Geometry · Mathematics 2025-11-13 Isabel Beach

This article deals with the set of closed geodesics on complete finite type hyperbolic surfaces. For any non-negative integer $k$, we consider the set of closed geodesics that self-intersect at least $k$ times, and investigate those of…

Geometric Topology · Mathematics 2019-12-23 Thi Hanh Vo

We show that the shortest closed geodesic on a 2-sphere with non-negative curvature has length bounded above by three times the diameter. We prove a new isoperimetric inequality for 2-spheres with pinched curvature; this allows us to…

Differential Geometry · Mathematics 2021-09-08 Ian Adelstein , Franco Vargas Pallete

A convex polyhedron is called monostable if it can rest in stable position only on one of its faces. The aim of this paper is to investigate three questions of Conway, regarding monostable polyhedra, which first appeared in a 1969 paper of…

Metric Geometry · Mathematics 2021-03-19 Zsolt Lángi

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…

Computational Geometry · Computer Science 2017-09-19 Siamak Yousefi , Xiao-Wen Chang , Henk Wymeersch , Benoit Champagne , Godfried Toussaint

This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.

Computational Geometry · Computer Science 2012-10-23 Anil Maheshwari , Stefanie Wuhrer

Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…

Computational Geometry · Computer Science 2021-07-02 David Eppstein

We derive local boundedness estimates for weak solutions of a large class of second order quasilinear equations. The structural assumptions imposed on an equation in the class allow vanishing of the quadratic form associated with its…

Analysis of PDEs · Mathematics 2011-06-24 Dario D. Monticelli , Scott Rodney , Richard L. Wheeden

The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time $O(\log n)$-approximation algorithm for placing as few guards as possible at vertices of a simple $n$-gon $P$, such…

Computational Geometry · Computer Science 2019-07-03 Stav Ashur , Omrit Filtser , Matthew J. Katz

Duality principle for approximation of geometrical objects (also known as Eudoxus exhaustion method) was extended and perfected by Archimedes in his famous tractate "Measurement of circle". The main idea of the approximation method by…

Differential Geometry · Mathematics 2008-11-10 V. A. Garanzha

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

Geometric Topology · Mathematics 2007-05-23 William P. Thurston

The quasi-potential is a key concept of the Large Deviation Theory for Stochastic Differential Equations (SDEs). Once the quasi-potential with respect to an attractor of the corresponding deterministic system is found, one can readily…

Probability · Mathematics 2018-01-08 M. K. Cameron

Generalizing the framework of an ultra-weak formulation for a hypersingular integral equation on closed polygons in [N. Heuer, F. Pinochet, arXiv 1309.1697 (to appear in SIAM J. Numer. Anal.)], we study the case of a hypersingular integral…

Numerical Analysis · Mathematics 2014-08-25 Norbert Heuer , Michael Karkulik