A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing the extreme distances between two convex polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-Dimensional Voronoi Diagrams in the <i> L <sub>p</sub> </i> -Metric / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992847 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection and Closest-Pair Problems for a Set of Planar Discs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank | |||
Normal rank |
Latest revision as of 22:43, 29 July 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
0 references