An optimal time and minimal space algorithm for rectangle intersection problems (Q3318126): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Reporting and Counting Geometric Intersections
+Normal rank
@@ Property / cites work @@
+Comments on “algorithms for reporting and counting geometric intersections”
+Normal rank
@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic range queries
@@ Property / cites work: A data structure for dynamic range queries / rank @@
+Normal rank
@@ Property / cites work @@
+An improved algorithm for the rectangle enclosure problem
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf00989481
+Normal rank
@@ Property / OpenAlex ID @@
+W1971436459
@@ Property / OpenAlex ID: W1971436459 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3318126