Efficient algorithms for counting and reporting pairwise intersections between convex polygons (Q294592): Difference between revisions

@@ Property / author @@
-Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
-Normal rank
@@ Property / author @@
-Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
-Normal rank
@@ Property / author @@
+Michiel H. M. Smid
@@ Property / author: Michiel H. M. Smid / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997899
@@ Property / cites work: Q3997899 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225298
@@ Property / cites work: Q4225298 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for intersecting line segments in the plane
+Normal rank
@@ Property / cites work @@
+Quasi-optimal upper bounds for simplex range searching and new zone theorems
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for counting and reporting pairwise intersections between convex polygons
+Normal rank
@@ Property / cites work @@
+Efficient partition trees
@@ Property / cites work: Efficient partition trees / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2066537884
@@ Property / OpenAlex ID: W2066537884 / rank @@
+Normal rank