cgal/Cone_spanners_2 at dd19b506ed8b4c38953dc5b6d784138e442256e4 - cgal

History

Maxime Gimeno 9c15f2c9dc Use FeatureSummary in the demo, and remove CGAL_FOUND		2020-08-04 12:46:17 +02:00
..
data	replace tabs with 4 spaces	2016-05-31 09:48:36 +02:00
CMakeLists.txt	Use FeatureSummary in the demo, and remove CGAL_FOUND	2020-08-04 12:46:17 +02:00
README	run astyle	2016-05-31 10:05:12 +02:00
compute_cones.cmd	Reduce the cone number from 17 to 6	2016-03-17 22:09:00 +11:00
compute_cones.cpp	run astyle	2016-05-31 10:05:12 +02:00
dijkstra_theta.cmd	Add .cmd files for the examples	2015-12-18 15:38:39 +11:00
dijkstra_theta.cpp	fix types	2018-01-24 08:19:28 +00:00
theta_io.cmd	Add .cmd files for the examples	2015-12-18 15:38:39 +11:00
theta_io.cpp	remove CGAL_CXX11 macro usage	2019-07-08 11:42:17 +02:00

README

[Examples description]
compute_cones.cpp: this example computes the cone boundaries given the number of cones
   and the initial direction.

theta_io.cpp: this example constructs a Theta graph exactly with an input file containing a vertex list,
   and then generates the Gnuplot files for plotting the constructed Theta graph.

dijkstra_theta.cpp: this example constructs Theta graph first and then calculates
   the shortest paths on this graph by calling the Dijkstra's algorithm from BGL.