mirror of https://github.com/CGAL/cgal
Changed names of examamples
This commit is contained in:
parent
912dacb1b9
commit
7dcda6ff48
|
|
@ -1,3 +1,6 @@
|
||||||
|
9 March 2006 Andreas Fabri
|
||||||
|
- Changed names of examples
|
||||||
|
|
||||||
10 September 2005 Sylvain Pion
|
10 September 2005 Sylvain Pion
|
||||||
- Add missing this-> for g++ 4.1.
|
- Add missing this-> for g++ 4.1.
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -1,24 +1,24 @@
|
||||||
examples/Partition_2/y_monotone_ex.C
|
examples/Partition_2/y_monotone_partition_2.C
|
||||||
------------------------------------
|
------------------------------------
|
||||||
|
|
||||||
computes a y-monotone partition of a random polygon and checks that each
|
computes a y-monotone partition of a random polygon and checks that each
|
||||||
polygon produced is, in fact, y-monotone and that the polygons form a
|
polygon produced is, in fact, y-monotone and that the polygons form a
|
||||||
partition of the original polygon.
|
partition of the original polygon.
|
||||||
|
|
||||||
file: examples/Partition_2/approx_convex_ex.C
|
file: examples/Partition_2/approx_convex_partition_2.C
|
||||||
---------------------------------------------
|
---------------------------------------------
|
||||||
|
|
||||||
computes an approximately optimal convex partition of a random polygon and
|
computes an approximately optimal convex partition of a random polygon and
|
||||||
checks the validity of the partition afterwards.
|
checks the validity of the partition afterwards.
|
||||||
|
|
||||||
file: examples/Partition_2/greene_approx_convex_ex.C
|
file: examples/Partition_2/greene_approx_convex_partition_2.C
|
||||||
----------------------------------------------------
|
----------------------------------------------------
|
||||||
|
|
||||||
computes an approximately optimal convex partition of a random polygon using
|
computes an approximately optimal convex partition of a random polygon using
|
||||||
Greene's approximation algorithm and checks the validity of the partition
|
Greene's approximation algorithm and checks the validity of the partition
|
||||||
afterwards.
|
afterwards.
|
||||||
|
|
||||||
file: examples/Partition_2/optimal_convex_ex.C
|
file: examples/Partition_2/optimal_convex_partition_2.C
|
||||||
----------------------------------------------
|
----------------------------------------------
|
||||||
|
|
||||||
Computes an optimal convex partition of a particular polygon and checks the
|
Computes an optimal convex partition of a particular polygon and checks the
|
||||||
|
|
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
// file: examples/Partition_2/approx_convex_ex.C
|
// file: examples/Partition_2/approx_convex_partition.C
|
||||||
|
|
||||||
#include <CGAL/basic.h>
|
#include <CGAL/basic.h>
|
||||||
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
// file: examples/Partition_2/greene_approx_convex_ex.C
|
// file: examples/Partition_2/greene_approx_convex_partition_2.C
|
||||||
|
|
||||||
#include <CGAL/basic.h>
|
#include <CGAL/basic.h>
|
||||||
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
// file: examples/Partition_2/optimal_convex_ex.C
|
// file: examples/Partition_2/optimal_convex_partition_2.C
|
||||||
|
|
||||||
#include <CGAL/basic.h>
|
#include <CGAL/basic.h>
|
||||||
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
// file: examples/Partition_2/y_monotone_ex.C
|
// file: examples/Partition_2/y_monotone_partition_2.C
|
||||||
|
|
||||||
#include <CGAL/basic.h>
|
#include <CGAL/basic.h>
|
||||||
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
||||||
Loading…
Reference in New Issue