cgal/Partition_2/examples/Partition_2
Laurent Rineau 3a223ebd1e cmake_minimum_required(VERSION 3.12...3.29) 2024-06-06 20:19:44 +02:00
..
CMakeLists.txt cmake_minimum_required(VERSION 3.12...3.29) 2024-06-06 20:19:44 +02:00
README Changed names of examamples 2006-03-09 11:29:27 +00:00
approx_convex_partition_2.cpp cleanup 2019-04-24 11:28:18 +02:00
greene_approx_convex_partition_2.cpp cleanup 2019-04-24 11:28:18 +02:00
optimal_convex_partition_2.cpp extra run of the script to remove tabs and trailing whitespaces 2020-03-26 14:16:06 +01:00
y_monotone_partition_2.cpp extra run of the script to remove tabs and trailing whitespaces 2020-03-26 14:16:06 +01:00
y_monotone_partition_indices_2.cpp extra run of the script to remove tabs and trailing whitespaces 2020-03-26 14:16:06 +01:00

README

examples/Partition_2/y_monotone_partition_2.C
------------------------------------

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 
partition of the original polygon.

file: examples/Partition_2/approx_convex_partition_2.C
---------------------------------------------

computes an approximately optimal convex partition of a random polygon and 
checks the validity of the partition afterwards.

file: examples/Partition_2/greene_approx_convex_partition_2.C
----------------------------------------------------

computes an approximately optimal convex partition of a random polygon using 
Greene's approximation algorithm and checks the validity of the partition 
afterwards.

file: examples/Partition_2/optimal_convex_partition_2.C
----------------------------------------------

Computes an optimal convex partition of a particular polygon and checks the 
validity of the partition afterwards.

NOTE:  The assertions in these programs are superfluous unless postcondition 
checking has been turned off.