- Implementing Chan's little birdie (doubly-exponential search)
- The upper envelope problem
- Merge-envelope: Split into two subsets, recurse, and merge in O(n log n) time.
- Merging via sweep-line algorithm
- "Selection envelope" in O(nh). Hey, this smells like Jarvis march
- Projective point-line duality. It is Jarvis march!
- A partial duality dictionary
…Read more
Less…
- Tags
-