songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity
cgal/Visibility_complex_2
History
Luc Habert 733128913c Forgot a #ifdef CGAL_USE_QT. 2007-09-10 11:16:30 +00:00
..
demo/Visibility_complex_2 Forgot a #ifdef CGAL_USE_QT. 2007-09-10 11:16:30 +00:00
doc_tex Forgot a #ifdef CGAL_USE_QT. 2007-09-10 11:16:30 +00:00
examples/Visibility_complex_2 Yet other forgotten ellipse-files. 2007-08-31 12:41:52 +00:00
include/CGAL Protected the demos against lack of Qt. 2007-09-05 22:30:44 +00:00
test/Visibility_complex_2 Had forgotten to svn add the ellipse related files. 2007-08-31 12:41:19 +00:00
README Moved to trunk, changed name to Visibility_complex_2. 2007-08-24 03:23:38 +00:00
changes.txt Moved to trunk, changed name to Visibility_complex_2. 2007-08-24 03:23:38 +00:00
maintainer Added email address. 2007-08-24 17:54:32 +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.