1. Bentley, J.L.: Multidimensional divide-and-conquer. Communications of the ACM 23(4), 214–229 (1980)
2. Bentley, J.L., Clarkson, K.L., Levine, D.B.: Fast linear expected-time algorithms for computing maxima and convex hulls. Algorithmica 9(2), 168–183 (1993)
3. Börzsönyi, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430 (2001)
4. Bose, P., Maheshwari, A., Morin, P., Morrison, J., Smid, M., Vahrenhold, J.: Space-efficient geometric divide-and-conquer algorithms. Computational Geometry: Theory & Applications (to appear, 2006) (accepted, November 2004)
5. Brönnimann, H., Chan, T.M.-Y.: Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. Computational Geometry: Theory & Applications 34(2), 75–82 (2006)