Computing shortest transversals |
| |
Authors: | B Bhattacharya G Toussaint |
| |
Affiliation: | 1. School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada 2. School of Computer Science, McGill University, Montreal, P.Q., Canada
|
| |
Abstract: | We present anO(nlog2 n) time andO(n) space algorithm for computing the shortest line segment that intersects a set ofn given line segments or lines in the plane. If the line segments do not intersect the algorithm may be trimmed to run inO(nlogn) time. Furthermore, in combination with linear programming the algorithm will also find the shortest line segment that intersects a set ofn isothetic rectangles in the plane inO(nlogk) time, wherek is the combinatorial complexity of the space of transversals andk≤4n. These results find application in: (1) line-fitting between a set ofn data ranges where it is desired to obtain the shortestline-of-fit, (2) finding the shortest line segment from which a convexn-vertex polygon is weakly externally visible, and (3) determing the shortestline-of-sight between two edges of a simplen-vertex polygon, for whichO(n) time algorithms are also given. All the algorithms are based on the solution to a new fundamental geometric optimization problem that is of independent interest and should find application in different contexts as well. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|