Showing papers by "Herbert Edelsbrunner published in 1982"
TL;DR: An algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane and a purely geometric fact is proved which infers that this description requiresO(n) space to be specified.
Abstract: An algorithm for the geometric problem of determining a line (called a stabbing line) which intersects each ofn given line segments in the plane is presented. As a matter of fact, the algorithm computes a description of all stabbing lines. A purely geometric fact is proved which infers that this description requiresO(n) space to be specified. Our algorithm computes it inO(n logn) time which is optimal in the worst case.
106 citations
59 citations
42 citations