Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (Q2694526): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10898-022-01244-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4304806617 / rank | |||
Normal rank | |||
Revision as of 14:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves |
scientific article |
Statements
Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves (English)
0 references
3 April 2023
0 references
convex non-differentiable optimization
0 references
exact algorithm
0 references
global solution
0 references
path planning
0 references
planar unfolding
0 references
polyhedral surface
0 references
polytope
0 references
shortest path
0 references
straightest geodesic
0 references
