Finding Transversals for Sets of Simple Geometric-Figures

H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.

Download
No fulltext has been uploaded. References only!

Journal Article | Published
Abstract
A straight line that intersects all members of a set S of objects in the real plane is called a transversal of S. Geometric transforms are described that reduce transversal problems for various types of objects to convex hull problems for points. These reductions lead to efficient algorithms for finding transversals which are also described. Applications of the algorithms are found in computer graphics: “Reproduce the line displayed by a collection of pixels”, and in statistics: “Find the line that minimizes the maximum distance from a collection of (weighted) points in the plane”.
Publishing Year
Date Published
1985-01-01
Journal Title
Theoretical Computer Science
Volume
35
Issue
1
Page
55 - 69
IST-REx-ID

Cite this

Edelsbrunner H. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 1985;35(1):55-69. doi:10.1016/0304-3975(85)90005-2
Edelsbrunner, H. (1985). Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science, 35(1), 55–69. https://doi.org/10.1016/0304-3975(85)90005-2
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science 35, no. 1 (1985): 55–69. https://doi.org/10.1016/0304-3975(85)90005-2.
H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” Theoretical Computer Science, vol. 35, no. 1, pp. 55–69, 1985.
Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:10.1016/0304-3975(85)90005-2.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar