A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:01, 8 February 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
