English
Related papers

Related papers: Finding Closed Quasigeodesics on Convex Polyhedra

200 papers

In this paper, we consider enumeration of geodesics on a polyhedron, where a geodesic means locally-shortest path between two points. Particularly, we consider the following preprocessing problem: given a point $s$ on a polyhedral surface…

Computational Geometry · Computer Science 2023-12-27 Kazuma Tateiri

Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Given a polygon $P$, for two points $s$ and $t$ contained in the polygon, their \emph{geodesic distance} is the length of the shortest $st$-path within $P$. A \emph{geodesic disk} of radius $r$ centered at a point $v \in P$ is the set of…

Computational Geometry · Computer Science 2013-11-26 Ivo Vigan

We consider triangle faced convex polyhedra inscribed in the unit sphere $S^2$ in ${\Bbb{R}}^3$. One way of measuring their deviation from regular polyhedra with triangular faces is to consider the quotient of the lengths of the longest and…

Metric Geometry · Mathematics 2019-09-09 E. Makai,

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

Computational Geometry · Computer Science 2009-09-29 Marc Glisse , Sylvain Lazard

A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…

Metric Geometry · Mathematics 2024-03-25 Markus Ausserhofer , Susanna Dann , Zsolt Lángi , Géza Tóth

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

In this paper we prove some geometric inequalities for closed surfaces in Euclidean three-space. Motivated by Gage's inequality for convex curves, we first verify that for convex surfaces the Willmore energy is bounded below by some…

Differential Geometry · Mathematics 2021-08-13 Tatsuya Miura

We show that closed surfaces with minimal total absolute curvature in Cartan-Hadamard 3-manifolds bound flat convex bodies. This generalizes Chern-Lashof's theorem for surfaces in Euclidean space and solves a problem posed by Gromov in…

Differential Geometry · Mathematics 2026-04-29 Mohammad Ghomi , Joseph Ansel Hoisington , Matteo Raffaelli , John Ioannis Stavroulakis

Given a convex polyhedral surface P, we define a tailoring as excising from P a simple polygonal domain that contains one vertex v, and whose boundary can be sutured closed to a new convex polyhedron via Alexandrov's Gluing Theorem. In…

Metric Geometry · Mathematics 2022-05-24 Joseph O'Rourke , Costin Vilcu

The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…

Computational Geometry · Computer Science 2026-04-21 Omrit Filtser , Tzalik Maimon , Ofir Yomtovyan

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $L/k$, where $L$ is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show…

Differential Geometry · Mathematics 2019-09-23 Ian Adelstein , Adam Fong

Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…

Algebraic Geometry · Mathematics 2024-10-15 Claus Scheiderer

Let G be a graph that may be drawn in the plane in such a way that all internal faces are centrally symmetric convex polygons. We show how to find a drawing of this type that maximizes the angular resolution of the drawing, the minimum…

Data Structures and Algorithms · Computer Science 2009-08-03 David Eppstein , Kevin A. Wortman

We consider the problem of finding embedded closed geodesics on the two-sphere with an incomplete metric defined outside a point. Various techniques including curve shortening methods are used.

Geometric Topology · Mathematics 2007-05-23 Paul Norbury , J. Hyam Rubinstein

Almost-Fuchsian manifold is a class of complete hyperbolic three manifolds. Such a three-manifold is a quasi-Fuchsian manifold which contains a closed incompressible minimal surface with principal curvatures everywhere in the range of (-1,…

Differential Geometry · Mathematics 2013-05-09 Zheng Huang , Biao Wang

We prove that, if a closed geodesic $\Gamma$ on a complete finite type hyperbolic surface has at least 2 self-intersections, then the length of $\Gamma$ has an lower bound $2\log(5+2\sqrt6)$, and the lower bound is sharp, attained on a…

Geometric Topology · Mathematics 2025-10-02 Wujie Shen

In this paper, we prove that if a quasi-Fuchsian 3-manifold $M$ contains a simple closed geodesic with complex length $\Lscr=l+i\theta$ such that $\theta/l\gg{}1$, then it contains at least two minimal surfaces which are incompressible in…

Differential Geometry · Mathematics 2009-03-31 Biao Wang

Given a set $\mathcal{P}$ of $h$ pairwise disjoint simple polygonal obstacles in $\mathbb{R}^2$ defined with $n$ vertices, we compute a sketch $\Omega$ of $\mathcal{P}$ whose size is independent of $n$, depending only on $h$ and the input…

Computational Geometry · Computer Science 2019-09-17 R Inkulu , Sanjiv Kapoor

Given a polygonal curve P, a pointset S, and an \epsilon > 0, we study the problem of finding a polygonal curve Q whose vertices are from S and has a Frechet distance less or equal to \epsilon to curve P. In this problem, Q must visit every…

Computational Geometry · Computer Science 2012-11-20 Anil Maheshwari , Jörg-Rüdiger Sack , Kaveh Shahbaz