Finding Transversals for Sets of Simple Geometric-Figures
Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.
Download (ext.)
https://www.sciencedirect.com/science/article/pii/0304397585900052?via%3Dihub
[Published Version]
Journal Article
| Published
| English
Scopus indexed
Author
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
Publisher
Elsevier
Acknowledgement
The author gratefully acknowledges the criticism of an anonymous referee who discovered a serious flaw in an earlier version of this paper.
Volume
35
Issue
1
Page
55 - 69
ISSN
eISSN
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. Elsevier. https://doi.org/10.1016/0304-3975(85)90005-2
Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” Theoretical Computer Science. Elsevier, 1985. 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. Elsevier, 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.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access