[1]

A. Aggarwal and R. C. Melville, Fast computation of the modality of polygons,*Proceedings of the Conference on Information Sciences and Systems*, The Johns Hopkins University. Also appears in*J. Algorithms*,**7** (1986), 369–381.

[2]

A. Aggarwal, J. S. Chang, and C. K. Yap, Minimum area circumscribing polygons, Technical Report, Courant Institute of Mathematical Sciences, New York University, 1985. Also to appear in*Visual Comput.* (1986).

[3]

D. Avis, G. T. Toussaint, and B. K. Bhattacharya, On the multimodality of distance in convex polygons,

*Comput. Math. Appl.*,

**8** (1982), 153–156.

MATHCrossRefMathSciNetGoogle Scholar[4]

J. E. Boyce, D. P. Dobkin, R. L. Drysdale, and L. J. Guibas, Finding extremal polygons,

*SIAM J. Comput.*,

**14** (1985), 134–147.

MATHCrossRefMathSciNetGoogle Scholar[5]

B. M. Chazelle, R. L. Drysdale, and D. T. Lee, Computing the largest empty rectangle,

*SIAM J. Comput.*,

**15** (1986), 300–315.

MATHCrossRefMathSciNetGoogle Scholar[6]

D. Dolev, K. Karplus, A. Siegel, A. Strong, and J. D. Ullman, Optimal wiring between rectangles,*Proceedings of the 13th Annual ACM Symposium on the Theory of Computing*, Milwaukee, WI, 1981, pp. 312–317.

[7]

D. T. Lee and F. P. Preparata, The all-nearest-neighbor problem for convex polygons,

*Inform. Process. Lett.*,

**7** (1978), 189–192.

MATHCrossRefMathSciNetGoogle Scholar[8]

M. McKenna, J. O'Rourke, and S. Suri, Finding the largest rectangle in an orthogonal polygon, Technical Report, The Johns Hopkins University, 1985. Also appears in*Proceedings of the Allerton Conference on Control, Communications, and Computing*, Allerton, IL, 1985.

[9]

M. H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane,

*J. Comput. System Sci.*,

**23** (1981), 166–204.

MATHCrossRefMathSciNetGoogle Scholar[10]

F. P. Preparata, Minimum spanning circle, in

*Steps in Computational Geometry* (F. P. Preparata, ed.), University of Illinois Press, Urbana, 1977, pp. 3–5.

Google Scholar[11]

M. I. Shamos, Geometric complexity,*Proceedings of the Seventh Annual Symposium on Theory of Computing*, Albuquerque, NM, 1975, pp. 224–233.

[12]

M. I. Shamos and D. Hoey, Closest-point problems,*Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science*, Berkeley, CA, 1975, pp. 151–162.

[13]

A. Siegel and D. Dolev, The separation for general single-layer wiring barriers,*Proceedings of the CMU Conference on VLSI Systems and Computations*, Pittsburgh, PA, 1981, pp. 143–152.

[14]

M. Tompa, An optimal solution to a wire routing problem,

*J. Comput. System Sci.*,

**23** (1981), 127–150.

MATHCrossRefMathSciNetGoogle Scholar[15]

G. T. Toussaint, Complexity, convexity and unimodality,*Proceedings of the Second World Conference on Mathematics*, Las Palmas, Spain, 1982.

[16]

G. T. Toussaint, The symmetric all-furtherst-neighbor problem,

*Comput. Math Appl*,

**9** (1983), 747–754.

MATHCrossRefMathSciNetGoogle Scholar[17]

G. T. Toussaint and B. K. Bhattacharya, On geometric algorithms that use the furthest-neighbor pair of a finite planar set, Technical Report, School of Computer Science, McGill University, 1981.