ISSN:
1572-9125
Keywords:
Computational geometry
;
elementary geometry
;
divide-and-conquer
;
plane-sweep
;
geometric transform
;
data structures
;
dynamization
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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. Using the description of the stabbing lines, we are able to decide inO(logn) time whether or not a specified line is a stabbing line. Finally, the problem of maintaining the description of all stabbing lines while inserting and deleting line segments is addressed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01934440
