1. N. Alon, “The number of polytopes, configurations and real matroids”, Mathematika 33 (1986), pp. 62–71
2. P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer and S. Whitesides, “On a visibility representation for graphs in three dimensions,” in Snapshots of Computational and Discrete Geometry, v. 3, eds. D. Avis and P. Bose, McGill University School of Computer Science Technical Report SOCS-94.50, July 1994, pp. 2–25
3. J. Canny, B. Donald and E. K. Ressler, “A rational rotation method for robust geometric algorithms”, Proc. 8th ACM Symp. Comput. Geom., 1992, 251–260.
4. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, “Algorithms for drawing graphs: an annotated bibliography”, Computational Geometry Theory and Applications, v. 4, 1994, 235–282. Also available from wilma.cs.brown.edu by ftp.
5. A. Dean and J. Hutchison, “Rectangle-visibility representations of bipartite graphs,” in Proc. Graph Drawing '94, Princeton, NJ, 1994. Lecture Notes in Computer Science LNCS v. 894, Springer-Verlag, 1995.