1. Simple points, topological numbers and geodesic neighborhoods in cubic grids;Bertrand;Pattern Recogn. Lett.,1994
2. G. Bertrand, On P-simple points, in: Compte Rendu de l’Académie des Sciences de Paris (Computer Science/Theory of Signals), Série I, vol. 321, 1995, pp. 1077–1084.
3. G. Bertrand, P-simple points: a solution for parallel thinning, in: Actes du 5ème colloque Discrete Geometry for Computer Imagery, DGCI’1995, Clermont-Ferrand, France, 1995, pp. 233–242.
4. G. Bertrand, Sufficient conditions for 3D parallel thinning algorithms, in: Conference on Vision Geometry IV, San Diego, CA, USA, SPIE, vol. 2573, Bellingham, WA, 1995, pp. 52–60.
5. G. Bertrand, Z. Aktouf, A three-dimensional thinning algorithm using subfields, in: Conference on Vision Geometry III, Boston, MA, USA, SPIE, vol. 2356, Bellingham, WA, 1994, pp. 113–124.