Computing closest and farthest points for a query segment (Q2481974): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.11.015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083387551 / rank | |||
Normal rank | |||
Revision as of 15:26, 19 March 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
