Characterizes admissible regions and sequences for bounded-turn n-segment paths and builds finite approximations for optimization algorithms.
An Introduction to Convex Polytopes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns
Characterizes admissible regions and sequences for bounded-turn n-segment paths and builds finite approximations for optimization algorithms.