cgal/Packages/GeoWin/demo/GeoWin
Matthias Bäsken e7f030ade2 *** empty log message *** 2003-04-25 07:08:27 +00:00
..
CGAL_all_furthest_neighbors_2.C
CGAL_alpha_shape_2.C
CGAL_alpha_shape_2.hlp
CGAL_arrangement_2.C *** empty log message *** 2003-01-03 15:29:54 +00:00
CGAL_bops_polyholes_2.C *** empty log message *** 2002-05-31 11:23:59 +00:00
CGAL_constrained_triang_2.C *** empty log message *** 2002-07-29 14:56:33 +00:00
CGAL_convex_hull_2.C
CGAL_convex_hull_3.C
CGAL_convex_hull_3.hlp
CGAL_delaunay_triang_2.C *** empty log message *** 2003-04-25 06:53:42 +00:00
CGAL_delaunay_triang_2.hlp
CGAL_delaunay_triang_3.C *** empty log message *** 2002-07-29 14:35:40 +00:00
CGAL_demo.C
CGAL_geometry_2.C *** empty log message *** 2003-04-25 07:08:27 +00:00
CGAL_geometry_2.hlp
CGAL_kdtree_2.C
CGAL_kdtree_3.C
CGAL_ler_2.C *** empty log message *** 2002-05-31 09:02:23 +00:00
CGAL_max_k_gon_2.C *** empty log message *** 2002-08-30 07:17:37 +00:00
CGAL_min_circle_2.C
CGAL_min_ellipse_2.C
CGAL_min_sphere_3.C *** empty log message *** 2002-07-29 14:56:33 +00:00
CGAL_nef_2.C *** empty log message *** 2002-05-31 09:02:23 +00:00
CGAL_partition_2.C
CGAL_planar_map_2.C *** empty log message *** 2003-01-03 15:29:54 +00:00
CGAL_planar_map_2.hlp *** empty log message *** 2003-01-03 15:29:54 +00:00
CGAL_poly_triang_2.C *** empty log message *** 2002-07-29 14:56:33 +00:00
CGAL_polygon_2.C
CGAL_regular_triang_2.C
CGAL_segment_intersection_2.C
CGAL_triangulation_2.C *** empty log message *** 2003-04-25 06:42:21 +00:00
CGAL_triangulation_2.hlp
Makefile *** empty log message *** 2002-05-31 11:23:59 +00:00
Nef_2.hlp
Plmap.hlp
Polyholes_2.hlp *** empty log message *** 2002-05-31 11:23:59 +00:00
README

README

GeoWin demos demonstrating various CGAL data structures
and algorithms.
LEDA 4.0 or higher is required.

CGAL_kdtree_2.C / CGAL_kdtree_3.C   : demonstrations of kd-trees 
CGAL_all_furthest_neighbors_2.C     : all furthest neighbours
CGAL_alpha_shape_2.C                : 2d alpha shapes demo
CGAL_arrangement_2.C                : 2d segment arrangement
CGAL_constrained_triang_2.C         : constrained triangulations
CGAL_min_circle_2.C                 : optimisation - minimal enclosing circle
CGALdemo.C                          : a simple demo that lets you construct some scenes of geometric objects
CGAL_delaunay_triang_2.C            : delaunay triangulation data type demonstration
CGAL_convex_hull_2.C                : 2d convex hull algorithm
CGAL_convex_hull_3.C                : 3d convex hull algorithm (use Show 3d output in the Window menu to view the
                                      three dimensional output)
CGAL_max_k_gon_2.C                  : maximum area inscribed k-gon demo
CGAL_min_ellipse_2.C                : optimisation demo for minimal enclosing ellipse
CGAL_polygon_2.C                    : polygon inside/outside test for points
CGAL_segment_intersection_2.C       : 2d segment intersection
CGAL_triangulation_2.C              : this one demonstrates triangulations and voronoi diagrams
CGAL_planar_map_2.C                 : simple planar map demo incl. ray shooting
CGAL_delaunay_triang_3.C            : 3d Delaunay triangulations
CGAL_geometry_2.C                   : triangulations, Delaunay triangulations, Voronoi diagram,
                                      crust, location on DT
CGAL_min_sphere_3.C                 : smallest enclosing sphere demo (use Show 3d output in the Window menu to view the
                                      three dimensional output)
CGAL_regular_triang_2.C             : regular triangulation


Note that some demos (like CGAL2dtree, CGALdtfl) use more then one input scene.
To activate the others, use the Scenes - activate menu.