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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-57155-8_235
+Normal rank
@@ Property / OpenAlex ID @@
+W1530678548
@@ Property / OpenAlex ID: W1530678548 / rank @@
+Normal rank
@@ 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