cgal/Packages/Visibility_complex
Laurent Rineau 1c8edfb025 Added lisence headers. 2004-04-08 10:40:10 +00:00
..
demo I forgot files in the last commit. 2004-03-02 16:10:44 +00:00
doc_tex Fix a bug in doc. Fix *_circle_traits.h to please gcc-3.x 2004-03-30 13:44:40 +00:00
include/CEP/Visibility_complex Added lisence headers. 2004-04-08 10:40:10 +00:00
test_suite *** empty log message *** 2003-10-30 16:42:57 +00:00
README Version 1.0.3. 2004-03-23 14:34:13 +00:00
cep_test
changes.txt
todo

README

Package Name:     Visibility_complex

Author:           Angelier Pierre  <Pierre.Angelier@ens.fr>
                  Pocchiola Michel <Michel.Pocchiola@ens.fr>

Maintainer:       Angelier Pierre  <Pierre.Angelier@ens.fr>
		  Rineau Laurent   <Laurent.Rineau@ens.fr>

Address:          Département d'Informatique de l'École Normale Supérieure
		  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.3 (23 March 2004)

CGAL Versions:    2.4 and 3.0

Supported Compilers & Platforms:
     sparc_SunOS-5.8_g++-2.95
     sparc_SunOS-5.7_g++-2.95.2_LEDA
     i686_Linux-2.2.18_g++-2.95
     i686_Linux-2.2.18_g++-2.95_LEDA
     i686_Linux-2.2.18_g++-3.0.4
     i686_Linux-2.2.18_g++-3.1.

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.
Installation:
      
Documentation:
      Package documentation is provided in postscript and HTML format in
      the subdirectory doc.
      
Tested items:

Testing process:

Hardware & Software requirements:

Constraints: