Références bibliographiques

[AT81]

Avis D. et Toussaint G.T. -- An efficient algorithm for decomposing a polygon into star-shaped pieces. Pattern Recognition, vol.13, 1981, pp. 295--298.

[BJMM93]

Benouamer M., Jaillon P., Michelucci D. et Moreau J.-M. -- A lazy solution to imprecision in computational geometry. In: Proc. 5th Canad. Conf. Comput. Geom., pp. 73--78. -- Waterloo, Canada, 1993.

[CG89]

Chazelle B. et Guibas L.J. -- Visibility and intersection problems in plane geometry. Discrete Comput. Geom., vol.4, 1989, pp. 551--581.

[CGL85]

Chazelle B., Guibas L.J. et Lee D.T. -- The power of geometric duality. BIT, vol.25, 1985, pp. 76--90.

[Chv75]

Chvátal V. -- A combinatorial theorem in plane geometry. J. Combin. Theory Ser., vol.B 18, 1975, pp. 39--41.

[CPT96]

Chiang Y.-J., Preparata F.P. et Tamassia R. -- A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps. SIAM J. Comput., vol.25, 1996, pp. 207--233.

[DY93]

Dobrindt K. et Yvinec M. -- Remembering conflicts in history yields dynamic algorithms. In: Proc. 4th Annu. Internat. Sympos. Algorithms Comput. ISAAC 93. pp. 21--30. -- Springer-Verlag.

[EG86]

Edelsbrunner H. et Guibas L.J. -- Topologically sweeping an arrangement. In: Proc. 18th Annu. ACM Sympos. Theory Comput., pp. 389--403.

[EG89]

Edelsbrunner H. et Guibas L.J. -- Topologically sweeping an arrangement. J. Comput. Syst. Sci., vol.38, 1989, pp. 165--194. -- Corrigendum in 42 1991, 249--251.

[EM90]

Edelsbrunner H. et Mücke E.P. -- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., vol.9, 1990, pp. 66--104.

[EOS86]

Edelsbrunner H., O'Rourke J. et Seidel R. -- Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput., vol.15, 1986, pp. 341--363.

[GHL⁺87]

Guibas L.J., Hershberger J., Leven D., Sharir M. et Tarjan R.E. -- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica, vol.2, 1987, pp. 209--233.

[GM91]

Ghosh S.K. et Mount D.M. -- An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput., vol.20, 1991, pp. 888--910.

[GSS89]

Guibas L.J., Salesin D. et Stolfi J. -- Epsilon geometry: building robust algorithms from imprecise computations. In: Proc. 5th Annu. ACM Sympos. Comput. Geom., pp. 208--217.

[HM90]

Heffernan P.J. et Mitchell J. S.B. -- Structured visibility profiles with applications to problems in simple polygons. In: Proc. 6th Annu. ACM Sympos. Comput. Geom., pp. 53--62.

[LPW79]

Lozano-Pérez T. et Wesley M.A. -- An algorithm for planning collision-free paths among polyhedral obstacles. Commun. ACM, vol.22, 1979, pp. 560--570.

[O'R87]

O'Rourke J. -- Art Gallery Theorems and Algorithms. -- New York, NY, Oxford University Press, 1987.

[ORDP96]

Orti R., Rivière S., Durand F. et Puech C. -- Radiosity for dynamic scenes in flatland with the visibility complex. Comput. Graph. Forum, vol.15, No 3, 1996, pp. 237--248. -- Proc. Eurographics '96.

[OvL81]

Overmars M.H. et van Leeuwen J. -- Maintenance of configurations in the plane. J. Comput. Syst. Sci., vol.23, 1981, pp. 166--204.

[OW88]

Overmars M.H. et Welzl E. -- New methods for computing visibility graphs. In: Proc. 4th Annu. ACM Sympos. Comput. Geom., pp. 164--171.

[Poc90]

Pocchiola M. -- Graphics in Flatland revisited. In: Proc. 2nd Scand. Workshop Algorithm Theory. pp. 85--96. -- Springer-Verlag.

[PV93]

Pocchiola M. et Vegter G. -- Sweep algorithm for visibility graphs of curved obstacles. -- manuscrit, 1993.

[PV94]

Pocchiola M. et Vegter G. -- Order types and visibility types of configurations of disjoint convex plane sets. -- Rapport technique No LIENS-94-4, Liens, Ecole Norm. Sup., Paris, janvier 1994.

[PV96a]

Pocchiola M. et Vegter G. -- Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., décembre 1996. -- To appear in the special issue devoted to ACM-SoCG'95.

[PV96b]

Pocchiola M. et Vegter G. -- The visibility complex. 1996. -- To appear in the special issue devoted to ACM-SoCG'93.

[Sam84]

Samet H. -- The quadtree and related hierarchical data structures. ACM Comput. Surv., vol.16, No 2, juin 1984.

[Sei94]

Seidel R. -- The nature and meaning of perturbations in geometric computing. In: Proc. 11th Annu. Sympos. on Theorical Aspects of Computer Science STACS 94. pp. 3--17. -- Springer-Verlag.

[ST86]

Sarnak N. et Tarjan R.E. -- Planar point location using persistent search trees. Commun. ACM, vol.29, 1986, pp. 669--679.

[Veg90]

Vegter G. -- The visibility diagram: A data structure for visibility problems and motion planning. In: Proc. 2nd Scand. Workshop Algorithm Theory. pp. 97--110. -- Springer-Verlag.

[Yapre]

Yap C. -- Fundamental Problems in Algorithmic Algebra. -- Princeton University Press.

[Yap90]

Yap C.K. -- A geometric consistency theorem for a symbolic perturbation scheme. J. Comput. Syst. Sci., vol.40, 1990, pp. 2--18.

[YD95]

Yap C. et Dubé T. -- Computing in {Euclidean Geometry. -- World Scientific, 1995, 2 édition, Lecture Notes Series on Computing, volume1.