Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra
Closed locally minimal networks can be viewed as “branching” closed geodesics. We study such networks on the surfaces of convex polyhedra and discuss the problem of describing the set of all convex polyhedra that have such networks. A closed locally minimal network on a convex polyhedron is an embed...
Main Author: | N. P. Strelkova |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2013-10-01
|
Series: | Моделирование и анализ информационных систем |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/178 |
Similar Items
-
Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra
by: N. P. Strelkova
Published: (2013-01-01) -
COMPUTER-ASSISTED DETERMINATION OF THE DEVELOPMENTS OF POLYHEDRA AND INTERSECTION POLYGONS DETERMINED BY THE INTERSECTION OF TWO OR MORE POLYHEDRA
by: Andrei SLONOVSCHI, et al.
Published: (2022-11-01) -
The Existence of a Convex Polyhedron with Respect to the Constrained Vertex Norms
by: Supanut Chaidee, et al.
Published: (2020-04-01) -
Convex polyhedra /
by: 252805 Aleksandrov, A. D. (Aleksandr Danilovich), 1912-
Published: (2005) -
Parameter Identification of Bivariate Fractal Interpolation Surfaces by Using Convex Hulls
by: Vasileios Drakopoulos, et al.
Published: (2023-06-01)