Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment

DOI10.1016/j.comgeo.2021.101756OpenAlexW3131655365MaRDI QIDQ1984612

Ka Yaw Teo, Ovidiu Daescu

Publication date: 16 September 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.11672

zbMATH Keywords

motion planningcircular arc shootingcircular sector emptinessradius intersectionradius shooting

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Computing methodologies and applications (68Uxx)

Cites Work

• Finding the upper envelope of n line segments in O(n log n) time
• Range searching with efficient hierarchical cuttings
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms
• The overlay of lower envelopes and its applications
• Trajectory planning for an articulated probe
• Movement Problems for 2-Dimensional Linkages
• An Optimal Algorithm for Computing Visibility in the Plane
• Graphics in flatland revisited
• Planning Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment