Proximity problems on line segments spanned by points (Q2489537)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Proximity problems on line segments spanned by points |
scientific article; zbMATH DE number 5020724
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proximity problems on line segments spanned by points |
scientific article; zbMATH DE number 5020724 |
Statements
Proximity problems on line segments spanned by points (English)
0 references
28 April 2006
0 references
Given a set \(S\) of \(n\) points and another point \(q\), the authors study the problem of finding the closest or farthest line segment (line) from \(q\) among those spanned by points in \(S\). They present an algorithm with \(O(n\log n)\) time and \(O(n)\) space for computing an optimal solution.
0 references
algorithm
0 references
0 references
0 references
0.8178406953811646
0 references
0.815839946269989
0 references
0.7754788398742676
0 references
