123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205 |
- // Boost.Polygon library voronoi_benchmark.cpp file
- // Copyright Andrii Sydorchuk 2010-2012.
- // Distributed under the Boost Software License, Version 1.0.
- // (See accompanying file LICENSE_1_0.txt or copy at
- // http://www.boost.org/LICENSE_1_0.txt)
- // See http://www.boost.org for updates, documentation, and revision history.
- #include <algorithm>
- #include <iomanip>
- #include <iostream>
- #include <fstream>
- #include <numeric>
- #include <vector>
- #include <utility>
- #include <boost/random/mersenne_twister.hpp>
- #include <boost/timer/timer.hpp>
- typedef boost::int32_t int32;
- using boost::timer::cpu_times;
- using boost::timer::nanosecond_type;
- // Include for the Boost.Polygon Voronoi library.
- #include <boost/polygon/voronoi.hpp>
- typedef boost::polygon::voronoi_diagram<double> VD_BOOST;
- // Includes for the CGAL library.
- #include <CGAL/Simple_cartesian.h>
- #include <CGAL/Segment_Delaunay_graph_filtered_traits_2.h>
- #include <CGAL/Segment_Delaunay_graph_2.h>
- typedef CGAL::Simple_cartesian<double> K;
- typedef CGAL::Segment_Delaunay_graph_filtered_traits_without_intersections_2<K> GT;
- typedef CGAL::Segment_Delaunay_graph_2<GT> SDT_CGAL;
- typedef SDT_CGAL::Point_2 Point_CGAL;
- typedef SDT_CGAL::Site_2 Site_CGAL;
- // Include for the Boost.Polygon library.
- #include <boost/polygon/polygon.hpp>
- typedef boost::polygon::point_data<int32> POINT_POLYGON;
- typedef boost::polygon::segment_data<int32> SEGMENT_POLYGON;
- typedef std::vector<SEGMENT_POLYGON> SSD_POLYGON;
- const int RANDOM_SEED = 27;
- const int NUM_TESTS = 6;
- const int NUM_SEGMENTS[] = {10, 100, 1000, 10000, 100000, 1000000};
- const int NUM_RUNS[] = {100000, 10000, 1000, 100, 10, 1};
- std::ofstream bf("benchmark_segments.txt",
- std::ios_base::out | std::ios_base::app);
- boost::timer::cpu_timer timer;
- void format_line(int num_points, int num_tests, double time_per_test) {
- bf << "| " << std::setw(16) << num_points << " ";
- bf << "| " << std::setw(15) << num_tests << " ";
- bf << "| " << std::setw(17) << time_per_test << " ";
- bf << "|" << std::endl;
- }
- double get_elapsed_secs() {
- cpu_times elapsed_times(timer.elapsed());
- return 1E-9 * static_cast<double>(
- elapsed_times.system + elapsed_times.user);
- }
- void clean_segment_set(std::vector<SEGMENT_POLYGON>* data) {
- typedef int32 Unit;
- typedef boost::polygon::scanline_base<Unit>::Point Point;
- typedef boost::polygon::scanline_base<Unit>::half_edge half_edge;
- typedef int segment_id;
- std::vector<std::pair<half_edge, segment_id> > half_edges;
- std::vector<std::pair<half_edge, segment_id> > half_edges_out;
- segment_id id = 0;
- half_edges.reserve(data->size());
- for (std::vector<SEGMENT_POLYGON>::iterator it = data->begin();
- it != data->end(); ++it) {
- POINT_POLYGON l = it->low();
- POINT_POLYGON h = it->high();
- half_edges.push_back(std::make_pair(half_edge(l, h), id++));
- }
- half_edges_out.reserve(half_edges.size());
- // Apparently no need to pre-sort data when calling validate_scan.
- boost::polygon::line_intersection<Unit>::validate_scan(
- half_edges_out, half_edges.begin(), half_edges.end());
- std::vector<SEGMENT_POLYGON> result;
- result.reserve(half_edges_out.size());
- for (std::size_t i = 0; i < half_edges_out.size(); ++i) {
- id = half_edges_out[i].second;
- POINT_POLYGON l = half_edges_out[i].first.first;
- POINT_POLYGON h = half_edges_out[i].first.second;
- SEGMENT_POLYGON orig_seg = data->at(id);
- if (orig_seg.high() < orig_seg.low())
- std::swap(l, h);
- result.push_back(SEGMENT_POLYGON(l, h));
- }
- std::swap(result, *data);
- }
- std::vector<double> get_intersection_runtime() {
- std::vector<double> running_times;
- boost::mt19937 gen(RANDOM_SEED);
- for (int i = 0; i < NUM_TESTS; ++i) {
- timer.start();
- for (int j = 0; j < NUM_RUNS[i]; ++j) {
- SSD_POLYGON ssd;
- for (int k = 0; k < NUM_SEGMENTS[i]; ++k) {
- int32 x1 = gen();
- int32 y1 = gen();
- int32 dx = (gen() & 1023) + 1;
- int32 dy = (gen() & 1023) + 1;
- ssd.push_back(SEGMENT_POLYGON(
- POINT_POLYGON(x1, y1), POINT_POLYGON(x1 + dx, y1 + dy)));
- }
- clean_segment_set(&ssd);
- }
- running_times.push_back(get_elapsed_secs());
- }
- return running_times;
- }
- void run_boost_voronoi_test(const std::vector<double> &running_times) {
- boost::mt19937 gen(RANDOM_SEED);
- bf << "Boost.Polygon Voronoi of Segments:\n";
- for (int i = 0; i < NUM_TESTS; ++i) {
- timer.start();
- for (int j = 0; j < NUM_RUNS[i]; ++j) {
- SSD_POLYGON ssd;
- VD_BOOST vd;
- for (int k = 0; k < NUM_SEGMENTS[i]; ++k) {
- int32 x1 = gen();
- int32 y1 = gen();
- int32 dx = (gen() & 1023) + 1;
- int32 dy = (gen() & 1023) + 1;
- ssd.push_back(SEGMENT_POLYGON(
- POINT_POLYGON(x1, y1),
- POINT_POLYGON(x1 + dx, y1 + dy)));
- }
- clean_segment_set(&ssd);
- boost::polygon::construct_voronoi(ssd.begin(), ssd.end(), &vd);
- }
- double time_per_test =
- (get_elapsed_secs() - running_times[i]) / NUM_RUNS[i];
- format_line(NUM_SEGMENTS[i], NUM_RUNS[i], time_per_test);
- }
- bf << "\n";
- }
- void run_cgal_delaunay_test(const std::vector<double> &running_times) {
- boost::mt19937 gen(RANDOM_SEED);
- bf << "CGAL Triangulation of Segments:\n";
- for (int i = 0; i < NUM_TESTS; ++i) {
- timer.start();
- for (int j = 0; j < NUM_RUNS[i]; ++j) {
- SSD_POLYGON ssd;
- for (int k = 0; k < NUM_SEGMENTS[i]; ++k) {
- int32 x1 = gen();
- int32 y1 = gen();
- int32 dx = (gen() & 1023) + 1;
- int32 dy = (gen() & 1023) + 1;
- ssd.push_back(SEGMENT_POLYGON(
- POINT_POLYGON(x1, y1),
- POINT_POLYGON(x1 + dx, y1 + dy)));
- }
- clean_segment_set(&ssd);
- typedef std::vector<Point_CGAL> Points_container;
- typedef std::vector<Points_container>::size_type Index_type;
- typedef std::vector< std::pair<Index_type, Index_type> > Constraints_container;
- Points_container points;
- Constraints_container constraints;
- points.reserve(ssd.size() * 2);
- constraints.reserve(ssd.size());
- for (SSD_POLYGON::iterator it = ssd.begin(); it != ssd.end(); ++it) {
- points.push_back(Point_CGAL(
- boost::polygon::x(it->low()),
- boost::polygon::y(it->low())));
- points.push_back(Point_CGAL(
- boost::polygon::x(it->high()),
- boost::polygon::y(it->high())));
- constraints.push_back(
- std::make_pair(points.size() - 2, points.size() - 1));
- }
- SDT_CGAL sdg;
- sdg.insert_segments(
- points.begin(), points.end(),
- constraints.begin(), constraints.end());
- }
- double time_per_test =
- (get_elapsed_secs() - running_times[i]) / NUM_RUNS[i];
- format_line(NUM_SEGMENTS[i], NUM_RUNS[i], time_per_test);
- }
- bf << "\n";
- }
- int main() {
- bf << std::setiosflags(std::ios::right | std::ios::fixed)
- << std::setprecision(6);
- std::vector<double> running_times = get_intersection_runtime();
- run_boost_voronoi_test(running_times);
- run_cgal_delaunay_test(running_times);
- bf.close();
- return 0;
- }
|