EQ2EMu/EQ2/source/depends/boost_1_72_0/libs/polygon/test/voronoi_builder_test.cpp

// Boost.Polygon library voronoi_builder_test.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 "voronoi_test_helper.hpp"
#include <boost/core/lightweight_test.hpp>
#include <boost/polygon/polygon.hpp>
#include <boost/polygon/voronoi.hpp>
#include <boost/random/mersenne_twister.hpp>
#include <limits>
#include <list>
#include <vector>
#include <ctime>

using boost::polygon::voronoi_builder;
using boost::polygon::voronoi_diagram;

typedef voronoi_diagram<double> vd_type;
typedef vd_type::coordinate_type coordinate_type;
typedef vd_type::edge_type voronoi_edge_type;
typedef vd_type::const_cell_iterator const_cell_iterator;
typedef vd_type::const_vertex_iterator const_vertex_iterator;

#define CHECK_OUTPUT_SIZE(output, cells, vertices, edges) \
    BOOST_TEST_EQ(output.num_cells(), (std::size_t)cells); \
    BOOST_TEST_EQ(output.num_vertices(), (std::size_t)vertices); \
    BOOST_TEST_EQ(output.num_edges(), (std::size_t)edges)

#define VERIFY_OUTPUT(output) \
    BOOST_TEST(voronoi_test_helper::verify_output(output, \
        voronoi_test_helper::CELL_CONVEXITY)); \
    BOOST_TEST(voronoi_test_helper::verify_output(output, \
        voronoi_test_helper::INCIDENT_EDGES_CCW_ORDER)); \
    BOOST_TEST(voronoi_test_helper::verify_output(output, \
        voronoi_test_helper::NO_HALF_EDGE_INTERSECTIONS))

#define VERIFY_NO_HALF_EDGE_INTERSECTIONS(output) \
    BOOST_TEST(voronoi_test_helper::verify_output(output, \
        voronoi_test_helper::NO_HALF_EDGE_INTERSECTIONS))

// Sites: (0, 0).
void single_site_test()
{
  std::vector< point_data<int> > points;
  points.push_back(point_data<int>(0, 0));
  vd_type test_output;
  construct_voronoi(points.begin(), points.end(), &test_output);
  VERIFY_OUTPUT(test_output);

  BOOST_TEST(test_output.cells().size() == 1);
  CHECK_OUTPUT_SIZE(test_output, 1, 0, 0);

  const_cell_iterator it = test_output.cells().begin();
  BOOST_TEST(it->incident_edge() == NULL);
}

// Sites: (0, 0), (0, 1).
void collinear_sites_test1()
{
  std::vector< point_data<int> > points;
  points.push_back(point_data<int>(0, 0));
  points.push_back(point_data<int>(0, 1));
  vd_type test_output;
  construct_voronoi(points.begin(), points.end(), &test_output);
  VERIFY_OUTPUT(test_output);
  CHECK_OUTPUT_SIZE(test_output, 2, 0, 2);

  const_cell_iterator cell_it = test_output.cells().begin();
  cell_it++;

  const voronoi_edge_type* edge1_1 = cell_it->incident_edge();
  const voronoi_edge_type* edge1_2 = edge1_1->twin();

  BOOST_TEST(edge1_1->twin() == edge1_2);
  BOOST_TEST(edge1_2->twin() == edge1_1);

  BOOST_TEST(edge1_1->next() == edge1_1);
  BOOST_TEST(edge1_1->prev() == edge1_1);
  BOOST_TEST(edge1_1->rot_next() == edge1_2);
  BOOST_TEST(edge1_1->rot_prev() == edge1_2);

  BOOST_TEST(edge1_2->next() == edge1_2);
  BOOST_TEST(edge1_2->prev() == edge1_2);
  BOOST_TEST(edge1_2->rot_next() == edge1_1);
  BOOST_TEST(edge1_2->rot_prev() == edge1_1);
}

// Sites: (0, 0), (1, 1), (2, 2).
void collinear_sites_test2()
{
  std::vector< point_data<int> > points;
  points.push_back(point_data<int>(0, 0));
  points.push_back(point_data<int>(1, 1));
  points.push_back(point_data<int>(2, 2));
  vd_type test_output;
  construct_voronoi(points.begin(), points.end(), &test_output);
  VERIFY_OUTPUT(test_output);
  CHECK_OUTPUT_SIZE(test_output, 3, 0, 4);

  const_cell_iterator cell_it = test_output.cells().begin();
  const voronoi_edge_type* edge1_1 = cell_it->incident_edge();
  const voronoi_edge_type* edge1_2 = edge1_1->twin();
  cell_it++;
  cell_it++;
  const voronoi_edge_type* edge2_2 = cell_it->incident_edge();
  const voronoi_edge_type* edge2_1 = edge2_2->twin();

  BOOST_TEST(edge1_1->twin() == edge1_2 && edge1_2->twin() == edge1_1);
  BOOST_TEST(edge2_1->twin() == edge2_2 && edge2_2->twin() == edge2_1);

  BOOST_TEST(edge1_1->next() == edge1_1 && edge1_1->prev() == edge1_1);
  BOOST_TEST(edge1_2->next() == edge2_1 && edge1_2->prev() == edge2_1);
  BOOST_TEST(edge2_1->next() == edge1_2 && edge2_1->prev() == edge1_2);
  BOOST_TEST(edge2_2->next() == edge2_2 && edge2_2->prev() == edge2_2);

  BOOST_TEST(edge1_1->rot_next() == edge1_2 && edge1_1->rot_prev() == edge2_1);
  BOOST_TEST(edge1_2->rot_next() == edge2_2 && edge1_2->rot_prev() == edge1_1);
  BOOST_TEST(edge2_1->rot_next() == edge1_1 && edge2_1->rot_prev() == edge2_2);
  BOOST_TEST(edge2_2->rot_next() == edge2_1 && edge2_2->rot_prev() == edge1_2);

  BOOST_TEST(edge1_2->next() == edge2_1 && edge1_2->prev() == edge2_1);
  BOOST_TEST(edge2_1->next() == edge1_2 && edge2_1->prev() == edge1_2);
}

// Sites: (0, 0), (0, 4), (2, 1).
void triangle_test1()
{
  point_data<int> point1(0, 0);
  point_data<int> point2(0, 4);
  point_data<int> point3(2, 1);
  std::vector< point_data<int> > points;
  points.push_back(point1);
  points.push_back(point2);
  points.push_back(point3);
  vd_type test_output;
  construct_voronoi(points.begin(), points.end(), &test_output);
  VERIFY_OUTPUT(test_output);
  CHECK_OUTPUT_SIZE(test_output, 3, 1, 6);

  const_vertex_iterator it = test_output.vertices().begin();
  BOOST_TEST_EQ(it->x(), 0.25);
  BOOST_TEST_EQ(it->y(), 2.0);

  const voronoi_edge_type* edge1_1 = it->incident_edge();
  const voronoi_edge_type* edge1_2 = edge1_1->twin();
  BOOST_TEST(edge1_1->cell()->source_index() == 1);
  BOOST_TEST(edge1_2->cell()->source_index() == 2);

  const voronoi_edge_type* edge2_1 = edge1_1->rot_prev();
  const voronoi_edge_type* edge2_2 = edge2_1->twin();
  BOOST_TEST(edge2_1->cell()->source_index() == 2);
  BOOST_TEST(edge2_2->cell()->source_index() == 0);

  const voronoi_edge_type* edge3_1 = edge2_1->rot_prev();
  const voronoi_edge_type* edge3_2 = edge3_1->twin();
  BOOST_TEST(edge3_1->cell()->source_index() == 0);
  BOOST_TEST(edge3_2->cell()->source_index() == 1);

  BOOST_TEST(edge1_2->twin() == edge1_1);
  BOOST_TEST(edge2_2->twin() == edge2_1);
  BOOST_TEST(edge3_2->twin() == edge3_1);

  BOOST_TEST(edge1_1->prev() == edge3_2 && edge1_1->next() == edge3_2);
  BOOST_TEST(edge2_1->prev() == edge1_2 && edge2_1->next() == edge1_2);
  BOOST_TEST(edge3_1->prev() == edge2_2 && edge3_1->next() == edge2_2);

  BOOST_TEST(edge1_2->next() == edge2_1 && edge1_2->prev() == edge2_1);
  BOOST_TEST(edge2_2->next() == edge3_1 && edge2_2->prev() == edge3_1);
  BOOST_TEST(edge3_2->next() == edge1_1 && edge3_2->prev() == edge1_1);

  BOOST_TEST(edge1_1->rot_next() == edge3_1);
  BOOST_TEST(edge3_1->rot_next() == edge2_1);
  BOOST_TEST(edge2_1->rot_next() == edge1_1);

  BOOST_TEST(edge1_2->rot_next() == edge2_2);
  BOOST_TEST(edge2_2->rot_next() == edge3_2);
  BOOST_TEST(edge3_2->rot_next() == edge1_2);
}

// Sites: (0, 1), (2, 0), (2, 4).
void triangle_test2()
{
  point_data<int> point1(0, 1);
  point_data<int> point2(2, 0);
  point_data<int> point3(2, 4);
  std::vector< point_data<int> > points;
  points.push_back(point1);
  points.push_back(point2);
  points.push_back(point3);
  vd_type test_output;
  construct_voronoi(points.begin(), points.end(), &test_output);
  VERIFY_OUTPUT(test_output);
  CHECK_OUTPUT_SIZE(test_output, 3, 1, 6);

  const_vertex_iterator it = test_output.vertices().begin();
  BOOST_TEST_EQ(it->x(), 1.75);
  BOOST_TEST_EQ(it->y(), 2.0);

  const voronoi_edge_type* edge1_1 = it->incident_edge();
  const voronoi_edge_type* edge1_2 = edge1_1->twin();
  BOOST_TEST(edge1_1->cell()->source_index() == 2);
  BOOST_TEST(edge1_2->cell()->source_index() == 1);

  const voronoi_edge_type* edge2_1 = edge1_1->rot_prev();
  const voronoi_edge_type* edge2_2 = edge2_1->twin();
  BOOST_TEST(edge2_1->cell()->source_index() == 1);
  BOOST_TEST(edge2_2->cell()->source_index() == 0);

  const voronoi_edge_type* edge3_1 = edge2_1->rot_prev();
  const voronoi_edge_type* edge3_2 = edge3_1->twin();
  BOOST_TEST(edge3_1->cell()->source_index() == 0);
  BOOST_TEST(edge3_2->cell()->source_index() == 2);

  BOOST_TEST(edge1_2->twin() == edge1_1);
  BOOST_TEST(edge2_2->twin() == edge2_1);
  BOOST_TEST(edge3_2->twin() == edge3_1);

  BOOST_TEST(edge1_1->prev() == edge3_2 && edge1_1->next() == edge3_2);
  BOOST_TEST(edge2_1->prev() == edge1_2 && edge2_1->next() == edge1_2);
  BOOST_TEST(edge3_1->prev() == edge2_2 && edge3_1->next() == edge2_2);

  BOOST_TEST(edge1_2->next() == edge2_1 && edge1_2->prev() == edge2_1);
  BOOST_TEST(edge2_2->next() == edge3_1 && edge2_2->prev() == edge3_1);
  BOOST_TEST(edge3_2->next() == edge1_1 && edge3_2->prev() == edge1_1);

  BOOST_TEST(edge1_1->rot_next() == edge3_1);
  BOOST_TEST(edge3_1->rot_next() == edge2_1);
  BOOST_TEST(edge2_1->rot_next() == edge1_1);

  BOOST_TEST(edge1_2->rot_next() == edge2_2);
  BOOST_TEST(edge2_2->rot_next() == edge3_2);
  BOOST_TEST(edge3_2->rot_next() == edge1_2);
}

// Sites: (0, 0), (0, 1), (1, 0), (1, 1).
void square_test1()
{
  point_data<int> point1(0, 0);
  point_data<int> point2(0, 1);
  point_data<int> point3(1, 0);
  point_data<int> point4(1, 1);
  std::vector< point_data<int> > points;
  points.push_back(point1);
  points.push_back(point2);
  points.push_back(point3);
  points.push_back(point4);
  vd_type test_output;
  construct_voronoi(points.begin(), points.end(), &test_output);
  VERIFY_OUTPUT(test_output);
  CHECK_OUTPUT_SIZE(test_output, 4, 1, 8);

  // Check voronoi vertex.
  const_vertex_iterator it = test_output.vertices().begin();
  BOOST_TEST_EQ(it->x(), 0.5);
  BOOST_TEST_EQ(it->y(), 0.5);

  // Check voronoi edges.
  const voronoi_edge_type* edge1_1 = it->incident_edge();
  const voronoi_edge_type* edge1_2 = edge1_1->twin();
  BOOST_TEST(edge1_1->cell()->source_index() == 3);
  BOOST_TEST(edge1_2->cell()->source_index() == 2);

  const voronoi_edge_type* edge2_1 = edge1_1->rot_prev();
  const voronoi_edge_type* edge2_2 = edge2_1->twin();
  BOOST_TEST(edge2_1->cell()->source_index() == 2);
  BOOST_TEST(edge2_2->cell()->source_index() == 0);

  const voronoi_edge_type* edge3_1 = edge2_1->rot_prev();
  const voronoi_edge_type* edge3_2 = edge3_1->twin();
  BOOST_TEST(edge3_1->cell()->source_index() == 0);
  BOOST_TEST(edge3_2->cell()->source_index() == 1);

  const voronoi_edge_type* edge4_1 = edge3_1->rot_prev();
  const voronoi_edge_type* edge4_2 = edge4_1->twin();
  BOOST_TEST(edge4_1->cell()->source_index() == 1);
  BOOST_TEST(edge4_2->cell()->source_index() == 3);

  BOOST_TEST(edge1_2->twin() == edge1_1);
  BOOST_TEST(edge2_2->twin() == edge2_1);
  BOOST_TEST(edge3_2->twin() == edge3_1);
  BOOST_TEST(edge4_2->twin() == edge4_1);

  BOOST_TEST(edge1_1->prev() == edge4_2 && edge1_1->next() == edge4_2);
  BOOST_TEST(edge2_1->prev() == edge1_2 && edge2_1->next() == edge1_2);
  BOOST_TEST(edge3_1->prev() == edge2_2 && edge3_1->next() == edge2_2);
  BOOST_TEST(edge4_1->prev() == edge3_2 && edge4_1->next() == edge3_2);

  BOOST_TEST(edge1_2->next() == edge2_1 && edge1_2->prev() == edge2_1);
  BOOST_TEST(edge2_2->next() == edge3_1 && edge2_2->prev() == edge3_1);
  BOOST_TEST(edge3_2->next() == edge4_1 && edge3_2->prev() == edge4_1);
  BOOST_TEST(edge4_2->next() == edge1_1 && edge4_2->prev() == edge1_1);

  BOOST_TEST(edge1_1->rot_next() == edge4_1);
  BOOST_TEST(edge4_1->rot_next() == edge3_1);
  BOOST_TEST(edge3_1->rot_next() == edge2_1);
  BOOST_TEST(edge2_1->rot_next() == edge1_1);

  BOOST_TEST(edge1_2->rot_next() == edge2_2);
  BOOST_TEST(edge2_2->rot_next() == edge3_2);
  BOOST_TEST(edge3_2->rot_next() == edge4_2);
  BOOST_TEST(edge4_2->rot_next() == edge1_2);
}

#ifdef NDEBUG
void grid_test()
{
  vd_type test_output_small, test_output_large;
  std::vector< point_data<int> > point_vec_small, point_vec_large;
  int grid_size[] = {10, 33, 101};
  int max_value[] = {10, 33, 101};
  int array_length = sizeof(grid_size) / sizeof(int);
  for (int k = 0; k < array_length; k++) {
    test_output_small.clear();
    test_output_large.clear();
    point_vec_small.clear();
    point_vec_large.clear();
    int koef = (std::numeric_limits<int>::max)() / max_value[k];
    for (int i = 0; i < grid_size[k]; i++) {
      for (int j = 0; j < grid_size[k]; j++) {
        point_vec_small.push_back(point_data<int>(i, j));
        point_vec_large.push_back(point_data<int>(koef * i, koef * j));
      }
    }
    construct_voronoi(point_vec_small.begin(), point_vec_small.end(), &test_output_small);
    construct_voronoi(point_vec_large.begin(), point_vec_large.end(), &test_output_large);
    VERIFY_OUTPUT(test_output_small);
    VERIFY_OUTPUT(test_output_large);
    unsigned int num_cells = grid_size[k] * grid_size[k];
    unsigned int num_vertices = num_cells - 2 * grid_size[k] + 1;
    unsigned int num_edges = 4 * num_cells - 4 * grid_size[k];
    CHECK_OUTPUT_SIZE(test_output_small, num_cells, num_vertices, num_edges);
    CHECK_OUTPUT_SIZE(test_output_large, num_cells, num_vertices, num_edges);
  }
}
#endif

#ifdef NDEBUG
void random_test()
{
  boost::mt19937 gen(static_cast<unsigned int>(time(NULL)));
  vd_type test_output_small, test_output_large;
  std::vector< point_data<int> > point_vec_small, point_vec_large;
  int num_points[] = {10, 100, 1000, 10000};
  int num_runs[] = {1000, 100, 10, 1};
  int mod_koef[] = {10, 100, 100, 1000};
  int max_value[] = {5, 50, 50, 5000};
  int array_length = sizeof(num_points) / sizeof(int);
  for (int k = 0; k < array_length; k++) {
    int koef = (std::numeric_limits<int>::max)() / max_value[k];
    for (int i = 0; i < num_runs[k]; i++) {
      test_output_small.clear();
      test_output_large.clear();
      point_vec_small.clear();
      point_vec_large.clear();
      for (int j = 0; j < num_points[k]; j++) {
        int x = gen() % mod_koef[k] - mod_koef[k] / 2;
        int y = gen() % mod_koef[k] - mod_koef[k] / 2;
        point_vec_small.push_back(point_data<int>(x, y));
        point_vec_large.push_back(point_data<int>(koef * x, koef * y));
      }
      construct_voronoi(point_vec_small.begin(), point_vec_small.end(), &test_output_small);
      construct_voronoi(point_vec_large.begin(), point_vec_large.end(), &test_output_large);
      VERIFY_OUTPUT(test_output_small);
      VERIFY_OUTPUT(test_output_large);
      BOOST_TEST_EQ(test_output_small.num_cells(), test_output_large.num_cells());
      BOOST_TEST_EQ(test_output_small.num_vertices(), test_output_large.num_vertices());
      BOOST_TEST_EQ(test_output_small.num_edges(), test_output_large.num_edges());
    }
  }
}
#endif

void segment_sites_test1()
{
  vd_type test_output;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(0, 0);
  point_data<int> point2(1, 1);
  segments.push_back(segment_data<int>(point1, point2));
  construct_voronoi(segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 3, 0, 4);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_sites_test2()
{
  vd_type test_output;
  std::vector< point_data<int> > points;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(0, 0);
  point_data<int> point2(4, 4);
  point_data<int> point3(3, 1);
  point_data<int> point4(1, 3);
  segments.push_back(segment_data<int>(point1, point2));
  points.push_back(point3);
  points.push_back(point4);
  construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 5, 4, 16);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_sites_test3()
{
  vd_type test_output;
  std::vector< point_data<int> > points;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(4, 0);
  point_data<int> point2(0, 4);
  point_data<int> point3(3, 3);
  point_data<int> point4(1, 1);
  segments.push_back(segment_data<int>(point1, point2));
  points.push_back(point3);
  points.push_back(point4);
  construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 5, 4, 16);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_sites_test4()
{
  vd_type test_output;
  std::vector< point_data<int> > points;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(4, 0);
  point_data<int> point2(0, 4);
  point_data<int> point3(3, 2);
  point_data<int> point4(2, 3);
  segments.push_back(segment_data<int>(point1, point2));
  points.push_back(point3);
  points.push_back(point4);
  construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 5, 3, 14);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_site_test5()
{
  vd_type test_output;
  std::vector< point_data<int> > points;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(0, 0);
  point_data<int> point2(0, 8);
  point_data<int> point3(-2, -2);
  point_data<int> point4(-2, 4);
  point_data<int> point5(-2, 10);
  segments.push_back(segment_data<int>(point1, point2));
  points.push_back(point3);
  points.push_back(point4);
  points.push_back(point5);
  construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 6, 4, 18);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_site_test6()
{
  vd_type test_output;
  std::vector< point_data<int> > points;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(-1, 1);
  point_data<int> point2(1, 0);
  point_data<int> point3(1, 2);
  segments.push_back(segment_data<int>(point2, point3));
  points.push_back(point1);
  construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 4, 2, 10);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_site_test7()
{
  vd_type test_output;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(0, 0);
  point_data<int> point2(4, 0);
  point_data<int> point3(0, 4);
  point_data<int> point4(4, 4);
  segments.push_back(segment_data<int>(point1, point2));
  segments.push_back(segment_data<int>(point2, point3));
  segments.push_back(segment_data<int>(point3, point4));
  construct_voronoi(segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 7, 6, 24);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_site_test8()
{
  vd_type test_output;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(0, 0);
  point_data<int> point2(4, 0);
  point_data<int> point3(4, 4);
  point_data<int> point4(0, 4);
  segments.push_back(segment_data<int>(point1, point2));
  segments.push_back(segment_data<int>(point2, point3));
  segments.push_back(segment_data<int>(point3, point4));
  segments.push_back(segment_data<int>(point4, point1));
  construct_voronoi(segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 8, 5, 24);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

void segment_site_test9()
{
  vd_type test_output;
  std::vector< segment_data<int> > segments;
  point_data<int> point1(0, 0);
  point_data<int> point2(2, 0);
  point_data<int> point3(4, 0);
  segments.push_back(segment_data<int>(point1, point2));
  segments.push_back(segment_data<int>(point2, point3));
  construct_voronoi(segments.begin(), segments.end(), &test_output);
  CHECK_OUTPUT_SIZE(test_output, 5, 0, 8);
  VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
}

#ifdef NDEBUG
void segment_grid_test()
{
  vd_type test_output_small, test_output_large;
  std::vector< segment_data<int> > segments_small, segments_large;
  int grid_size[] = {10, 27, 53};
  int max_value[] = {100, 330, 1000};
  int array_length = sizeof(grid_size) / sizeof(int);
  for (int k = 0; k < array_length; k++) {
    test_output_small.clear();
    test_output_large.clear();
    segments_small.clear();
    segments_large.clear();
    int cur_sz = grid_size[k];
    int koef = (std::numeric_limits<int>::max)() / max_value[k];
    for (int i = 0; i < cur_sz + 1; i++)
      for (int j = 0; j < cur_sz; j++) {
        point_data<int> point1_1(10 * i, 10 * j);
        point_data<int> point1_2(koef * 10 * i, koef * 10 * j);
        point_data<int> point2_1(10 * i, 10 * j + 10);
        point_data<int> point2_2(koef * 10 * i, koef * (10 * j + 10));
        segments_small.push_back(segment_data<int>(point1_1, point2_1));
        segments_large.push_back(segment_data<int>(point1_2, point2_2));
        point_data<int> point3_1(10 * j, 10 * i);
        point_data<int> point3_2(koef * 10 * j, koef * 10 * i);
        point_data<int> point4_1(10 * j + 10, 10 * i);
        point_data<int> point4_2(koef * (10 * j + 10), koef * 10 * i);
        segments_small.push_back(segment_data<int>(point3_1, point4_1));
        segments_large.push_back(segment_data<int>(point3_2, point4_2));
      }
    construct_voronoi(segments_small.begin(), segments_small.end(), &test_output_small);
    construct_voronoi(segments_large.begin(), segments_large.end(), &test_output_large);
    VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output_small);
    VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output_large);
    BOOST_TEST_EQ(test_output_small.num_cells(), test_output_large.num_cells());
    BOOST_TEST_EQ(test_output_small.num_vertices(), test_output_large.num_vertices());
    BOOST_TEST_EQ(test_output_small.num_edges(), test_output_large.num_edges());
  }
}
#endif

#ifdef NDEBUG
void segment_random_test1()
{
  boost::mt19937 gen(static_cast<unsigned int>(time(NULL)));
  vd_type test_output;
  std::vector< point_data<int> > points;
  std::vector< segment_data<int> > segments;
  int num_runs = 1000;
  int num_segments = 10;
  points.push_back(point_data<int>(-100, -100));
  points.push_back(point_data<int>(-100, 100));
  points.push_back(point_data<int>(100, -100));
  points.push_back(point_data<int>(100, 100));
  for (int i = 0; i < num_runs; i++) {
    test_output.clear();
    segments.clear();
    for (int j = 0; j < num_segments; j++) {
      int x1 = 0, y1 = 0, x2 = 0, y2 = 0;
      while (x1 == x2 && y1 == y2) {
        x1 = (gen() % 100) - 50;
        y1 = (gen() % 100) - 50;
        x2 = (gen() % 100) - 50;
        y2 = (gen() % 100) - 50;
      }
      point_data<int> point1(x1, y1);
      point_data<int> point2(x2, y2);
      segments.push_back(segment_data<int>(point1, point2));
    }
    voronoi_test_helper::clean_segment_set(segments);
    construct_voronoi(points.begin(), points.end(), segments.begin(), segments.end(), &test_output);
    VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output);
  }
}
#endif

#ifdef NDEBUG
void segment_random_test2()
{
  boost::mt19937 gen(static_cast<unsigned int>(time(NULL)));
  vd_type test_output_small, test_output_large;
  std::vector< segment_data<int> > segments_small, segments_large;
  int num_segments[] = {5, 25, 125, 625};
  int num_runs[] = {1000, 100, 10, 1};
  int mod_koef1[] = {10, 100, 200, 300};
  int mod_koef2[] = {10, 20, 50, 100};
  int max_value[] = {10, 60, 125, 200};
  int array_length = sizeof(num_segments) / sizeof(int);
  for (int k = 0; k < array_length; k++) {
    int koef = (std::numeric_limits<int>::max)() / max_value[k];
    for (int i = 0; i < num_runs[k]; i++) {
      test_output_small.clear();
      test_output_large.clear();
      segments_small.clear();
      segments_large.clear();
      for (int j = 0; j < num_segments[k]; j++) {
        int x1 = (gen() % mod_koef1[k]) - mod_koef1[k] / 2;
        int y1 = (gen() % mod_koef1[k]) - mod_koef1[k] / 2;
        int dx = 0, dy = 0;
        while (dx == 0 && dy == 0) {
          dx = (gen() % mod_koef2[k]) - mod_koef2[k] / 2;
          dy = (gen() % mod_koef2[k]) - mod_koef2[k] / 2;
        }
        int x2 = x1 + dx;
        int y2 = y1 + dy;
        point_data<int> point1_small(x1, y1);
        point_data<int> point2_small(x2, y2);
        segments_small.push_back(segment_data<int>(point1_small, point2_small));
      }
      voronoi_test_helper::clean_segment_set(segments_small);
      for (std::vector< segment_data<int> >::iterator it = segments_small.begin();
           it != segments_small.end(); ++it) {
        int x1 = it->low().x() * koef;
        int y1 = it->low().y() * koef;
        int x2 = it->high().x() * koef;
        int y2 = it->high().y() * koef;
        point_data<int> point1_large(x1, y1);
        point_data<int> point2_large(x2, y2);
        segments_large.push_back(segment_data<int>(point1_large, point2_large));
      }
      construct_voronoi(segments_small.begin(), segments_small.end(), &test_output_small);
      construct_voronoi(segments_large.begin(), segments_large.end(), &test_output_large);
      VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output_small);
      VERIFY_NO_HALF_EDGE_INTERSECTIONS(test_output_large);
      BOOST_TEST_EQ(test_output_small.num_cells(), test_output_large.num_cells());
      BOOST_TEST_EQ(test_output_small.num_vertices(), test_output_large.num_vertices());
      BOOST_TEST_EQ(test_output_small.num_edges(), test_output_large.num_edges());
    }
  }
}
#endif

int main()
{
    single_site_test();
    collinear_sites_test1();
    collinear_sites_test2();
    triangle_test1();
    triangle_test2();
    square_test1();
#ifdef NDEBUG
    grid_test();
    random_test();
#endif
    segment_sites_test1();
    segment_sites_test2();
    segment_sites_test3();
    segment_sites_test4();
    segment_site_test5();
    segment_site_test6();
    segment_site_test7();
    segment_site_test8();
    segment_site_test9();
#ifdef NDEBUG
    segment_grid_test();
    segment_random_test1();
    segment_random_test2();
#endif
    return boost::report_errors();
}