A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784)

From MaRDI portal
Revision as of 22:43, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers