scientific article; zbMATH DE number 1501051
From MaRDI portal
Publication:4499928
zbMath0966.70005MaRDI QIDQ4499928
Publication date: 16 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
obstaclespolynomial-size circuits\(NP\)-hard problempolygons with \(N\) verticestwo-dimensional curvature-constrained shortest-path problem
Related Items
SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition ⋮ Reachability by paths of bounded curvature in a convex polygon ⋮ The cost of bounded curvature ⋮ Disks in Curves of Bounded Convex Curvature ⋮ Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles ⋮ Census of bounded curvature paths
This page was built for publication: