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
Sylvain Pion a46b55bf71 The files "changes.txt", "description.txt", "long_description.txt" and "maintainer" 
are now under /trunk/$Package/package_info/$Package/ .
 		2007-12-02 15:06:42 +00:00
..
demo/Visibility_complex_2 some low level code cleanup. renamed 2007-11-07 16:51:18 +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 some low level code cleanup. renamed 2007-11-07 16:51:18 +00:00
package_info/Visibility_complex_2 The files "changes.txt", "description.txt", "long_description.txt" and "maintainer" 2007-12-02 15:06:42 +00:00
test/Visibility_complex_2 Had forgotten to svn add the ellipse related files. 2007-08-31 12:41:19 +00:00
README
…

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.