1 // Boost.Polygon library voronoi_diagram_test.cpp file
2
3 // Copyright Andrii Sydorchuk 2010-2012.
4 // Distributed under the Boost Software License, Version 1.0.
5 // (See accompanying file LICENSE_1_0.txt or copy at
6 // http://www.boost.org/LICENSE_1_0.txt)
7
8 // See http://www.boost.org for updates, documentation, and revision history.
9
10 #define BOOST_TEST_MODULE voronoi_diagram_test
11 #include <boost/test/test_case_template.hpp>
12
13 #include <boost/polygon/voronoi_diagram.hpp>
14 #include <boost/polygon/voronoi_geometry_type.hpp>
15 using namespace boost::polygon;
16
17 typedef voronoi_cell<double> voronoi_cell_type;
18 typedef voronoi_vertex<double> voronoi_vertex_type;
19 typedef voronoi_edge<double> voronoi_edge_type;
20 typedef voronoi_diagram<double> voronoi_diagram_type;
21
BOOST_AUTO_TEST_CASE(voronoi_cell_test)22 BOOST_AUTO_TEST_CASE(voronoi_cell_test) {
23 voronoi_cell_type cell(1, SOURCE_CATEGORY_INITIAL_SEGMENT);
24 cell.color(27);
25 BOOST_CHECK(!cell.contains_point());
26 BOOST_CHECK(cell.contains_segment());
27 BOOST_CHECK(cell.is_degenerate());
28 BOOST_CHECK(cell.source_index() == 1);
29 BOOST_CHECK(cell.source_category() == SOURCE_CATEGORY_INITIAL_SEGMENT);
30 BOOST_CHECK(cell.incident_edge() == NULL);
31 BOOST_CHECK(cell.color() == 27);
32
33 voronoi_edge_type edge(true, true);
34 cell.incident_edge(&edge);
35 BOOST_CHECK(!cell.is_degenerate());
36 BOOST_CHECK(cell.incident_edge() == &edge);
37 }
38
BOOST_AUTO_TEST_CASE(voronoi_vertex_test)39 BOOST_AUTO_TEST_CASE(voronoi_vertex_test) {
40 voronoi_vertex_type vertex(1, 2);
41 vertex.color(27);
42 BOOST_CHECK(vertex.is_degenerate());
43 BOOST_CHECK(vertex.x() == 1);
44 BOOST_CHECK(vertex.y() == 2);
45 BOOST_CHECK(vertex.incident_edge() == NULL);
46 BOOST_CHECK(vertex.color() == 27);
47
48 voronoi_edge_type edge(true, true);
49 vertex.incident_edge(&edge);
50 BOOST_CHECK(!vertex.is_degenerate());
51 BOOST_CHECK(vertex.incident_edge() == &edge);
52 }
53
BOOST_AUTO_TEST_CASE(voronoi_edge_test)54 BOOST_AUTO_TEST_CASE(voronoi_edge_test) {
55 voronoi_edge_type edge1(false, false);
56 edge1.color(13);
57 BOOST_CHECK(!edge1.is_primary());
58 BOOST_CHECK(edge1.is_secondary());
59 BOOST_CHECK(!edge1.is_linear());
60 BOOST_CHECK(edge1.is_curved());
61 BOOST_CHECK(!edge1.is_finite());
62 BOOST_CHECK(edge1.is_infinite());
63 BOOST_CHECK(edge1.color() == 13);
64
65 voronoi_edge_type edge2(true, true);
66 edge2.color(14);
67 BOOST_CHECK(edge2.is_primary());
68 BOOST_CHECK(!edge2.is_secondary());
69 BOOST_CHECK(edge2.is_linear());
70 BOOST_CHECK(!edge2.is_curved());
71 BOOST_CHECK(!edge2.is_finite());
72 BOOST_CHECK(edge2.is_infinite());
73 BOOST_CHECK(edge2.color() == 14);
74
75 edge1.twin(&edge2);
76 edge2.twin(&edge1);
77 BOOST_CHECK(edge1.twin() == &edge2);
78 BOOST_CHECK(edge2.twin() == &edge1);
79
80 edge1.next(&edge2);
81 edge1.prev(&edge2);
82 edge2.next(&edge1);
83 edge2.prev(&edge1);
84 BOOST_CHECK(edge1.next() == &edge2);
85 BOOST_CHECK(edge1.prev() == &edge2);
86 BOOST_CHECK(edge1.rot_next() == &edge1);
87 BOOST_CHECK(edge1.rot_prev() == &edge1);
88
89 voronoi_cell_type cell(1, SOURCE_CATEGORY_INITIAL_SEGMENT);
90 edge1.cell(&cell);
91 BOOST_CHECK(edge1.cell() == &cell);
92
93 voronoi_vertex_type vertex0(1, 2);
94 edge1.vertex0(&vertex0);
95 BOOST_CHECK(edge1.vertex0() == &vertex0);
96 BOOST_CHECK(edge2.vertex1() == &vertex0);
97
98 voronoi_vertex_type vertex1(2, 1);
99 edge2.vertex0(&vertex1);
100 BOOST_CHECK(edge1.vertex1() == &vertex1);
101 BOOST_CHECK(edge2.vertex0() == &vertex1);
102
103 BOOST_CHECK(edge1.is_finite());
104 BOOST_CHECK(edge2.is_finite());
105 }
106
BOOST_AUTO_TEST_CASE(voronoi_diagram_test)107 BOOST_AUTO_TEST_CASE(voronoi_diagram_test) {
108 voronoi_diagram_type vd;
109 BOOST_CHECK(vd.num_cells() == 0);
110 BOOST_CHECK(vd.num_vertices() == 0);
111 BOOST_CHECK(vd.num_edges() == 0);
112 vd.clear();
113 }
114