mirror of https://github.com/CGAL/cgal
removed
This commit is contained in:
Efi Fogel
parent
0f7cb5c709
commit
f7d030111b
|
|
@ -1,168 +0,0 @@
|
|||
#include <CGAL/Exact_rational.h>
|
||||
|
||||
// leda_rational, or Gmpq, or Quotient<MP_float>
|
||||
typedef CGAL::Exact_rational Rational;
|
||||
|
||||
#include <CGAL/Cartesian.h>
|
||||
#include <CGAL/minkowski_sum_2.h>
|
||||
#include <CGAL/Small_side_angle_bisector_decomposition_2.h>
|
||||
#include <CGAL/Polygon_convex_decomposition_2.h>
|
||||
#include <CGAL/Boolean_set_operations_2.h>
|
||||
#include "read_polygon.h"
|
||||
#include <cstring>
|
||||
|
||||
#include <list>
|
||||
|
||||
// instead of
|
||||
//typedef CGAL::Cartesian<Rational> Kernel;
|
||||
// workaround for VC++
|
||||
struct Kernel : public CGAL::Cartesian<Rational> {};
|
||||
|
||||
typedef Kernel::Point_2 Point_2;
|
||||
typedef Kernel::Segment_2 Segment_2;
|
||||
typedef CGAL::Polygon_2<Kernel> Polygon_2;
|
||||
typedef CGAL::Polygon_with_holes_2<Kernel> Polygon_with_holes_2;
|
||||
|
||||
/*! Check if two polygons with holes are the same. */
|
||||
bool are_equal (const Polygon_with_holes_2& ph1,
|
||||
const Polygon_with_holes_2& ph2)
|
||||
{
|
||||
std::list<Polygon_with_holes_2> sym_diff;
|
||||
|
||||
CGAL::symmetric_difference (ph1, ph2,
|
||||
std::back_inserter(sym_diff));
|
||||
|
||||
return (sym_diff.empty());
|
||||
}
|
||||
|
||||
/*! The main program. */
|
||||
int main (int argc, char **argv)
|
||||
{
|
||||
// Read the input file. Because of the structure of the *.cmd file
|
||||
// (which is concatenated to the command line) we need to get all the
|
||||
// inputs in one command line. This is the reason we read triplets/pairs of
|
||||
// arguments. Each triplet/double is one input for the program.
|
||||
if (argc < 3)
|
||||
{
|
||||
std::cerr << "Usage: " << argv[0] << ". The input are triplets of:"
|
||||
<< " <polygon#1> <polygon#2> [decomposition flags]"
|
||||
<< std::endl;
|
||||
return (1);
|
||||
}
|
||||
|
||||
int i = 1;
|
||||
while (i < argc)
|
||||
{
|
||||
// Read the polygons from the input files.
|
||||
Polygon_2 pgn1, pgn2;
|
||||
|
||||
if (! read_polygon (argv[i], pgn1))
|
||||
{
|
||||
std::cerr << "Failed to read: <" << argv[i] << ">." << std::endl;
|
||||
return (1);
|
||||
}
|
||||
|
||||
if (! read_polygon (argv[i+1], pgn2))
|
||||
{
|
||||
std::cerr << "Failed to read: <" << argv[i+1] << ">." << std::endl;
|
||||
return (1);
|
||||
}
|
||||
|
||||
std::cout << "Testing " << argv[i] << " and " << argv[i+1] << std::endl;
|
||||
|
||||
// Read the decomposition flags.
|
||||
bool use_ssab = true;
|
||||
bool use_opt = true;
|
||||
bool use_hm = true;
|
||||
bool use_greene = true;
|
||||
|
||||
if (i+2 < argc && argv[i+2][0] == '-')
|
||||
{
|
||||
use_ssab = (std::strchr (argv[i+2], 's') != NULL);
|
||||
use_opt = (std::strchr (argv[i+2], 'o') != NULL);
|
||||
use_hm = (std::strchr (argv[i+2], 'h') != NULL);
|
||||
use_greene = (std::strchr (argv[i+2], 'g') != NULL);
|
||||
}
|
||||
|
||||
// Compute the Minkowski sum using the convolution method.
|
||||
Polygon_with_holes_2 sum_conv;
|
||||
|
||||
std::cout << "Using the convolution method ... ";
|
||||
sum_conv = minkowski_sum_2 (pgn1, pgn2);
|
||||
std::cout << "Done." << std::endl;
|
||||
|
||||
// Define auxiliary polygon-decomposition objects.
|
||||
CGAL::Small_side_angle_bisector_decomposition_2<Kernel> ssab_decomp;
|
||||
CGAL::Optimal_convex_decomposition_2<Kernel> opt_decomp;
|
||||
CGAL::Hertel_Mehlhorn_convex_decomposition_2<Kernel> hm_approx_decomp;
|
||||
CGAL::Greene_convex_decomposition_2<Kernel> greene_decomp;
|
||||
Polygon_with_holes_2 sum_decomp;
|
||||
|
||||
if (use_ssab)
|
||||
{
|
||||
std::cout << "Using the small-side angle-bisector decomposition ... ";
|
||||
sum_decomp = minkowski_sum_2 (pgn1, pgn2, ssab_decomp);
|
||||
if (are_equal (sum_conv, sum_decomp))
|
||||
{
|
||||
std::cout << "OK." << std::endl;
|
||||
}
|
||||
else
|
||||
{
|
||||
std::cout << "ERROR (different result)." << std::endl;
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
if (use_opt)
|
||||
{
|
||||
std::cout << "Using the optimal convex decomposition ... ";
|
||||
sum_decomp = minkowski_sum_2 (pgn1, pgn2, opt_decomp);
|
||||
if (are_equal (sum_conv, sum_decomp))
|
||||
{
|
||||
std::cout << "OK." << std::endl;
|
||||
}
|
||||
else
|
||||
{
|
||||
std::cout << "ERROR (different result)." << std::endl;
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
if (use_hm)
|
||||
{
|
||||
std::cout << "Using the Hertel--Mehlhorn decomposition ... ";
|
||||
sum_decomp = minkowski_sum_2 (pgn1, pgn2, hm_approx_decomp);
|
||||
if (are_equal (sum_conv, sum_decomp))
|
||||
{
|
||||
std::cout << "OK." << std::endl;
|
||||
}
|
||||
else
|
||||
{
|
||||
std::cout << "ERROR (different result)." << std::endl;
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
if (use_greene)
|
||||
{
|
||||
std::cout << "Using the Greene decomposition ... ";
|
||||
sum_decomp = minkowski_sum_2 (pgn1, pgn2, greene_decomp);
|
||||
if (are_equal (sum_conv, sum_decomp))
|
||||
{
|
||||
std::cout << "OK." << std::endl;
|
||||
}
|
||||
else
|
||||
{
|
||||
std::cout << "ERROR (different result)." << std::endl;
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
|
||||
if (i+2 < argc && argv[i+2][0] == '-')
|
||||
i += 3;
|
||||
else
|
||||
i += 2;
|
||||
}
|
||||
|
||||
return (0);
|
||||
}
|
||||
Loading…
Reference in New Issue