Celestial Walk: A Terminating Oblivious Walk for Convex Subdivisions
Wouter Kuijper, Victor Ermolaev, Olivier Devillers

TL;DR
The paper introduces a new oblivious walking strategy for convex subdivisions that is faster than existing methods and guarantees termination using a novel distance measure.
Contribution
It presents a faster, more general oblivious walk for convex subdivisions with a novel termination proof method.
Findings
Walk is faster than the straight walk
Applicable to a broader class than the visibility walk
Guarantees termination with a new distance measure
Abstract
We present a new oblivious walking strategy for convex subdivisions. Our walk is faster than the straight walk and more generally applicable than the visibility walk. To prove termination of our walk we use a novel monotonically decreasing distance measure.
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
TopicsComputational Geometry and Mesh Generation · Advanced Optimization Algorithms Research · Machine Learning and Algorithms
