ACloudViewer  3.9.4
A Modern Library for 3D Data Processing
visibility_pyramid_test.cc
Go to the documentation of this file.
1 // Copyright (c) 2018, ETH Zurich and UNC Chapel Hill.
2 // All rights reserved.
3 //
4 // Redistribution and use in source and binary forms, with or without
5 // modification, are permitted provided that the following conditions are met:
6 //
7 // * Redistributions of source code must retain the above copyright
8 // notice, this list of conditions and the following disclaimer.
9 //
10 // * Redistributions in binary form must reproduce the above copyright
11 // notice, this list of conditions and the following disclaimer in the
12 // documentation and/or other materials provided with the distribution.
13 //
14 // * Neither the name of ETH Zurich and UNC Chapel Hill nor the names of
15 // its contributors may be used to endorse or promote products derived
16 // from this software without specific prior written permission.
17 //
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
19 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
22 // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
23 // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
24 // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
27 // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
28 // POSSIBILITY OF SUCH DAMAGE.
29 //
30 // Author: Johannes L. Schoenberger (jsch-at-demuc-dot-de)
31 
32 #define TEST_NAME "base/visibility_pyramid"
33 #include "util/testing.h"
34 
36 
37 using namespace colmap;
38 
39 BOOST_AUTO_TEST_CASE(TestDefault) {
40  VisibilityPyramid pyramid;
41  BOOST_CHECK_EQUAL(pyramid.NumLevels(), 0);
42  BOOST_CHECK_EQUAL(pyramid.Width(), 0);
43  BOOST_CHECK_EQUAL(pyramid.Height(), 0);
44  BOOST_CHECK_EQUAL(pyramid.Score(), 0);
45 }
46 
48  for (int num_levels = 1; num_levels < 8; ++num_levels) {
49  Eigen::VectorXi scores(num_levels);
50  size_t max_score = 0;
51  for (int i = 1; i <= num_levels; ++i) {
52  scores(i - 1) = (1 << i) * (1 << i);
53  max_score += scores(i - 1) * scores(i - 1);
54  }
55 
56  VisibilityPyramid pyramid(static_cast<size_t>(num_levels), 4, 4);
57  BOOST_CHECK_EQUAL(pyramid.NumLevels(), num_levels);
58  BOOST_CHECK_EQUAL(pyramid.Width(), 4);
59  BOOST_CHECK_EQUAL(pyramid.Height(), 4);
60  BOOST_CHECK_EQUAL(pyramid.Score(), 0);
61  BOOST_CHECK_EQUAL(pyramid.MaxScore(), max_score);
62 
63  BOOST_CHECK_EQUAL(pyramid.Score(), 0);
64  pyramid.SetPoint(0, 0);
65  BOOST_CHECK_EQUAL(pyramid.Score(), scores.sum());
66  pyramid.SetPoint(0, 0);
67  BOOST_CHECK_EQUAL(pyramid.Score(), scores.sum());
68  pyramid.SetPoint(0, 1);
69  BOOST_CHECK_EQUAL(pyramid.Score(),
70  scores.sum() + scores.tail(scores.size() - 1).sum());
71  pyramid.SetPoint(0, 1);
72  pyramid.SetPoint(0, 1);
73  pyramid.SetPoint(1, 0);
74  BOOST_CHECK_EQUAL(pyramid.Score(),
75  scores.sum() + 2 * scores.tail(scores.size() - 1).sum());
76  pyramid.SetPoint(1, 0);
77  pyramid.SetPoint(1, 1);
78  BOOST_CHECK_EQUAL(pyramid.Score(),
79  scores.sum() + 3 * scores.tail(scores.size() - 1).sum());
80  pyramid.ResetPoint(0, 0);
81  BOOST_CHECK_EQUAL(pyramid.Score(),
82  scores.sum() + 3 * scores.tail(scores.size() - 1).sum());
83  pyramid.ResetPoint(0, 0);
84  BOOST_CHECK_EQUAL(pyramid.Score(),
85  scores.sum() + 2 * scores.tail(scores.size() - 1).sum());
86  pyramid.SetPoint(0, 2);
87  BOOST_CHECK_EQUAL(
88  pyramid.Score(),
89  2 * scores.sum() + 2 * scores.tail(scores.size() - 1).sum());
90  }
91 }
void ResetPoint(const double x, const double y)
void SetPoint(const double x, const double y)
BOOST_AUTO_TEST_CASE(TestDefault)