1. Asano, Ta. & Te. Asano, ‘Minimum Partition of Polygonal Regions into Trapezoids’, in Proc. 24th IEEE Annual Symposium on Foundations of Computer Science, 233–241, 1983.
2. Beckmann, N., H.P. Kriegel, R. Schneider & B. Seeger, The R*-tree: An efficient and robust access method for points and rectangles’, in Proc. 1990 ACM SIGMOD International Conference on Management of Data, 322–331, Atlantic City, USA, May 1990.
3. Claassen, E., ‘Spatial data structures in Geographic Information Systems’ (in Dutch), Master’s thesis, Department of Computer Science, University of Leiden, The Netherlands, 1989, an english short version can be found in [Oos 90].
4. Freeston, M., ‘A well-behaved structure for the storage of geometric objects’, in Proc. “Symposium on the Design and Implementation of Large Spatial Databases”, 287–300, Santa Barbara, USA, July 1989.
5. Günther, O. & J. Mimes, Tree-based access methods for spatial databases: implementation and performance evaluation’, in Proc. IEEE Trans. on Knowledge and Data Engineering, 1990.