K. Pankaj, J. Agarwal, L. J. Basch, J. Guibas, L. Hershberger et al., Deformable free-space tilings for kinetic collision detection, International Journal of Robotics Research, vol.21, issue.3, pp.179-197, 2002.

K. Pankaj, J. Agarwal, L. J. Gao, and . Guibas, Kinetic medians and kd-trees, Proceedings of the Tenth European Symposium on Algorithms, pp.5-16, 2002.

K. Pankaj, L. J. Agarwal, J. Guibas, E. Hershberger, and . Veach, Maintaining the extent of a moving point set, Discrete and Computational Geometry, vol.26, pp.353-374, 2001.

K. Pankaj, S. Agarwal, and . Har-peled, Maintaining approximate extent measures of moving points, Proceedings of the Symposium on Discrete Algorithms, pp.148-157, 2001.

K. Pankaj, M. Agarwal, and . Sharir, Davenport-Schinzel Sequences and Their Geometric Applications, 1995.

J. Basch, Kinetic data structures, Proceedings of the fifteenth annual symposium on Computational geometry , SCG '99, 1999.
DOI : 10.1145/304893.305004

J. Basch, J. Erickson, L. J. Guibas, J. Hershberger, and L. Zhang, Kinetic collision detection between two simple polygons, Computational Geometry, vol.27, issue.3, pp.211-235, 2004.
DOI : 10.1016/j.comgeo.2003.11.001
URL : http://doi.org/10.1016/j.comgeo.2003.11.001

J. Basch, L. Guibas, and J. Hershberger, Data Structures for Mobile Data, Journal of Algorithms, vol.31, issue.1, pp.1-28, 1999.
DOI : 10.1006/jagm.1998.0988

J. Basch, L. J. Guibas, C. Silverstein, and L. Zhang, A practical evaluation of kinetic data structures, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.388-390, 1997.
DOI : 10.1145/262839.263016

J. Basch, L. J. Guibas, and L. Zhang, Proximity problems on moving points, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.344-351, 1997.
DOI : 10.1145/262839.262998

S. Bereg, B. Bhattacharya, D. Kirkpatrick, and M. Segal, Competitive Algorithms for Maintaining a Mobile Center, Mobile Networks and Applications, vol.28, issue.2, pp.177-186, 2006.
DOI : 10.1007/s11036-006-4470-z

S. Bespamyatnikh, B. Bhattacharya, D. Kirkpatrick, and M. Segal, Mobile facility location, Proceedings of the International ACM Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp.46-53, 2000.
DOI : 10.1145/345848.345858

G. Chartrand and P. Zhang, h-convex graphs, Mathematica Bohemica, vol.126, issue.1, pp.209-220, 2001.

P. M. Dearing and R. L. Francis, A Minimax Location Problem on a Network, Transportation Science, vol.8, issue.4, pp.333-343, 1974.
DOI : 10.1287/trsc.8.4.333

S. Durocher, Geometric Facility Location under Continuous Motion, 2006.

S. Durocher and D. Kirkpatrick, THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION, International Journal of Computational Geometry & Applications, vol.16, issue.04, pp.345-371, 2006.
DOI : 10.1142/S0218195906002075

H. Edelsbrunner, L. J. Guibas, and M. Sharir, The upper envelope of piecewise linear functions: Algorithms and applications, Discrete & Computational Geometry, vol.3, issue.4, pp.311-336, 1989.
DOI : 10.1007/BF02187733

G. N. Frederickson, Parametric search and locating supply centers in trees, Proceedings of the Workshop on Algorithms and Data Structures, pp.299-319, 1991.
DOI : 10.1007/BFb0028271

L. J. Guibas, Kinetic Data Structures, Proceedings of the Workshop on the Algorithmic Foundations of Robotics, pp.191-209, 1998.
DOI : 10.1201/9781420035179.ch23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.7534

Y. Gabriel and . Handler, Minimax location of a facility in an undirected tree graph, Transportation Science, vol.7, pp.287-293, 1973.

Y. Gabriel and . Handler, Finding two-centers of a tree: The continuous case, Transportation Science, vol.12, pp.93-106, 1978.

Y. Gabriel, P. B. Handler, and . Mirchandani, Location on Networks: Theory and Algorithms, 1979.

P. Hansen, M. Labbé, D. Peeters, and J. Thisse, Single Facility Location on Networks, Annals of Discrete Mathematics, vol.31, pp.113-146, 1987.
DOI : 10.1016/S0304-0208(08)73234-1
URL : https://hal.archives-ouvertes.fr/hal-01255662

S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of a generalized path compression scheme, Proceedings of Foundations of Computer Science, pp.313-319, 1984.

J. Hershberger, Finding the upper envelope of n line segments in O(n log n) time, Information Processing Letters, vol.33, issue.4, pp.169-174, 1989.
DOI : 10.1016/0020-0190(89)90136-1

J. Hershberger, Smooth kinetic maintenance of clusters, Proceedings of the nineteenth conference on Computational geometry , SCG '03, pp.48-57, 2003.
DOI : 10.1145/777792.777800

O. Kariv and S. L. Hakimi, -Centers, SIAM Journal on Applied Mathematics, vol.37, issue.3, pp.513-538, 1979.
DOI : 10.1137/0137040

O. Kariv and S. L. Hakimi, -Medians, SIAM Journal on Applied Mathematics, vol.37, issue.3, pp.539-560, 1979.
DOI : 10.1137/0137041

D. Kirkpatrick, J. Snoeyink, and B. Speckmann, KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS, International Journal of Computational Geometry & Applications, vol.12, issue.01n02, pp.3-27, 2002.
DOI : 10.1142/S0218195902000724

C. Barbaros, R. L. Tansel, T. J. Francis, and . Lowe, Location on networks: A survey. part I: The p-center and p-median problems, Management Science, vol.29, issue.4, pp.482-497, 1983.

C. Barbaros, R. L. Tansel, T. J. Francis, and . Lowe, Location on networks: A survey. part II: Exploiting tree network structure, Management Science, vol.29, issue.4, pp.498-511, 1983.

A. Wiernik and M. Sharir, Planar realizations of nonlinear davenport-schinzel sequences by segments, Discrete & Computational Geometry, vol.25, issue.1, pp.15-47, 1988.
DOI : 10.1007/BF02187894