Trajectory Minimum Touching Ball
Jeff M. Phillips, Jens Kristian Refsgaard Schou

TL;DR
This paper develops algorithms to find the smallest sphere intersecting all given trajectories, with efficient solutions for simple cases and approximate methods for complex configurations, advancing geometric intersection problems.
Contribution
It introduces algorithms for minimum intersecting sphere problems on trajectories, including LP-type reduction for simple cases and near-linear approximation algorithms for complex cases.
Findings
Linear time solution for single-segment trajectories
Unbounded LP-type complexity for multi-segment trajectories
Near-linear time approximation algorithm
Abstract
We present algorithms to find the minimum radius sphere that intersects every trajectory in a set of trajectories composed of at most line segments each. When , we can reduce the problem to the LP-type framework to achieve a linear time complexity. For we provide a trajectory configuration with unbounded LP-type complexity, but also present an almost algorithm through the farthest line segment Voronoi diagrams. If we tolerate a relative approximation, we can reduce to time near-linear in .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsControl and Dynamics of Mobile Robots · Robotic Path Planning Algorithms
