L. J. Guibas, L. Ramshaw, and J. Stolfi, A kinetic framework for computational geometry, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.100-111, 1983.
DOI : 10.1109/SFCS.1983.1

F. Avnaim and J. Boissonnat, Simultaneous containment of several polygons, Proceedings of the third annual symposium on Computational geometry , SCG '87, pp.242-250, 1987.
DOI : 10.1145/41958.41984

F. Avnaim, Placement et déplacement de formes rigides ou articulées, Thèse de doctorat en sciences, 1989.

B. S. Baker, S. J. Fortune, and S. R. Mahaney, Polygon containment under translation, Journal of Algorithms, vol.7, issue.4, pp.532-548, 1986.
DOI : 10.1016/0196-6774(86)90017-9

T. Lozano-pérez and M. A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles, Communications of the ACM, vol.22, issue.10, pp.560-570, 1979.
DOI : 10.1145/359156.359164

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

S. J. Fortune, A fast algorithm for polygon containment by translation, Proc. 12th Internat, pp.189-198, 1985.
DOI : 10.1007/BFb0015744

H. Edelsbrunner and E. P. Mücke, Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990.
DOI : 10.1145/77635.77639