On stabbling lines for convex polyhedra in 3D, Computational Geometry, vol.4, issue.4, pp.177-189, 1994. ,
DOI : 10.1016/0925-7721(94)90016-7
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions, SIAM Journal on Computing, vol.25, issue.1, pp.100-116, 1996. ,
DOI : 10.1137/S0097539793244368
The union of moving polygonal pseudodiscs ??? Combinatorial bounds and applications, Computational Geometry, vol.11, issue.2, pp.69-82, 1998. ,
DOI : 10.1016/S0925-7721(98)00020-0
Sparse Arrangements and the Number of Views of Polyhedral Scenes, International Journal of Computational Geometry & Applications, vol.07, issue.03, pp.3-175, 1997. ,
DOI : 10.1142/S0218195997000120
Visibility with a moving point of view, Algorithmica, vol.3, issue.4, pp.360-378, 1994. ,
DOI : 10.1007/BF01187019
On the Number of Lines Tangent to Four Convex Polyhedra, Proceedings of the Canadian Conference on Computational Geometry, pp.113-117, 2002. ,
Transversals to line segments in three-dimensional space, Discrete and Computational Geometry, pp.3-381, 2005. ,
Interactive ray tracing with the visibility complex, Computers and Graphics, Special Issue on Visibility -Techniques and Applications, pp.5-703, 1999. ,
Visibility problems for polyhedral terrains, Journal of Symbolic Computation, vol.7, issue.1, pp.11-30, 1989. ,
DOI : 10.1016/S0747-7171(89)80003-3
The Expected Number of 3D Visibility Events Is Linear, SIAM Journal on Computing, vol.32, issue.6, pp.6-1586, 2003. ,
DOI : 10.1137/S0097539702419662
URL : https://hal.archives-ouvertes.fr/inria-00071914
Fast detection of polyhedral intersection, Theoretical Computer Science, vol.27, pp.3-241, 1983. ,
A multidisciplinary survey of visibility, Problems, Techniques , and Applications, 2000. ,
The visibility skeleton, Proceedings of the 24th annual conference on Computer graphics and interactive techniques , SIGGRAPH '97, pp.31-89, 1997. ,
DOI : 10.1145/258734.258785
URL : https://hal.archives-ouvertes.fr/inria-00510088
The 3D visibility complex, ACM Transactions on Graphics, vol.21, issue.2, pp.176-206, 2002. ,
DOI : 10.1145/508357.508362
URL : https://hal.archives-ouvertes.fr/inria-00606717
On incremental rendering of silhouette maps of a polyhedral scene, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp.910-917, 2000. ,
DOI : 10.1016/j.comgeo.2006.12.003
Predicates for line transversals in 3D, Proceedings of the 18th Canadian Conference on Computational Geometry, pp.43-46, 2006. ,
URL : https://hal.archives-ouvertes.fr/inria-00103945
Structures de visibilité globales : taille, calcul et dégénérescences, 2004. ,
New bounds for lower envelopes in three dimensions, with applications to visibility in terrains, Discrete & Computational Geometry, vol.6, issue.3, pp.313-326, 1994. ,
DOI : 10.1007/BF02574383
On lines missing polyhedral sets in 3-space, Discrete & Computational Geometry, vol.8, issue.1, pp.203-221, 1994. ,
DOI : 10.1007/BF02574376
THE VISIBILITY COMPLEX, International Journal of Computational Geometry & Applications, vol.06, issue.03, pp.279-308, 1996. ,
DOI : 10.1142/S0218195996000204
Davenport-Schinzel sequences and their geometric applications, 1995. ,
DOI : 10.1007/978-3-642-83539-1_9
URL : http://biogeometry.duke.edu/pubs-pankaj/surveys/ds-survey.ps.gz
Oriented projective geometry, Proceedings of the third annual symposium on Computational geometry , SCG '87, 1991. ,
DOI : 10.1145/41958.41966