1. Divide and conquer for linear expected time;Bentley;Information Processing Lett.,1978
2. Optimal expected-time algorithms for closest-point problems;Bentley;Allerton Conference,1978
3. Fast intersection of half-spaces;Brown,1978
4. Geometric transforms for fast geometric algorithms;Brown,1978
5. An algorithm for convex polytopes;Chand;J. ACM,1970