Proximity problems on line segments spanned by points (Q2489537): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:48, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proximity problems on line segments spanned by points |
scientific article |
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
