[A]

P. K. Agarwal, Partitioning arrangements of lines, II: Applications,

*Discrete and Computational Geometry*
**5** (1990), 533–574.

MathSciNetCrossRefMATH[AS]

P. K. Agarwal and M. Sharir, Red-blue intersection detection algorithms with applications to motion planning and collision detection,

*SIAM Journal on Computing*
**19** (1990), 297–322.

MathSciNetCrossRefMATH[AKS]

M. Ajtai, J. Komlos, and E. Szemerédi, Sorting in*c* log*n* parallel steps,*Proceedings of the 15th Annual ACM Symposium on Theory of Computing*, 1983, pp. 1–9.

[B]

K. E. Batcher, Sorting networks and their applications,*Proceedings of the AFIPS Spring Joint Summer Computer Conference*, vol. 32 (1968), pp. 307–314.

[CF]

B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry,*Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science*, 1988, pp. 539–549.

[Cl1]

K. Clarkson, A probabilistic algorithm for the post office problem,*Proceedings of the 17th Annual ACM Symposium on Theory of Computing*, 1985, pp. 75–84.

[Cl2]

K. Clarkson, New applications of random sampling in computational geometry,

*Discrete and Computational Geometry*
**2** (1987), 195–222.

MathSciNetCrossRefMATH[Cl3]

K. Clarkson, Applications of random sampling in computational geometry, II,*Proceedings of the 4th Annual Symposium on Computational Geometry*, 1988, pp. 1–11.

[CS]

K. Clarkson and P. Shor, Algorithms for diametric pairs and convex hulls that are optimal, randomized and incremental,*Proceedings of the 4th Annual Symposium on Computational Geometry*, 1988, pp. 12–17.

[CTV]

K. Clarkson, R. E. Tarjan, and C. J. Van Wyk, A fast Las Vegas algorithm for triangulating a simple polygon,

*Discrete and Computational Geometry*
**4** (1989), 423–432.

MathSciNetCrossRefMATH[Co]

R. Cole, Slowing down sorting networks to obtain faster sorting algorithms,*Journal of the Association for Computing Machinery*
**31** (1984), 200–208.

[CSSS]

R. Cole, J. Salowe, W. Steiger, and E. Szemerédi, An optimal-time algorithm for slope selection,

*SIAM Journal on Computing*
**16** (1989), 792–810.

CrossRef[CSY]

R. Cole, M. Sharir, and C. K. Yap, On

*k*-hulls and related problems,

*SIAM Journal on Computing*
**16** (1987), 61–77.

MathSciNetCrossRefMATH[E]

H. Edelsbrunner,

*Algorithms in Combinatorial Geometry*, Springer-Verlag, Heidelberg, 1987.

CrossRefMATH[EGH*]

H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, and E. Welzl, Implicitly representing arrangements of lines or segments,

*Discrete and Computational Geometry*
**4** (1989), 433–466.

MathSciNetCrossRefMATH[EGS]

H. Edelsbrunner, L. Guibas, and M. Sharir, The complexity and construction of many faces in arrangements of lines or of segments,

*Discrete and Computational Geometry*
**5** (1990), 161–196.

MathSciNetCrossRefMATH[EW]

H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications,

*SIAM Journal on Computing*
**15** (1986), 271–284.

MathSciNetCrossRefMATH[GOS]

L. Guibas, M. Overmars, and M. Sharir, Ray shooting, implicit point location, and related queries in arrangements of segments, Technical Report 433, Dept. Computer Science, New York University, March 1989.

[HW]

D. Haussler and E. Welzl,

*ɛ*-nets and simplex range queries,

*Discrete and Computational Geometry*
**2** (1987), 127–151.

MathSciNetCrossRefMATH[Ma]

J. Matoušek, Construction of*ɛ*-nets,*Discrete and Computational Geometry*, this issue, 427–448.

[Me]

N. Megiddo, Applying parallel computation algorithms in design of serial algorithms,

*Journal of the Association of Computing Machinery*
**30** (1983), 852–865.

MathSciNetCrossRefMATH[RS1]

J. Reif and S. Sen, Optimal randomized parallel algorithms for computational geometry,*Proceedings of the 16th International Conference on Parallel Processing*, 1987, pp. 270–277.

[RS2]

J. Reif and S. Sen, Polling: A new randomized sampling technique for computational geometry,*Proceedings of the 21st Annual ACM Symposium on Theory of Computing*, 1989, pp. 394–404.

[S]

S. Suri, A linear algorithm for minimum link paths inside a simple polygon,

*Computer Vision, Graphics and Image Processing*
**35** (1986), 99–110.

CrossRefMATH[We]

E. Welzl, More on

*k*-sets of finite sets in the plane,

*Discrete and Computational Geometry*
**1** (1986), 83–94.

MathSciNetCrossRef[Wo]

G. Woeginger, Epsilon-nets for half planes, Technical Report B-88-02, Dept. of Mathematics, Free University, Berlin, March 1988.