Trajectory planning for an articulated probe
From MaRDI portal
Publication:2206741
DOI10.1016/j.comgeo.2020.101655zbMath1476.68291OpenAlexW3021670317MaRDI QIDQ2206741
Kyle Fox, Ovidiu Daescu, Ka Yaw Teo
Publication date: 23 October 2020
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2020.101655
motion planningclearancecircular sector emptinesscircular arc intersectioncircular sector intersection
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- Finding the upper envelope of n line segments in O(n log n) time
- Range searching with efficient hierarchical cuttings
- Farthest-point queries with geometric and combinatorial constraints
- Movement Problems for 2-Dimensional Linkages
- Off-Line Maintenance of Planar Configurations
- An Optimal Algorithm for Computing Visibility in the Plane
- Planning Algorithms
- THE VISIBILITY COMPLEX
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Trajectory planning for an articulated probe