Geodesics on the regular tetrahedron and the cube (Q329550): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Cynthia M. Traub / rank | |||
Property / author | |||
Property / author: Cynthia M. Traub / rank | |||
Normal rank | |||
Property / review text | |||
Given a convex polyhedron \(S\) in \({\mathbb{R}}^3\), a \textit{geodesic} on \(S\) is a curve \(\gamma\) on \(S\) such that for any sufficiently close points \(p\) and \(q\) on \(\gamma\), the shortest path on \(S\) from \(p\) to \(q\) coincides with \(\gamma\). A natural way how to study geodesics on polyhedra is by unfolding the polyhedron into the plane and, if possible, tiling the plane with faces of the polyhedron. In this way, geodesics on \(S\) correspond to straight lines in the plane. In the present paper, the regular tetrahedron and the cube are studied, because their faces give tiling of the plane. For the tetrahedron, geodesics from an arbitrary point to an arbitrary vertex are characterized in terms of corresponding directions. In particular, vertex-to-vertex geodesics are characterized this way. For the cube, vertex-to-vertex geodesics are studied. Depending on the pair of vertices chosen, the number of geodesic differs. Surprisingly, for both the tetrahedron and the cube, there are no geodesics which start and end in the same vertex. | |||
Property / review text: Given a convex polyhedron \(S\) in \({\mathbb{R}}^3\), a \textit{geodesic} on \(S\) is a curve \(\gamma\) on \(S\) such that for any sufficiently close points \(p\) and \(q\) on \(\gamma\), the shortest path on \(S\) from \(p\) to \(q\) coincides with \(\gamma\). A natural way how to study geodesics on polyhedra is by unfolding the polyhedron into the plane and, if possible, tiling the plane with faces of the polyhedron. In this way, geodesics on \(S\) correspond to straight lines in the plane. In the present paper, the regular tetrahedron and the cube are studied, because their faces give tiling of the plane. For the tetrahedron, geodesics from an arbitrary point to an arbitrary vertex are characterized in terms of corresponding directions. In particular, vertex-to-vertex geodesics are characterized this way. For the cube, vertex-to-vertex geodesics are studied. Depending on the pair of vertices chosen, the number of geodesic differs. Surprisingly, for both the tetrahedron and the cube, there are no geodesics which start and end in the same vertex. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Zdeněk Dušek / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52B70 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 53C22 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6642332 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
geodesics on polyhedra | |||
Property / zbMATH Keywords: geodesics on polyhedra / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
regular tetrahedron | |||
Property / zbMATH Keywords: regular tetrahedron / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cube | |||
Property / zbMATH Keywords: cube / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2016.07.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2513684333 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex Polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5427478 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geodesics on regular polyhedra with endpoints at the vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5421078 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Star unfolding convex polyhedra via quasigeodesic loops / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Discrete Geodesic Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The intrinsic diameter of the surface of a parallelepiped / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sets of tetrahedra, defined by maxima of distance functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:36, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Geodesics on the regular tetrahedron and the cube |
scientific article |
Statements
Geodesics on the regular tetrahedron and the cube (English)
0 references
21 October 2016
0 references
Given a convex polyhedron \(S\) in \({\mathbb{R}}^3\), a \textit{geodesic} on \(S\) is a curve \(\gamma\) on \(S\) such that for any sufficiently close points \(p\) and \(q\) on \(\gamma\), the shortest path on \(S\) from \(p\) to \(q\) coincides with \(\gamma\). A natural way how to study geodesics on polyhedra is by unfolding the polyhedron into the plane and, if possible, tiling the plane with faces of the polyhedron. In this way, geodesics on \(S\) correspond to straight lines in the plane. In the present paper, the regular tetrahedron and the cube are studied, because their faces give tiling of the plane. For the tetrahedron, geodesics from an arbitrary point to an arbitrary vertex are characterized in terms of corresponding directions. In particular, vertex-to-vertex geodesics are characterized this way. For the cube, vertex-to-vertex geodesics are studied. Depending on the pair of vertices chosen, the number of geodesic differs. Surprisingly, for both the tetrahedron and the cube, there are no geodesics which start and end in the same vertex.
0 references
geodesics on polyhedra
0 references
regular tetrahedron
0 references
cube
0 references