English
Related papers

Related papers: Every Tetrahedron has a 3-vertex Quasigeodesic

200 papers

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

We discuss the existence of the angle between two curves in Teichm\"uller spaces and show that, in any infinite dimensional Teichm\"uller space, there exist infinitely many geodesic triangles each of which has the same three vertices and…

Complex Variables · Mathematics 2015-06-29 Yun Hu , Yuliang Shen

We prove that each lower-dimensional face of a quasi-arithmetic Coxeter polytope, which happens to be itself a Coxeter polytope, is also quasi-arithmetic. We also provide a sufficient condition for a codimension $1$ face to be actually…

Geometric Topology · Mathematics 2020-11-03 Nikolay Bogachev , Alexander Kolpakov

This note establishes that every polyhedron that has a Hamiltonian quasigeodesic can be edge-unfolded to a net, and shows that the class of such polyhedra is infinite.

Computational Geometry · Computer Science 2025-06-24 Joseph O'Rourke

The icosidodecahedron has 30 vertices, one at the center of each edge of a regular icosahedron -- or equivalently, one at the center of each edge of a regular dodecahedron. It is a beautiful, highly symmetrical shape. But it is just a…

Combinatorics · Mathematics 2023-09-28 John C. Baez

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 study a polyhedron with $n$ vertices of fixed volume having minimum surface area. Completing the proof of Fejes Toth, we show that all faces of a minimum polyhedron are triangles, and further prove that a minimum polyhedron does not…

Metric Geometry · Mathematics 2020-12-21 Shigeki Akiyama

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke

In this note we characterize all regular tetrahedra whose vertices in R^3 have integer coordinates. The main result is a consequence of the characterization of all equilateral triangles having integer coordinates contained in previous work.…

Number Theory · Mathematics 2007-12-31 Eugen J. Ionascu

In 1958, S. \'Swierczkowski proved that there cannot be a closed loop of congruent interior-disjoint regular tetrahedra that meet face-to-face. Such closed loops do exist for the other four regular polyhedra. It has been conjectured that,…

Metric Geometry · Mathematics 2016-11-09 Michael Elgersma , Stan Wagon

We introduce the tetrahedron trinomial coefficient transform which takes a Pascal-like arithmetical triangle to a sequence. We define a Pascal-like infinite tetrahedron H, and prove that the application of the tetrahedron trinomial…

Combinatorics · Mathematics 2021-04-01 László Németh

This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…

Metric Geometry · Mathematics 2019-08-16 J. Richard Gott

In this paper we present a necessary conditions, that simple close geodesics on regular tetrahedra in the 3-dimensional hyperbolic space must satisfy. Furthermore, we explicitly describe three classes of simple closed geodesics on regular…

Metric Geometry · Mathematics 2026-05-07 A. A. Borisenko , D. D. Sukhorebska

Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of…

Metric Geometry · Mathematics 2022-03-21 Benjamin Matschke

A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…

Differential Geometry · Mathematics 2022-06-08 Ian M Adelstein , Benjamin Schmidt

A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in which every tetrahedron and every triangle contains its circumcenter in its interior. Such meshes have applications in scientific computing and…

Computational Geometry · Computer Science 2008-08-06 Evan VanderZee , Anil N. Hirani , Damrong Guoy

We prove Calegari's conjecture that every quasigeodesic flow on a closed hyperbolic 3-manifold has closed orbits.

Geometric Topology · Mathematics 2017-11-29 Steven Frankel

We study the trigonometry of non-Euclidean tetrahedra using tools from algebraic geometry. We establish a bijection between non-Euclidean tetrahedra and certain rational elliptic surfaces. We interpret the edge lengths and the dihedral…

Algebraic Geometry · Mathematics 2021-06-08 Daniil Rudenko

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

Computational Geometry · Computer Science 2019-12-04 Seri Nishimoto , Takashi Horiyama , Tomohiro Tachi

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

Metric Geometry · Mathematics 2014-03-04 Egon Schulte