An O(n log n) Manhattan path algorithm (Q795510): 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.1016/0020-0190(84)90105-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2004369220
@@ Property / OpenAlex ID: W2004369220 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of computing the measure of ∪[a             <sub>i</sub>             ,b             <sub>i</sub>             ]
+Normal rank
@@ Property / cites work @@
+Q3885184
@@ Property / cites work: Q3885184 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a manhattan path and related problems
@@ Property / cites work: Finding a manhattan path and related problems / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear line segment intersection, layered segment trees, and dynamization
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:795510