A worst-case efficient algorithm for hidden-line elimination<sup>†</sup> (Q3802610): 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.1080/00207168508803482
+Normal rank
@@ Property / OpenAlex ID @@
+W2026948925
@@ Property / OpenAlex ID: W2026948925 / 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 @@
+On the equivalence of some rectangle problems
@@ Property / cites work: On the equivalence of some rectangle problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Lower Bound on the Complexity of Orthogonal Range Queries
+Normal rank
@@ Property / cites work @@
+Q4776831
@@ Property / cites work: Q4776831 / rank @@
+Normal rank
@@ Property / cites work @@
+Plane-sweep algorithms for intersecting geometric figures
+Normal rank
@@ Property / cites work @@
+Binary Search Trees of Bounded Balance
@@ Property / cites work: Binary Search Trees of Bounded Balance / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the Boolean masking problem
@@ Property / cites work: A fast algorithm for the Boolean masking problem / rank @@
+Normal rank
@@ Property / cites work @@
+Rectilinear line segment intersection, layered segment trees, and dynamization
+Normal rank