1. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, and C. K. Yap, Finding minimal convex nested polygons,Proceedings of the 1st ACM Symposium on Computational Geometry (1985), ACM, New York, 1985, pp. 296–304.
2. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth, Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension,Proceedings of the 18th Annual ACM Symposium on Theory of Computing (1986), ACM, New York, 1986, pp. 273–282.
3. H. Edelsbrunner and F. P. Preparata, Minimum polygonal separation, Report No. UIUCDCS-R-86-1272, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, May 1986.
4. C. E. Kim and T. A. Anderson, Digital disks and a digital compactness measure,Proceedings of the 16th Annual ACM Symposium on Theory of Computing (1984), ACM, New York, 1984, pp. 117–124.
5. N. Megiddo, Linear-time algorithms for linear programming inR 3 and related problems,SIAM Journal on Computing 12 (1983), 759–776.