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
Davenport-Schinzel sequences and their geometric applications, Handbook of Computational Geometry, 1998. ,
Approximate soft shadows on arbitrary surfaces using penumbra wedges, Proceedings of the 13th Eurographics Workshop on Rendering (EGRW'02), pp.297-306, 2002. ,
Another efficient algorithm for convex hulls in two dimensions, Information Processing Letters, vol.9, issue.5, pp.216-219, 1979. ,
DOI : 10.1016/0020-0190(79)90072-3
CGAL-based implementation of visibility complexes, Effective Computational Geometry for Curves and Surfaces, 2003. ,
A Sum of Squares Theorem for Visibility Complexes and Applications, Discrete and Computational Geometry, pp.79-139, 2003. ,
DOI : 10.1007/978-3-642-55566-4_5
A survey of ray tracing acceleration techniques, 1989. ,
Improving radiosity solutions through the use of analytically determined form-factors, Proceedings of the 16th annual conference on Computer graphics and interactive techniques (SIGGRAPH'89), pp.325-334, 1989. ,
Efficient construction of visibility maps using approximate occlusion sweep, Proceedings of the 18th spring conference on Computer graphics , SCCG '02, pp.167-175, 2002. ,
DOI : 10.1145/584458.584486
Visibility in Computer Graphics, Environment and Planning B: Planning and Design, vol.31, issue.3, pp.729-756, 2003. ,
DOI : 10.1068/b2957
Robust Plane Sweep for Intersecting Segments, SIAM Journal on Computing, vol.29, issue.5, pp.1401-1421, 2000. ,
DOI : 10.1137/S0097539797329373
URL : https://hal.archives-ouvertes.fr/inria-00073419
Interval arithmetic yields efficient dynamic filters for computational geometry, Proceedings of the 14th ACM Annual Symposium on Computational Geometry (SoCG'98), pp.165-174, 1998. ,
Lines and Free Line Segments Tangent to Arbitrary Three-Dimensional Convex Polyhedra, SIAM Journal on Computing, vol.37, issue.2, pp.522-551, 2007. ,
DOI : 10.1137/S0097539705447116
Transversals to Line Segments in Three-Dimensional Space, Discrete & Computational Geometry, vol.34, issue.3, pp.381-390, 2005. ,
DOI : 10.1007/s00454-005-1183-1
A separation bound for real algebraic expressions, Proceedings of the 9th Annual European Symposium on Algorithms (ESA'01), volume 2161 of Lecture Notes in Computer Science, pp.254-265, 2001. ,
Interactive ray tracing with the visibility complex, Special issue on Visibility - Techniques and Applications, pp.703-717, 1999. ,
DOI : 10.1016/S0097-8493(99)00093-X
Hierarchical geometric models for visible surface algorithms, Communications of the ACM, vol.19, issue.10, pp.547-554, 1976. ,
DOI : 10.1145/360349.360354
Efficient light transport using precomputed visibility, Computer Graphics and Applications, issue.3, pp.2328-2365, 2003. ,
Ray Shooting, Depth Orders and Hidden Surface Removal, Lecture Notes in Computer Science, vol.703, 1993. ,
DOI : 10.1007/BFb0029813
Événements visuels et limites d'ombres, 2008. ,
Computing direct shadows cast by convex polyhedra, Proceedings of the 25nd European Workshop on Computational Geometry, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00431544
The Expected Number of 3D Visibility Events Is Linear, SIAM Journal on Computing, vol.32, issue.6, pp.1586-1620, 2003. ,
DOI : 10.1137/S0097539702419662
URL : https://hal.archives-ouvertes.fr/inria-00071914
Predicates for line transversals to lines and line segments in three-dimensional space, Proceedings of the twenty-fourth annual symposium on Computational geometry , SCG '08, 2008. ,
DOI : 10.1145/1377676.1377704
URL : https://hal.archives-ouvertes.fr/inria-00336256
Determining the separation of preprocessed polyhedra ??? A unified approach, Proceedings of the 17th International Colloquium on Automata, Languages and Programming, pp.400-413, 1990. ,
DOI : 10.1007/BFb0032047
A SURVEY OF OBJECT-SPACE HIDDEN SURFACE REMOVAL, International Journal of Computational Geometry & Applications, vol.04, issue.03, pp.325-362, 1994. ,
DOI : 10.1142/S0218195994000185
Mobile Robot Localization Using Sonar, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.9, issue.2, pp.325-332, 1987. ,
DOI : 10.1109/TPAMI.1987.4767907
Implémentation robuste du squelette de visibilité, 2001. ,
Robust epsilon visibility, Proceedings of the 29th annual conference on Computer graphics and interactive techniques (SIG- GRAPH'02), pp.567-575, 2002. ,
URL : https://hal.archives-ouvertes.fr/inria-00606723
Visibilité tridimensionnelle : étude analytique et applications, 1999. ,
The 3D visibility complex, Proceedings of the 9th Canadian Conference on Computational Geometry (CCCG'97), pp.153-158, 1997. ,
DOI : 10.1145/508357.508362
URL : https://hal.archives-ouvertes.fr/inria-00606717
The visibility skeleton, Proceedings of the 24th annual conference on Computer graphics and interactive techniques , SIGGRAPH '97, pp.89-100, 1997. ,
DOI : 10.1145/258734.258785
URL : https://hal.archives-ouvertes.fr/inria-00510088
Fast and accurate hierarchical radiosity using global visibility, ACM Transactions on Graphics, vol.18, issue.2, pp.128-170, 1999. ,
DOI : 10.1145/318009.318012
URL : https://hal.archives-ouvertes.fr/inria-00073244
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, Computational Geometry, vol.38, issue.3, pp.129-138, 2007. ,
DOI : 10.1016/j.comgeo.2006.12.003
On the degree of standard geometric predicates for line transversals in 3D, Computational Geometry, vol.42, issue.5, pp.484-494, 2009. ,
DOI : 10.1016/j.comgeo.2007.11.002
URL : https://hal.archives-ouvertes.fr/inria-00431441
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX, International Journal of Computational Geometry & Applications, vol.17, issue.04, pp.361-382, 2007. ,
DOI : 10.1142/S0218195907002380
URL : https://hal.archives-ouvertes.fr/inria-00103926
Computer graphics: principles and practice, 1995. ,
On visible surface generation by a priori tree structures, Proceedings of the 7th annual conference on Computer graphics and interactive techniques (SIGGRAPH'80), pp.124-133, 1980. ,
A beam tracing method for interactive architectural acoustics, The Journal of the Acoustical Society of America, vol.115, issue.2, pp.739-756, 2004. ,
DOI : 10.1121/1.1641020
URL : https://hal.archives-ouvertes.fr/inria-00606736
An Output-Sensitive Algorithm for Computing Visibility Graphs, SIAM Journal on Computing, vol.20, issue.5, pp.888-910, 1991. ,
DOI : 10.1137/0220055
Combinatoire des droites et segments pour la visibilité 3D, Thèse d'université, 2007. ,
An upper bound on the average size of silhouettes, Proceedings of the twenty-second annual symposium on Computational geometry , SCG '06, pp.241-257, 2008. ,
DOI : 10.1145/1137856.1137874
URL : https://hal.archives-ouvertes.fr/inria-00095282
Structures de visibilité globales : tailles, calculs et dégénérescences, Thèse d'université, 2004. ,
Modelling the interaction of light between diffuse surfaces, Computer Graphics Proceedings, Annual Conference Series Proceedings of SIGGRAPH'84, pp.212-222, 1984. ,
Dense packings of congruent circles in a circle, Discrete Mathematics, vol.181, issue.1-3, pp.139-154, 1998. ,
DOI : 10.1016/S0012-365X(97)00050-2
Kinetic Visibility, 2002. ,
A Survey of Real-time Soft Shadows Algorithms, Computer Graphics Forum, vol.10, issue.6, pp.753-774, 2003. ,
DOI : 10.1111/j.1467-8659.2003.00722.x
URL : https://hal.archives-ouvertes.fr/inria-00281388
Algebraic Topology, 2002. ,
Reliable path for virtual endoscopy: ensuring complete examination of human organs, IEEE Transactions on Visualization and Computer Graphics, vol.7, issue.4, pp.333-342, 2001. ,
Discontinuity meshing for radiosity, Proceedings of the 3rd Eurographics Workshop on Rendering (EGRW'92), pp.203-216, 1992. ,
An adaptable and extensible geometry kernel, Proceedings of the 5th Workshop on Algorithm Engineering (WAE'01), volume 2141 of Lecture Notes in Computer Science, pp.76-91, 2001. ,
DOI : 10.1016/j.comgeo.2006.11.004
URL : https://hal.archives-ouvertes.fr/inria-00344964
Determining the lines through four lines, Journal of Graphics Tools, vol.4, issue.3, pp.11-22, 1999. ,
Maintenance de la visibilité depuis un point mobile, et applications, 2006. ,
Contour Edge Analysis for Polyhedron Projections, Geometric Modeling: Theory and Practice, pp.379-394, 1997. ,
DOI : 10.1007/978-3-642-60607-6_25
II: Seminumerical Algorithms, The Art of Computer Programming, 1973. ,
DOI : 10.1145/1088322.1088323
Soft shadow volumes for ray tracing, ACM Transactions on Graphics, vol.24, issue.3, pp.1156-1165, 2005. ,
DOI : 10.1145/1073204.1073327
URL : https://hal.archives-ouvertes.fr/inria-00510157
Robot Motion Planning, 1991. ,
DOI : 10.1007/978-1-4615-4022-9
An Improved Physically-Based Soft Shadow Volume Algorithm, Computer Graphics Forum, vol.6, issue.9, pp.303-312, 2006. ,
DOI : 10.1109/38.62693
Bounds and error estimates for radiosity, Proceedings of the 21st annual conference on Computer graphics and interactive techniques , SIGGRAPH '94, pp.67-74, 1994. ,
DOI : 10.1145/192161.192176
Data structures and algorithms 3: multi-dimensional searching and computational geometry, 1984. ,
DOI : 10.1007/978-3-642-69900-9
Identification of algebraic numbers, Journal of Algorithms, vol.3, issue.3, pp.197-204, 1982. ,
DOI : 10.1016/0196-6774(82)90019-0
Exact from-region visibility culling, Proceedings of the 13th Eurographics Workshop on Rendering (EGRW'02), pp.191-202, 2002. ,
Computational Geometry in C, 1998. ,
Using the visibility complex for radiosity computation, Proceedings of the ACM Workshop on Applied Computational Geometry, 1996. ,
DOI : 10.1007/BFb0014495
URL : https://hal.archives-ouvertes.fr/inria-00510118
Radiosity for dynamic scenes in flatland with the visibility complex, Computer Graphics Forum: Proceedings Eurographics'96, pp.237-248, 1996. ,
DOI : 10.1111/1467-8659.1530237
URL : https://hal.archives-ouvertes.fr/inria-00510115
Single sample soft shadows, 1998. ,
Ray shooting on triangles in 3-space, Algorithmica, vol.4, issue.5, pp.471-494, 1993. ,
DOI : 10.1007/BF01187036
Computing exact aspect graphs of curved objects bounded by smooth algebraic surfaces, 1992. ,
Computing exact aspect graphs of curved objects: Algebraic surfaces, International Journal of Computer Vision, vol.23, issue.6, pp.231-255, 1992. ,
DOI : 10.1007/BF00133703
Visibility, occlusion, and the aspect graph, International Journal of Computer Vision, vol.6, issue.1, pp.137-160, 1990. ,
DOI : 10.1007/BF00054919
Singularities of the mutual disposition of a surface and a line, Russian Mathematical Surveys, vol.36, issue.1, pp.248-249, 1981. ,
DOI : 10.1070/RM1981v036n01ABEH002556
Topologically sweeping visibility complexes via pseudo-triangulations. Discrete and Computational Geometry, Proceedings of the 11th ACM Annual Symposium on Computational Geometry (SoCG'95), pp.419-453, 1996. ,
DOI : 10.1007/bf02712876
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9715
THE VISIBILITY COMPLEX, Proceedings of the 9th ACM Annual Symposium on Computational Geometry (SoCG'93), pp.279-308, 1996. ,
DOI : 10.1142/S0218195996000204
Robust computation of the non-obstructed line segments tangent to four amongst n triangles, 2003. ,
On the classification of views of piecewise smooth objects, Image and Vision Computing, vol.5, issue.2, pp.91-97, 1987. ,
DOI : 10.1016/0262-8856(87)90033-3
The geometry of view space of opaque objects bounded by smooth surfaces, Artificial Intelligence, vol.44, issue.1-2, pp.1-40, 1990. ,
DOI : 10.1016/0004-3702(90)90097-J
Topologically sweeping the visibility complex of polygonal scenes, Proceedings of the eleventh annual symposium on Computational geometry , SCG '95, pp.36-37, 1995. ,
DOI : 10.1145/220279.220339
Dynamic visibility in polygonal scenes with the visibility complex, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.421-423, 1997. ,
DOI : 10.1145/262839.263057
Conservative volumetric visibility with occluder fusion, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.229-238, 2000. ,
DOI : 10.1145/344779.344886
URL : https://hal.archives-ouvertes.fr/inria-00510056
When Close Enough is Close Enough, The American Mathematical Monthly, vol.107, issue.6, pp.489-499, 2000. ,
DOI : 10.2307/2589344
Algorithmic motion planning, Handbook of Discrete and Computational Geometry, pp.733-754, 1997. ,
DOI : 10.1201/9781420035315.ch47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.6292
Plücker coordinate tutorial, Ray Tracing News, vol.11, issue.1, 1998. ,
Computational geometric methods in volumetric intersection for 3D reconstruction, Pattern Recognition, vol.23, issue.8, pp.843-857, 1990. ,
DOI : 10.1016/0031-3203(90)90131-4
A Characterization of Ten Hidden-Surface Algorithms, ACM Computing Surveys, vol.6, issue.1, pp.1-55, 1974. ,
DOI : 10.1145/356625.356626
A survey of sensor planning in computer vision A ray tracing algorithm for progressive radiosity, Computer Graphics Proceedings, Annual Conference Series Proceedings of SIGGRAPH'89, pp.86-104315, 1989. ,
An improved illumination model for shaded display, Computer Graphics Proceedings, Annual Conference Series Proceedings of SIGGRAPH'79, p.14, 1979. ,
Cw complex ? wikipedia, the free encyclopedia, 2009. ,
Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs, Proceedings of the Eurographics Workshop on Rendering (EGRW'00), pp.71-82, 2000. ,
DOI : 10.1007/978-3-7091-6303-0_7
A survey of shadow algorithms, IEEE Computer Graphics and Applications, vol.10, issue.6, pp.13-32, 1990. ,
DOI : 10.1109/38.62693
Towards exact geometric computation, Computational Geometry, vol.7, issue.1-2, pp.3-23, 1997. ,
DOI : 10.1016/0925-7721(95)00040-2
URL : http://doi.org/10.1016/0925-7721(95)00040-2
On the Size of the 3D Visibility Skeleton: Experimental Results, Proceedings of the 16th Annual European Symposium on Algorithms (ESA'08), pp.805-816, 2008. ,
DOI : 10.1007/978-3-540-87744-8_67
URL : https://hal.archives-ouvertes.fr/inria-00336502
Towards an implementation of the 3D visibility skeleton, Proceedings of the twenty-third annual symposium on Computational geometry , SCG '07, 2007. ,
DOI : 10.1145/1247069.1247094
URL : https://hal.archives-ouvertes.fr/inria-00338095