New lower bounds for Hopcroft's problem (Q1816464): Difference between revisions

@@ Property / cites work @@
+Partitioning arrangements of lines. II: Applications
+Normal rank
@@ Property / cites work @@
+Can visibility graphs be represented compactly?
@@ Property / cites work: Can visibility graphs be represented compactly? / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Verifying Depth Orders
@@ Property / cites work: Computing and Verifying Depth Orders / rank @@
+Normal rank
@@ Property / cites work @@
+CUTTINGS AND APPLICATIONS
@@ Property / cites work: CUTTINGS AND APPLICATIONS / rank @@
+Normal rank
@@ Property / cites work @@
+How hard is half-space range searching?
@@ Property / cites work: How hard is half-space range searching? / rank @@
+Normal rank
@@ Property / cites work @@
+Reporting and counting segment intersections
@@ Property / cites work: Reporting and counting segment intersections / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Complexity of Polytope Range Searching
+Normal rank
@@ Property / cites work @@
+Cutting hyperplanes for divide-and-conquer
@@ Property / cites work: Cutting hyperplanes for divide-and-conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234124
@@ Property / cites work: Q4234124 / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter, width, closest line pair, and parametric searching
+Normal rank
@@ Property / cites work @@
+Simplex range reporting on a pointer machine
@@ Property / cites work: Simplex range reporting on a pointer machine / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-optimal upper bounds for simplex range searching and new zone theorems
+Normal rank
@@ Property / cites work @@
+Q3312268
@@ Property / cites work: Q3312268 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial complexity bounds for arrangements of curves and spheres
+Normal rank
@@ Property / cites work @@
+On <i>k</i>-Hulls and Related Problems
@@ Property / cites work: On <i>k</i>-Hulls and Related Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Implicitly representing arrangements of lines or segments
+Normal rank
@@ Property / cites work @@
+The complexity of many cells in arrangements of planes and related problems
+Normal rank
@@ Property / cites work @@
+The complexity and construction of many faces in arrangements of lines and of segments
+Normal rank
@@ Property / cites work @@
+Q3359793
@@ Property / cites work: Q3359793 / rank @@
+Normal rank
@@ Property / cites work @@
+On Sets of Distances of n Points
@@ Property / cites work: On Sets of Distances of n Points / rank @@
+Normal rank
@@ Property / cites work @@
+Better lower bounds on detecting affine and spherical degeneracies
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Complexity of Some Optimal Data Structures
+Normal rank
@@ Property / cites work @@
+Q5203681
@@ Property / cites work: Q5203681 / rank @@
+Normal rank
@@ Property / cites work @@
+On ray shooting in convex polytopes
@@ Property / cites work: On ray shooting in convex polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Range searching with efficient hierarchical cuttings
+Normal rank
@@ Property / cites work @@
+A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
+Normal rank
@@ Property / cites work @@
+Q5186278
@@ Property / cites work: Q5186278 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for algebraic decision trees
@@ Property / cites work: Lower bounds for algebraic decision trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4001648
@@ Property / cites work: Q4001648 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal problems in discrete geometry
@@ Property / cites work: Extremal problems in discrete geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q4177585
@@ Property / cites work: Q4177585 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
+Normal rank