An optimal algorithm for finding the separation of simple polygons (Q5060097): Difference between revisions

@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+Q4028879
@@ Property / cites work: Q4028879 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for some functions of two convex polygons
+Normal rank
@@ Property / cites work @@
+Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
+Normal rank
@@ Property / cites work @@
+Q4038707
@@ Property / cites work: Q4038707 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the extreme distances between two convex polygons
+Normal rank
@@ Property / cites work @@
+Q4028871
@@ Property / cites work: Q4028871 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank