cgal/Visibility_complex_2 at 7757dda09ebd02bf54693df331d35b6be1554562 - cgal

History

Sylvain Pion dc3bf72707 Remove changes.txt files.		2008-07-24 17:47:16 +00:00
..
demo/Visibility_complex_2	Removed unmodified auto-generated CMakeLists.txt (now created by create_internal_release)	2008-05-05 14:01:55 +00:00
doc_tex	Remove most probably accidentally added file.	2008-01-02 22:26:43 +00:00
examples/Visibility_complex_2	Removed unmodified auto-generated CMakeLists.txt (now created by create_internal_release)	2008-05-05 14:01:55 +00:00
include/CGAL	CGAL_NULL and CGAL_NULL_TYPE are now constant macros, so replace them by:	2008-07-12 21:58:52 +00:00
package_info/Visibility_complex_2	Remove changes.txt files.	2008-07-24 17:47:16 +00:00
test/Visibility_complex_2	Removed unmodified auto-generated CMakeLists.txt (now created by create_internal_release)	2008-05-05 14:01:55 +00:00
README	…
dont_submit	Visibility_complex has a "README" file that conflicts with CGAL's one.	2008-02-21 23:30:24 +00:00

README

Package Name:     Visibility_complex

Author:           Angelier Pierre
                  Pocchiola Michel
                  Luc Habert 

Maintainer:       Luc Habert

Address:          Departement d'Informatique de l'Ecole Normale Superieure
		  45 rue d'Ulm 75230 Paris Cedex 05 France

CGAL Versions:    3.3

Purpose:
     This package implements the visibility complex data structure for planar
     scenes.

Description:

      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.