Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (Q4639124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves |
scientific article; zbMATH DE number 6865929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves |
scientific article; zbMATH DE number 6865929 |
Statements
Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves (English)
0 references
3 May 2018
0 references
method of orienting curves
0 references
geometric shortest path
0 references
straightest geodesic
0 references
sequence of triangles
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8985438346862793
0 references
0.8645820617675781
0 references
0.773145318031311
0 references
