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 a519c3c50c Removed doc_tex/main.tex, and #define CGAL_multiset_* in Antichain.h. 2007-08-25 14:22:57 +00:00
..
demo/Visibility_complex_2 Subdirectory renaming, and some cleanup. 2007-08-24 17:39:19 +00:00
doc_tex Removed doc_tex/main.tex, and #define CGAL_multiset_* in Antichain.h. 2007-08-25 14:22:57 +00:00
examples/Visibility_complex_2 Subdirectory renaming, and some cleanup. 2007-08-24 17:39:19 +00:00
include/CGAL Removed doc_tex/main.tex, and #define CGAL_multiset_* in Antichain.h. 2007-08-25 14:22:57 +00:00
test/Visibility_complex_2 Subdirectory renaming, and some cleanup. 2007-08-24 17:39:19 +00:00
README
…
changes.txt
…
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.