cgal/Visibility_complex_2 at 995e1796e4eb0ac92418f50eb0f83d149e15efe2 - cgal

History

Fernando Cacciola f93437ca22 Removed unmodified auto-generated CMakeLists.txt (now created by create_internal_release)		2008-05-05 14:01:55 +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	Remove calls to round() (not C++98, clashes with Core's round(), and probably useless).	2008-03-29 09:57:14 +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	Removed unmodified auto-generated CMakeLists.txt (now created by create_internal_release)	2008-05-05 14:01:55 +00:00
README	Moved to trunk, changed name to Visibility_complex_2.	2007-08-24 03:23:38 +00:00
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.