Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523): Difference between revisions

@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+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 @@
+Lower Bounds on the Complexity of Polytope Range Searching
+Normal rank
@@ Property / cites work @@
+Quasi-optimal upper bounds for simplex range searching and new zone theorems
+Normal rank
@@ Property / cites work @@
+Quasi-optimal range searching in spaces of finite VC-dimension
+Normal rank
@@ Property / cites work @@
+Approximating Points by a Piecewise Linear Function: I
+Normal rank
@@ Property / cites work @@
+Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers
+Normal rank
@@ Property / cites work @@
+Q4947407
@@ Property / cites work: Q4947407 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient partition trees
@@ Property / cites work: Efficient partition trees / rank @@
+Normal rank
@@ Property / cites work @@
+Range searching with efficient hierarchical cuttings
+Normal rank
@@ Property / cites work @@
+An on-line algorithm for fitting straight lines between data ranges
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Polygon Retrieval
@@ Property / cites work: Polygon Retrieval / rank @@
+Normal rank