mirror of https://github.com/CGAL/cgal
881a713595
|
||
|---|---|---|
| .. | ||
| demo/Visibility_complex_2 | ||
| doc_tex | ||
| examples/Visibility_complex_2 | ||
| include/CGAL | ||
| package_info/Visibility_complex_2 | ||
| test/Visibility_complex_2 | ||
| README | ||
| dont_submit | ||
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.