P. Bhattacharya, Efficient neighbor finding algorithms in quadtree and octree. Master's thesis, Indian Institute of Technology, 2001.

D. Cohen-or, Y. Chrysanthou, and C. T. Silva, A survey of visibility for walkthrough applications, Proceedings of SIG- GRAPH, course notes, 2000.
DOI : 10.1109/TVCG.2003.1207447

L. David and G. Chris, Portals and mirrors: Simple, fast evaluation of potentially visible sets, Proceedings of ACM Symposium on Interactive 3D Graphics, pp.105-106, 1995.

F. Durand, 3D Visibility: Analytical Study and Applications, 1999.
URL : https://hal.archives-ouvertes.fr/tel-00529138

P. Felkel, M. Bruckschwaiger, and R. Wegenkittl, Implementation and complexity of the watershed-frommarkers algorithm computed as a minimal cost forest, Computer Graphics Forum, vol.20, issue.3, 2001.

F. Sarah, R. N. Frisken, and . Perry, Simple and efficient traversal methods for quadtrees and octrees, Journal of Graphics Tools, vol.7, issue.3, pp.1-11, 2002.

S. F. Frisken, R. N. Perry, A. P. Rockwood, and T. R. Jones, Adaptively sampled distance fields, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.249-254, 2000.
DOI : 10.1145/344779.344899

S. Hanan, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS, 1990.

D. Haumont and N. Warzée, Complete Polygonal Scene Voxelization, Journal of Graphics Tools, vol.4, issue.4, pp.27-41, 2002.
DOI : 10.1080/10867651.2002.10487563
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.6993

L. Hong, S. Muraki, A. Kaufman, D. Bartz, and T. He, Virtual voyage, Proceedings of the 24th annual conference on Computer graphics and interactive techniques , SIGGRAPH '97, pp.27-34, 1997.
DOI : 10.1145/258734.258750

C. B. Jones, A new approach to the 'hidden line' problem, The Computer Journal, vol.14, issue.3, pp.232-237, 1971.
DOI : 10.1093/comjnl/14.3.232

F. Meyer and S. Beucher, Morphological segmentation, Journal of Visual Communication and Image Representation, vol.1, issue.1, pp.21-46, 1990.
DOI : 10.1016/1047-3203(90)90014-M

J. B. Roerdink and A. Meijster, The watershed transform: Definitions, algorithms and parallelization strategies, Fundamenta Informaticae, vol.41, issue.12, pp.187-228, 2000.

A. Rosenfeld and J. L. Pfaltz, Sequential operations in digital picture processing, Journal of the ACM, vol.13, issue.4, pp.471-494, 1966.

G. Schaufler and J. Dorsey, Xavier Décoret, and François Sillion. Conservative volumetric visibility with occluder fusion, Proceedings of SIGGRAPH, pp.229-238, 2000.

S. Teller, Visibility computation in densely occluded polyhedral environments, CS department, 1992.

S. Teller and C. Séquin, Visibility preprocessing for interactive walkthroughs, Proceedings of SIGGRAPH, pp.61-68, 1991.
DOI : 10.1145/122718.122725
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.4007

S. Wegner, H. Oswald, and E. Fleck, The 3d watershed transform on graphs, SPIE Conference on Image Processing, pp.264-273, 1998.