---
res:
bibo_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”.@eng'
bibo_authorlist:
- foaf_Person:
foaf_givenName: Herbert
foaf_name: Herbert Edelsbrunner
foaf_surname: Edelsbrunner
foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87
orcid: 0000-0002-9823-6833
bibo_doi: 10.1016/0304-3975(85)90005-2
bibo_issue: '1'
bibo_volume: 35
dct_date: 1985^xs_gYear
dct_publisher: Elsevier@
dct_title: Finding Transversals for Sets of Simple Geometric-Figures@
...