- Decision problem: Free space is convex in each cell
- Weak Fréchet distance: Replace free space in each cell with convex hull of free boundary segments
- Finding reachable points on grid boundary by dynamic programming
- Optimization: Vertex-edge and monotonicity events
- Sketch of parametric search
- Random sampling and sweeping: O(n^2 log n) time with high probability
- FrechetView demo
…Read more
Less…
- Tags
-