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

@@ Property / cites work @@
+Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
+Normal rank
@@ Property / cites work @@
+Computing the extreme distances between two convex polygons
+Normal rank
@@ Property / cites work @@
+A sweepline algorithm for Voronoi diagrams
@@ Property / cites work: A sweepline algorithm for Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Two-Dimensional Voronoi Diagrams in the             <i>               L               <sub>p</sub>             </i>             -Metric
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection and Closest-Pair Problems for a Set of Planar Discs
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
+Normal rank