Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length (Q265042): Difference between revisions

@@ Property / cites work @@
+Quad trees: A data structure for retrieval by composite keys
+Normal rank
@@ Property / cites work @@
+Foundations of multidimensional and metric data structures.
+Normal rank
@@ Property / cites work @@
+The space efficiency of quadtrees
@@ Property / cites work: The space efficiency of quadtrees / rank @@
+Normal rank
@@ Property / cites work @@
+Counting regions, holes, and their nesting level in time proportional to the border
+Normal rank
@@ Property / cites work @@
+Expected and worst-case storage requirements for quadtrees
+Normal rank
@@ Property / cites work @@
+On the size of quadtrees generalized to d-dimensional binary pictures
+Normal rank
@@ Property / cites work @@
+Analysis of the worst case space complexity of a PR quadtree
+Normal rank
@@ Property / cites work @@
+About the Maximum Cardinality of the Digital Cover of a Curve with a Given Length
+Normal rank
@@ Property / cites work @@
+Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
+Normal rank
@@ Property / cites work @@
+A note on minimal length polygonal approximation to a digitized contour
+Normal rank
@@ Property / cites work @@
+Minimum-Perimeter Polygons of Digitized Silhouettes
+Normal rank
@@ Property / cites work @@
+On piecewise linear approximation of planar Jordan curves
+Normal rank