The Shortest Path Finding between two points on a Polyhedral Surface

T. P. Popova; Popov E. V.; Rotkov S. I.

?

The Shortest Path Finding between two points on a Polyhedral Surface

P. 1–11.

Popova T. P., Popov E. V., Rotkov S. I.

The paper describes the approximate method of the shortest path finding between two points on a surface. This problem occurs when generating a cutting pattern after the form of the fabric tensile surface is found. The shortest path finding is reduced to the problem of finding the geodesic line on the surface. However, the numerical problem solution of the form finding of fabric tensile structure leads to the fact that the final surface is represented by an arbitrary polyhedron. There is no analytical problem solution of finding shortest paths in this case. The described method allows finding the shortest path on a surface of any regular polyhedron form.

Language: English

Full text

Text on another site

Keywords: Tensile fabric structures geodesic line cutting pattern shortest paths polyhedral surface

In book

WSCG 2014 Communication Papers Proceedings

Plzen: University of West Bohemia, 2014.

On the Efficiency of Bounded Multi-Source Shortest Path Algorithm

Громов Р. С., Нестеров Р.А., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 4 P. 23–44

This paper explores the performance criteria of the newest algorithm for solving the problem of finding shortest paths on a graph from a given vertex – Bounded Multi-Source Shortest Path Algorithm (BM-SSP). The algorithm was published in 2025 and, as its creators claim, it is asymptotically superior to Dijkstra’s deterministic algorithm. However, in the publication devoted ...

Added: September 18, 2026

Optimal Routing Algorithm in Dense Gaussian Networks-on-Chip

Monakhova E., Monakhov O., E. Lezhnev et al., , in: 2022 International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME).: IEEE, 2022. P. 1–6.

Added: January 31, 2023

Minimal Surface Form Finding and Visualization using Stretched Grid Method

Popov E. V., Popova T. P., Scientific Vizualisation 2021 Vol. 13 No. 1 P. 54–68

Geometric and computational approach based on the theory of Stretched Grid Method (SGM) has been developed for the minimal surfaces form finding. For example, SGM is advantageous for engineering problem solution relative to an arbitrary tensile fabric structures design in comparison with other approaches. The SGM fundamental properties concerning convergence of the method and applicability ...

Added: June 23, 2021

Unconstrained and Curvature-Constrained Shortest-Path Distances and Their Approximation

Arias-Castro E., Le Gouic T., Discrete and Computational Geometry 2019 Vol. 62 No. 1 P. 1–28

We study shortest paths and their distances on a subset of a Euclidean space, and their approximation by their equivalents in a neighborhood graph defined on a sample from that subset. In particular, we recover and extend the results of Bernstein et al. (Graph approximations to geodesics on embedded manifolds, Tech. Rep., Department of Psychology, ...

Added: May 12, 2019

Deformations of Period Lattices of Flexible Polyhedral Surfaces

Gaifullin A. A., Discrete and Computational Geometry 2014 Vol. 51 No. 2 P. 650–665

At the end of the19th century Bricard discovered the phenomenon of flexible polyhedra, that is, polyhedra with rigid faces and hinges at edges that admit nontrivial flexes. One of the most important results in this field is a theorem of Sabitov, asserting that the volume of a flexible polyhedron is constant during the flexion. In ...

Added: March 28, 2015

The Shortest Path Finding between two points on a Polyhedral Surface

Popov E. V., Rotkov S. I., , in: WSCG 2014 Communication Papers Proceedings.: Plzen: University of West Bohemia, 2014. P. 1–11.

Added: July 23, 2014