Package Name: Visibility_complex Author: Angelier Pierre Pocchiola Michel Maintainer: Angelier Pierre Rineau Laurent Address: Departement d'Informatique de l'Ecole Normale Superieure 45 rue d'Ulm 75230 Paris Cedex 05 France URL: http://www.di.ens.fr/~gecoal/Visibility_complex/Visibility_complex.tar.gz Version: 1.0.9.0 (26 April 2005) CGAL Versions: 3.0 and 3.1 Supported Compilers & Platforms: i686_Linux-2.6.9-1.667_g++-3.4.2 i686_Linux-2.6.9-1.667_g++-4.0.0 Purpose: This package implements the visibility complex data structure for planar scenes. Description: Distributed with this package are the following things: README -- this file INSTALLATION -- file describing more details about package installation doc_tex/ -- directory containing the package documentation in LaTeX format doc_ps/ -- directory containing the package documentation in postscript format doc_html/ -- directory containing the package documentation in Html format demo/ -- two small graphical (LEDA) demos illustrating the package. see demo/README for more details. cep_test -- shell script for running the test suite include/ -- directory containing the Visibility_complex header files test_suite/ -- directory containing the test suite source code, input and output files This package can be used to compute the visibility graph or visibility complex of planar scenes. These scenes can consist in pairwise non-intersecting points, segments, circles or polygons. The package can also be used to compute the shortest path between two points in such scenes. Changes: 1.0 initial release 1.0.1 fix for gcc-3.x compilers 1.0.2 fix in the documentation added a small word about shortest path in the user manual 1.0.3 This version is usable with CGAL-3.0. Perhaps does it still work with CGAL-2.2 but it is not sure. 1.0.9.0 Version for CGAL-3.1 and gcc >= 3.4. Installation: Documentation: Package documentation is provided in postscript and HTML format in the subdirectory doc. Tested items: Testing process: Hardware & Software requirements: Constraints: