R. Finkel and J. Bentley, Quad trees: A data structure for retrieval on composite keys, Acta Informatica, vol.4, pp.1-9, 1974.

A. Klinger and C. R. Dyer, Experiments on picture representation using regular decomposition, Computer Graphics and Image Processing, vol.5, pp.68-105, 1976.

S. Tanimoto and T. Pavlidis, A hierarchical data structure for picture processing, Computer Graphics and Image Processing, vol.4, pp.104-119, 1975.

G. M. Hunter and K. Steiglitz, Operations on images using quad trees, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.1, pp.145-153, 1979.

G. M. Hunter, Efficient computation and data structures for graphics, 1978.

H. Samet, Foundations of Multidimensional and Metric Data Structures, The Morgan Kaufmann Series in Computer Graphics, 2006.

C. R. Dyer, The space efficiency of quadtrees, Computer Graphics and Image Processing, vol.19, pp.335-348, 1982.

H. Atkinson, I. Gargantini, and T. Walsh, Counting regions, holes, and their nesting level in time proportional to the border, Computer Vision, Graphics, and Image Processing, vol.29, pp.196-215, 1985.

F. Burton, V. J. Kollias, and J. G. Kollias, Expected and worst-case storage requirements for quadtrees, Pattern Recognition Letters, vol.3, pp.131-135, 1985.

T. Walsh, On the size of quadtrees generalized to d-dimensional binary pictures, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, pp.1089-1097, 1985.

S. V. Pemmaraju and C. A. Shaffer, Analysis of the worst case space complexity of a pr quadtree, Information Processing Letters, vol.49, pp.263-267, 1994.

Y. Gerard and A. Vacavant, About the maximum cardinality of the digital cover of a curve with a given length, Proceedings of the 18th International Conference on Discrete Geometry for Computer Imagery, vol.8668, pp.13-24, 2014.

X. Provençal and J. Lachaud, Two linear-time algorithms for computing the minimum length polygon of a digital contour, Discrete Geometry for Computer Imagery, 15th IAPR International Conference, pp.104-117, 2009.

U. Montanari, A note on minimal length polygonal approximation to a digitized contour, Communications of the ACM, vol.13, pp.41-47, 1970.

J. Sklansky, R. Chazin, and B. Hansen, Minimum perimeter polygons of digitized silhouettes, IEEE Trans. Computers, vol.21, pp.260-268, 1972.

F. Sloboda and J. Stoern, On piecewise linear approximation of planar jordan curves, Journal of Computational and Applied Mathematics, vol.55, pp.369-383, 1994.