Lines, Line Segments, Curves

• B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir and J. Snoeyink. Computing a face in an arrangement of line segments and related problems. SIAM J. Comput. 22 (1993), 1286-1302.
• B. Aronov, H. Edelsbrunner, L. J. Guibas and M. Sharir. The number of edges of many faces in a line segment arrangement. Combinatorica 12 (1992), 261-274.
• H. Edelsbrunner, L. J. Guibas, J. Pach, R. Pollack, R. Seidel and M. Sharir. Arrangements of curves in the plane - topology, combinatorics, and algorithms. Theoret. Comput. Sci. 92 (1992), 319-336.
• B. Chazelle and H. Edelsbrunner. An optimal algorithm for intersecting line segments in the plane. J. Assoc. Comput. Mach. 39 (1992), 1-54. pdf-file
• H. Edelsbrunner, L. J. Guibas and M. Sharir. The complexity and construction of many faces in arrangements of lines and of segments. Discrete Comput. Geom. 5 (1990), 161-196.
• K. L. Clarkson, H. Edelsbrunner, L. G. Guibas, M. Sharir and E. Welzl. Combinatorial complexity bounds for arrangements of curves and spheres. Discrete Comput. Geom. 5 (1990), 99-160.
• H. Edelsbrunner and D. L. Souvaine. Computing least median of squares regression lines and guided topological sweep. J. Amer. Statist. Assoc. 85 (1990), 115-119.
• H. Edelsbrunner, L. J. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink and E. Welzl. Implicitly representing arrangements of lines or segments. Discrete Comput. Geom. 4 (1989), 433-466.
• H. Edelsbrunner, L. J. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir and J. Snoeyink. On arrangements of Jordan arcs with three intersections per pair. Discrete Comput. Geom. 4 (1989), 523-539.
• H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. System Sci. 38 (1989), 165-194. Corrigendum. J. Comput. System Sci. 42 (1991), 249-251.
• H. Edelsbrunner and E. Welzl. On the maximal number of edges of many faces in an arrangement. J. Combin. Theory Ser. A 41 (1986), 159-166.

Lines, Planes, Hyperplanes

• H. Edelsbrunner, R. Seidel and M. Sharir. On the zone theorem for hyperplane arrangements. SIAM J. Comput. 22 (1993), 418-429. pdf-file
• H. Edelsbrunner, L. J. Guibas and M. Sharir. The complexity of many cells in arrangements of planes and related problems. Discrete Comput. Geom. 5 (1990), 197-216.
• H. Edelsbrunner. Edge-skeletons in arrangements with applications. Algorithmica 1 (1986), 93-109.
• H. Edelsbrunner, J. O'Rourke and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput. 15 (1986), 341-363.
• H. Edelsbrunner and D. Haussler. The complexity of cells in three-dimensional arrangements. Discrete Math. 60 (1986), 139-146.

Lines in Space

• B. Chazelle, H. Edelsbrunner, L. J. Guibas, M. Sharir and J. Stolfi. Lines in space: combinatorics and algorithms. Algorithmica 15 (1996), 428-447.
• B. Chazelle, H. Edelsbrunner, L. J. Guibas, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink. Counting and cutting cycles of lines and rods in space. Computational Geometry: Theory and Applications 1 (1992), 305-323.