Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (Q4631913): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128411218, #quickstatements; #temporary_batch_1724714016629 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128411218 / rank | |||
Normal rank | |||
Latest revision as of 00:22, 27 August 2024
scientific article; zbMATH DE number 7046427
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding |
scientific article; zbMATH DE number 7046427 |
Statements
Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding (English)
0 references
23 April 2019
0 references
funnel algorithm
0 references
geometric shortest path
0 references
polyhedral surface
0 references
straightest geodesic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
