B. Aronov and M. Sharir. Triangles in space, or building and analyzing castles in the air. InProceedings of the 4th ACM Symposium on Computational Geometry, pages 381–391, ACM, June 1988.
J. L. Bentley and T. A. Ottman. Algorithms for reporting and counting geometric intersections.IEEE Transactions on Computers, 28(9):643–647, 1979.
K. Q. Brown. Geometric Transforms for Fast Geometric Algorithms. Ph.D. thesis, Carnegie-Mellon University, 1980.
B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 590–600, IEEE, 1988.
B. Chazelle and L. Guibas. Visibility and intersection problems in plane geometry. InProceedings of the ACM Symposium on Computational Geometry, pages 135–146, ACM, 1985. Submitted toDiscrete and Computational Geometry.
B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications.Algorithmica, 1:163–191, 1986.
B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality.BIT, 25:76–90, 1985.
B. Chazelle and E. Welzl. Range searching and VC-dimension: a characterization of efficiency. 1988. Manuscript.
K. Clarkson. New applications of random sampling in computational geometry.Discrete and Computational Geometry, 2:195–222, 1987.
K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl. Combinatorial complexity bounds for arrangements of curves and surfaces. InProceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, pages 568–579, IEEE, 1988.
H. Edelsbrunner.Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, Volume 10, Springer-Verlag, Berlin, 1987.
H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. InProceedings of the 18th ACM Symposium on Theory of Computing, pages 389–403, ACM, May 1986.
H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, and M. Sharir. Arrangements of curves in the plane: Topology, combinatorics, and algorithms. InProceedings of the 15th ICALP, 1988.
H. Edelsbrunner, L. J. Guibas, and M. Sharir. The complexity of many faces in arrangements of lines and of segments. InProceedings of the 4th ACM Symposium on Computational Geometry, pages 44–55, ACM, June 1988.
H. Edelsbrunner, L. Guibas, and J. Stolfi. Optimal point location in a monotone subdivision.SIAM Journal on Computing, 15:317–340, 1986.
H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications.SIAM Journal on Computing, 15:341–363, 1986.
H. Edelsbrunner and E. Welzl. Halfplanar range search in linear space andO(n
0 695) query time.Information Processing Letters, 23:289–293, 1986.
L. Guibas and J. Hershberger. Optimal shortest path queries in a simple polygon. InProceedings of the 3rd ACM Symposium on Computational Geometry, pages 50–63, ACM, June 1987.
L. Guibas, J. Hershberger, and J. Snoeyink. Bridge trees: a data structure for convex hulls. 1989. In preparation.
L. Guibas, M. Overmars, and M. Sharir. Interesting line segments, ray shooting, and other applications of geometric partitioning techniques. InProceedings of the First Scandinavian Workshop on Algorithm Theory, pages 64–73. Lecture Notes in Computer Science, Volume 318, Springer-Verlag, Berlin, 1988.
D. Haussler and E. Welzl. Epsilon-nets and simplex range queries.Discrete and Computational Geometry, 2:127–151, 1987.
D. Kirkpatrick. Optimal search in planar subdivisions.SIAM Journal on Computing, 12:28–35, 1983.
D. E. Knuth.Sorting and Searching. The Art of Computer Programming, Volume 3, Addison-Wesley, Reading, MA, 1973.
J. Matoušek. Spanning trees with low crossing number. 1988. Manuscript.
M. Overmars and H. van Leeuwen. Maintenance of configurations in the plane.Journal of Computer and System Sciences, 23:166–204, 1981.
F. P. Preparata and M. I. Shamos.Computational Geometry. Springer-Verlag, New York, 1985.
N. Sarnak and R. E. Tarjan. Planar point location using persistent search trees.Communications of the ACM, 29:669–679, 1986.
M. I. Shamos and D. Hoey. Geometric intersection problems. InProceedings of the 17th IEEE Symposium on Foundations of Computer Science, pages 208–215, IEEE, 1976.
E. Welzl. Partition trees for triangle counting and other range searching problems. InProceedings of the 4th ACM Symposium on Computational Geometry, pages 23–33, ACM, June 1988.
D. E. Willard. Polygon retrieval.SIAM Journal on Computing, 11:149–165, 1982.