Computing closest and farthest points for a query segment (Q2481974): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing closest and farthest points for a query segment |
scientific article |
Statements
Computing closest and farthest points for a query segment (English)
0 references
15 April 2008
0 references
computational geometry
0 references
data structure
0 references
segment dragging problem
0 references
