A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784): 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.1007/3-540-55210-3_186 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1586293707 / rank | |||
Normal rank | |||
Revision as of 21:42, 19 March 2024
scientific article; zbMATH DE number 7573033
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A plane-sweep algorithm for finding a closest pair among convex planar objects |
scientific article; zbMATH DE number 7573033 |
Statements
A plane-sweep algorithm for finding a closest pair among convex planar objects (English)
0 references
18 August 2022
0 references
computational geometry
0 references
plane-sweep algorithm
0 references
closest-pair problem
0 references
