P. K. Agarwal, Partitioning arrangements of lines, II: Applications,Discrete and Computational Geometry
P. K. Agarwal and M. Sharir, Red-blue intersection detection algorithms with applications to motion planning and collision detection,SIAM Journal on Computing
M. Ajtai, J. Komlos, and E. Szemerédi, Sorting inc logn parallel steps,Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 1–9.
K. E. Batcher, Sorting networks and their applications,Proceedings of the AFIPS Spring Joint Summer Computer Conference, vol. 32 (1968), pp. 307–314.
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.
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.
K. Clarkson, New applications of random sampling in computational geometry,Discrete and Computational Geometry
K. Clarkson, Applications of random sampling in computational geometry, II,Proceedings of the 4th Annual Symposium on Computational Geometry, 1988, pp. 1–11.
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.
K. Clarkson, R. E. Tarjan, and C. J. Van Wyk, A fast Las Vegas algorithm for triangulating a simple polygon,Discrete and Computational Geometry
R. Cole, Slowing down sorting networks to obtain faster sorting algorithms,Journal of the Association for Computing Machinery
31 (1984), 200–208.
R. Cole, J. Salowe, W. Steiger, and E. Szemerédi, An optimal-time algorithm for slope selection,SIAM Journal on Computing
R. Cole, M. Sharir, and C. K. Yap, Onk
-hulls and related problems,SIAM Journal on Computing
H. Edelsbrunner,Algorithms in Combinatorial Geometry
, Springer-Verlag, Heidelberg, 1987.CrossRefMATH
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
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
H. Edelsbrunner and E. Welzl, Constructing belts in two-dimensional arrangements with applications,SIAM Journal on Computing
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.
D. Haussler and E. Welzl,ɛ
-nets and simplex range queries,Discrete and Computational Geometry
J. Matoušek, Construction ofɛ-nets,Discrete and Computational Geometry, this issue, 427–448.
N. Megiddo, Applying parallel computation algorithms in design of serial algorithms,Journal of the Association of Computing Machinery
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.
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. Suri, A linear algorithm for minimum link paths inside a simple polygon,Computer Vision, Graphics and Image Processing
E. Welzl, More onk
-sets of finite sets in the plane,Discrete and Computational Geometry
G. Woeginger, Epsilon-nets for half planes, Technical Report B-88-02, Dept. of Mathematics, Free University, Berlin, March 1988.