songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Remove benchmark directory for now, testsuite also does timing

This commit is contained in:
Sebastian Morr 2014-08-11 13:39:38 +02:00
parent 2630936c49
commit 427fd6e2db
2 changed files with 0 additions and 123 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

53
Minkowski_sum_2/benchmark/Minkowski_sum_2/print_utils.h
View File

@ -1,53 +0,0 @@
#ifndef _PRINT_UTILS_H_
#define _PRINT_UTILS_H_
#include <CGAL/Polygon_with_holes_2.h>
#include <iostream>
//-----------------------------------------------------------------------------
// Pretty-print a CGAL polygon.
//
template<class Kernel, class Container>
void print_polygon (const CGAL::Polygon_2<Kernel, Container>& P)
{
typename CGAL::Polygon_2<Kernel, Container>::Vertex_const_iterator vit;
std::cout << "[ " << P.size() << " vertices:";
for (vit = P.vertices_begin(); vit != P.vertices_end(); ++vit)
std::cout << " (" << *vit << ')';
std::cout << " ]" << std::endl;
return;
}
//-----------------------------------------------------------------------------
// Pretty-print a polygon with holes.
//
template<class Kernel, class Container>
void print_polygon_with_holes
(const CGAL::Polygon_with_holes_2<Kernel, Container>& pwh)
{
if (! pwh.is_unbounded())
{
std::cout << "{ Outer boundary = ";
print_polygon (pwh.outer_boundary());
}
else
std::cout << "{ Unbounded polygon." << std::endl;
typename CGAL::Polygon_with_holes_2<Kernel,Container>::
Hole_const_iterator hit;
unsigned int k = 1;
std::cout << " " << pwh.number_of_holes() << " holes:" << std::endl;
for (hit = pwh.holes_begin(); hit != pwh.holes_end(); ++hit, ++k)
{
std::cout << " Hole #" << k << " = ";
print_polygon (*hit);
}
std::cout << " }" << std::endl;
return;
}
#endif

70
Minkowski_sum_2/benchmark/Minkowski_sum_2/sum_by_decomposition.cpp
View File

@ -1,70 +0,0 @@
//! \file examples/Minkowski_sum_2/sum_by_decomposition.cpp
// Computing the Minkowski sum of two non-convex polygons read from a file
// using the small-side angle-bisector decomposition strategy.
#include <CGAL/Exact_predicates_exact_constructions_kernel.h>
#include <CGAL/minkowski_sum_2.h>
#include <CGAL/Small_side_angle_bisector_decomposition_2.h>
#include <iostream>
#include <fstream>
#include <CGAL/Timer.h>
#include "print_utils.h"
struct Kernel : public CGAL::Exact_predicates_exact_constructions_kernel {};
typedef Kernel::Point_2 Point_2;
typedef CGAL::Polygon_2<Kernel> Polygon_2;
typedef CGAL::Polygon_with_holes_2<Kernel> Polygon_with_holes_2;
int main (int argc, char * argv[])
{
CGAL::Timer t_mink_sum;
if (argc < 3)
{
std::cerr << "Usage: " << argv[0]
<< " <polygon#1> <polygon#2>"
<< std::endl;
return (1);
}
std::ifstream in_file1 (argv[1]);
if (! in_file1.is_open())
{
std::cerr << "Failed to open the input file 1." << std::endl;
return (1);
}
// Read the two polygons from the files and compute their Minkowski sum.
Polygon_2 P, Q;
in_file1 >> P;
in_file1.close();
std::ifstream in_file2 (argv[2]);
if (! in_file2.is_open())
{
std::cerr << "Failed to open the input file 2." << std::endl;
return (1);
}
in_file2 >> Q;
in_file2.close();
// Compute the Minkowski sum using the decomposition approach.
CGAL::Small_side_angle_bisector_decomposition_2<Kernel> ssab_decomp;
t_mink_sum.start();
Polygon_with_holes_2 sum = minkowski_sum_2 (P, Q, ssab_decomp);
t_mink_sum.stop();
std::cout << "Done! Time:" << t_mink_sum.time() << " seconds\n P (+) Q = "; print_polygon_with_holes (sum);
return (0);
}