. [. Bibliography, K. Andrzejak, and . Fukuda, Optimization over k-set polytopes and efficient k-set enumeration, Proc. 6th Workshop Algorithms Data Struct, pp.1-12

L. [. Aggarwal, J. B. Guibas, P. W. Saxe, and . Shor, A linear-time algorithm for computing the voronoi diagram of a convex polygon, Discrete & Computational Geometry, vol.9, issue.6, pp.591-604, 1989.
DOI : 10.1007/BF02187749

O. [. Aurenhammer and . Schwarzkopf, A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS, International Journal of Computational Geometry & Applications, vol.02, issue.04, pp.363-381, 1992.
DOI : 10.1142/S0218195992000214

]. F. Aur91 and . Aurenhammer, Voronoi diagrams -a survey of a fundamental geometric data structure, ACM Comput. Surv, vol.23, issue.3, pp.345-405, 1991.

R. [. Brodal and . Jacob, Dynamic planar convex hull, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., pp.617-626, 2002.
DOI : 10.1109/SFCS.2002.1181985
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.6614

B. Chazelle, L. J. Guibas, and D. T. Lee, The power of geometric duality, BIT, vol.11, issue.3, pp.76-90, 1985.
DOI : 10.1007/BF01934990

S. [. Chand and . Kapur, An Algorithm for Convex Polytopes, Journal of the ACM, vol.17, issue.1, pp.78-86, 1970.
DOI : 10.1145/321556.321564

F. [. Chazelle and . Preparata, Halfspace range search, Proceedings of the first annual symposium on Computational geometry , SCG '85, pp.83-93, 1986.
DOI : 10.1145/323233.323248

M. [. Cole, C. K. Sharir, and . Yap, -Hulls and Related Problems, SIAM Journal on Computing, vol.16, issue.1, pp.61-77, 1987.
DOI : 10.1137/0216005
URL : https://hal.archives-ouvertes.fr/hal-00807288

]. T. Dey98 and . Dey, Improved bounds on planar k-sets and related problems, Discrete Comput. Geom, vol.19, pp.373-382, 1998.

H. Edelsbrunner, Algorithms in combinatorial geometry, 1987.
DOI : 10.1007/978-3-642-61568-9

H. [. Edelsbrunner, N. Hasan, and S. Seidel, Circles through two points that always enclose many points, Geometriae Dedicata, vol.32, issue.1, pp.1-12, 1989.
DOI : 10.1007/BF00181432

L. [. Erdös, A. Lovász, E. G. Simmons, and . Straus, Dissection graphs of planar point sets. A Survey of Combinatorial Theory (Symps, pp.139-149, 1973.

]. H. Ervk93, J. Everett, M. J. Robert, and . Van-kreveld, An Optimal Algorithm for the (<= k)-Levels, with Applications to Separation and Transversal Problems, Symposium on Computational Geometry, pp.38-46, 1993.

H. Edelsbrunner, P. Valtr, and E. Welzl, Cutting dense point sets in half, Discrete & Computational Geometry, vol.61, issue.3, pp.243-255, 1997.
DOI : 10.1007/PL00009291

]. R. Jar73 and . Jarvis, On the identification of the convex hull of of a finite set of points in the plane, Inf. Process. Lett, vol.2, pp.18-21, 1973.

]. M. Kal84 and . Kallay, The complexity of incremental convex hull algorithms in R d, Inf. Process. Lett, vol.19, issue.4, p.197, 1984.

]. D. Lee82 and . Lee, On k-nearest neighbor Voronoi diagrams in the plane, IEEE Trans. Comput, pp.31478-487, 1982.

]. L. Lov71 and . Lovász, On the number of halving lines, Ann. Univ. Sci. Budapest, Etvs, Sect. Math, vol.14, pp.107-108, 1971.

J. [. Liu and . Snoeyink, Quadratic and cubic b-splines by generalizing higher-order voronoi diagrams, Proceedings of the twenty-third annual symposium on Computational geometry , SCG '07, pp.150-157, 2007.
DOI : 10.1145/1247069.1247100

]. A. Mel87 and . Melkman, On-line construction of the convex hull of a simple polyline, Inform. Process. Lett, vol.25, pp.11-12, 1987.

M. Neamtu, Delaunay configurations and multivariate spline: A generalization of a result of B, N. Delaunay. Trans. Amer. Soc, 2004.

B. [. Onn and . Sturmfels, Cutting Corners, Advances in Applied Mathematics, vol.23, issue.1, pp.29-48, 1999.
DOI : 10.1006/aama.1999.0645

M. H. Overmars, The Design of Dynamic Data Structures, Lecture Notes Comput. Sci, vol.156, 1983.

M. H. Overmars and J. Van-leeuwen, Maintenance of configurations in the plane, Journal of Computer and System Sciences, vol.23, issue.2, pp.166-204, 1981.
DOI : 10.1016/0022-0000(81)90012-X

]. G. Pec85 and . Peck, On k-sets in the plane, Discrete Math, vol.56, pp.73-74, 1985.

S. [. Preparata and . Hong, Convex hulls of finite sets of points in two and three dimensions, Communications of the ACM, vol.20, issue.2, pp.87-93, 1977.
DOI : 10.1145/359423.359430

M. [. Preparata and . Shamos, Computational Geometry: An Introduction, 1985.
DOI : 10.1007/978-1-4612-1098-6

J. [. Schmitt and . Spehner, On Delaunay and Voronoi diagrams of order k in the plane, Proc. 3rd Canad. Conf, pp.29-32, 1991.

J. [. Schmitt and . Spehner, Order-k Voronoi Diagrams, k-Sections, and k-Sets, JCDCG, pp.290-304, 1998.
DOI : 10.1007/978-3-540-46515-7_26

J. [. Schmitt and . Spehner, k-set Polytopes and Order-k Delaunay Diagrams, ISVD, pp.173-185, 2006.

]. G. Tót01 and . Tóth, Point sets with many k-sets, Discrete Comput. Geom, vol.26, issue.2, pp.187-194, 2001.

K. [. Yamamoto, K. Kato, H. Imai, and . Imai, Algorithms for vertical and orthogonal L1 linear approximation of points, Proceedings of the fourth annual symposium on Computational geometry , SCG '88, pp.352-361, 1988.
DOI : 10.1145/73393.73429