We present an O(n log 2 n) time and O(n) space algorithm for computing the shortest line segment that intersects a set of n given line segments or lines in the plane. If the line segments do not intersect the algorithm may be trimmed to run in O(n log n) time. Furthermore, in combination with linear programming the algorithm will also find the shortest line segment that intersects a set of n isothetic rectangles in the plane in O(n log k) time, where k is the combinatorial complexity of the space of transversals and k 4n. These results find application in: (1) line-fitting between a set of n data ranges where it is desired to obtain the shortest line-of-fit, (2) finding the shortest line segment from which a convex n-vertex polygon is weakly externally visible, and (3) determining the shortest line-of-sight between two edges of a simple n-vertex polygon, for which O(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.
|
599
|
Data Structures and Algorithms
– Aho, Hopcroft, et al.
- 1983
|
|
300
|
Art Gallery Theorems and Algorithms
– O’Rourke
- 1987
|
|
156
|
Linear-time algorithms for linear programming in R 3 and related problems
– Megiddo
- 1983
|
|
141
|
An optimal algorithm for intersecting line segments in the plane
– Chazelle, Edelsbrunner
- 1992
|
|
133
|
Leeuwen. Maintenance of configurations in the plane
– Overmars, van
- 1981
|
|
89
|
The ultimate planar convex hull algorithm
– Kirkpatrick, Seidel
- 1986
|
|
82
|
Solving geometric problems with the rotating calipers
– Toussaint
- 1983
|
|
75
|
Fast detection of polyhedral intersection
– Dobkin, Kirkpatrick
- 1982
|
|
56
|
Finding the upper envelope of n line segments in O(n log n) time
– Hershberger
- 1989
|
|
47
|
Linear time algorithms for two- and three-variable linear programs
– Dyer
- 1984
|
|
38
|
Computing the extreme distances between two convex polygons
– Edelsbrunner
- 1985
|
|
35
|
Geometric intersection problems
– Shamos, Hoey
- 1976
|
|
32
|
An optimal algorithm for determining the visibility of a polygon from an edge
– Avis, Toussaint
- 1981
|
|
17
|
An optimal algorithm for finding minimal enclosing triangles
– O'Rourke, Aggarwal, et al.
- 1986
|
|
17
|
Shortest paths in the plane with convex polygonal obstacles
– Rohnert
- 1986
|
|
16
|
Stabbing line segments
– Edelsbrunner, Maurer, et al.
- 1982
|
|
13
|
Polyhedral line transversals in space
– Avis, Wenger
- 1988
|
|
12
|
Efficient algorithms for common transversals
– Atallah, Bajaj
- 1987
|
|
12
|
Finding the Smallest Triangles Containing a Given Convex Polygon
– Klee, Laskowski
- 1985
|
|
12
|
An on-line algorithm for fitting straight lines between data ranges
– O'Rourke
- 1981
|
|
12
|
The Steiner Problem
– Dreufus, Wagner
- 1971
|
|
11
|
Convex hulls for random lines
– Devroye, Toussaint
- 1993
|
|
11
|
Graphics in flatland: A case study
– Edelsbrunner, Overmars, et al.
- 1983
|
|
9
|
Algorithms for high dimensional stabbing problems
– Avis, Doskas
- 1990
|
|
9
|
Computing the convex hull of line intersections
– Atallah
- 1986
|
|
9
|
Determining sector visibility of a polygon
– Bhattacharya, Kirkpatrick, et al.
- 1989
|
|
9
|
Detection is Easier than Computation
– Chazelle, Dobkin
- 1980
|
|
8
|
Finding transversals for sets of simple geometric figures
– Edelsbrunner
- 1985
|
|
7
|
On common transversals
– Grunbaum
- 1958
|
|
7
|
Two counterexamples concerning transversals for convex subsets of the plane. Geom. Dedicata 9
– Lewis
- 1980
|
|
7
|
An optimal algorithm for detecting weak visibility of a polygon
– Sack, Suri
- 1990
|
|
6
|
A Polynomial Solution for Potato-Peeling and Other Polygon Inclusion and Enclosure Problems
– Chang, Yap
- 1986
|
|
6
|
Finding restricted k-envelopes for convex polygons
– DePano, Aggarwal
- 1984
|
|
6
|
Finding the widest empty corridor through a set of points
– Houle, Maciel
- 1988
|
|
6
|
Detecting the weak visibility of a simple polygon and related problems
– Ke
- 1987
|
|
6
|
The shortest watchtower and related problems for polyhedral terrains
– Sharir
- 1988
|
|
5
|
Visibility between two edges of a simple polygon. The Visual Computer
– Avis, Gum, et al.
- 1986
|
|
5
|
External visibility
– Buchman, Valentine
- 1976
|
|
5
|
Finding the diameter of a set of lines
– Ching, Lee
- 1985
|
|
5
|
Efficient Algorithms for Inserting and Deleting Edges from Triangulations
– ElGindy, Toussaint
- 1985
|
|
5
|
Some properties of l-sets in the plane
– Horn, Valentine
- 1949
|
|
3
|
Algorithms for line stabbers in space
– Avis, Wenger
- 1987
|
|
3
|
Visible shorelines
– Valentine
- 1970
|
|
2
|
On the duality of intersection and closest points
– Bajaj, Li
- 1983
|
|
2
|
Characterizations of convex and star-shaped polygons
– Shermer, Toussaint
- 1988
|
|
2
|
Minimal sets of visibility
– Valentine
- 1953
|
|
2
|
Stabbing and separation
– Wenger
- 1988
|
|
1
|
Computing the wingspan of a butterfly, " manuscript in preparation
– Bhattacharya, Egyed
|
|
1
|
Geometric extremum problems
– Chakerian, Lange
- 1971
|
|
1
|
A measure of separability for point sets
– Houle
- 1988
|
|
