A technique for adding range restrictions to generalized searching problems (Q293144): Difference between revisions

@@ Property / cites work @@
+Connected component and simple polygon intersection searching
+Normal rank
@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+On intersection searching problems involving curved objects
+Normal rank
@@ Property / cites work @@
+Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
+Normal rank
@@ Property / cites work @@
+Algorithms for generalized halfspace range searching and other intersection searching problems
+Normal rank
@@ Property / cites work @@
+GENERALIZED INTERSECTION SEARCHING PROBLEMS
@@ Property / cites work: GENERALIZED INTERSECTION SEARCHING PROBLEMS / rank @@
+Normal rank
@@ Property / cites work @@
+-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
+Normal rank
@@ Property / cites work @@
+Using persistent data structures for adding range restrictions to searching problems
+Normal rank
@@ Property / cites work @@
+General methods for adding range restrictions to decomposable searching problems
+Normal rank
@@ Property / cites work @@
+Adding range restriction capability to dynamic data structures
+Normal rank