-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_ovalRasterizer.cpp
233 lines (176 loc) · 7.04 KB
/
test_ovalRasterizer.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
/** ---------------------------------------------------------------------------
*
* \file test_ovalRasterizer.h
* \description This file contains the test for the ovalRasterizer
---------------------------------------------------------------------------- */
#define DOCTEST_CONFIG_IMPLEMENT_WITH_MAIN
#include <doctest/doctest.h>
#include "ovalRasterizer.h"
/* ----------------------------------------------------------------------------
* TEST CASES
--------------------------------------------------------------------------- */
TEST_SUITE_BEGIN( "OvalRasterizer_IntegrationTests");
TEST_CASE( "Empty oval list" )
{
std::vector< ovalRecord > emptyList;
auto rr = ovalListToRaster( emptyList, 1000, 1000 );
CHECK( rr.empty() );
}
TEST_CASE( "Single Flat Oval" )
{
std::vector< ovalRecord > ovalList;
// This oval has a radius of 0.f in the y direction. It should not generate any pixels
ovalList.push_back( ovalRecord{ 10.f, 10.f, 5.f, 0.f, 0.f } );
auto rr = ovalListToRaster( ovalList, 200, 200 );
CHECK( rr.empty() );
}
TEST_CASE( "Small Oval" )
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( ovalRecord{ 5.5f, 5.5f, 3.f, 3.f, 0.f } );
auto rr = ovalListToRaster( ovalList, 10, 10 );
CHECK( not rr.empty() );
int num_fixed_runs = 0;
for( const auto& one : rr )
{
CHECK( one.value <= 1.f ); // check that all pixel intensities are less than or equal to 1
if( one.value == 1.f )
{
num_fixed_runs += 1;
}
}
CHECK( num_fixed_runs == 5 );
}
TEST_CASE("Two Scanline Oval")
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( ovalRecord{ 4.f, 4.f, 2.f, 1.f, 0.f } );
auto rr = ovalListToRaster( ovalList, 10, 10 );
REQUIRE( rr.size() == 6 );
}
TEST_CASE("One Tiny Oval")
{
std::vector< ovalRecord > ovalList;
// This test case is mean to trigger the case4 in the aa pixel
ovalList.push_back( ovalRecord{ 3.5f, 3.5f, .5f, .5f, 0.f } );
auto rr = ovalListToRaster( ovalList, 10, 10 );
REQUIRE( rr.size() == 1 );
CHECK( rr[ 0 ].value == doctest::Approx( 0.5f ) );
}
TEST_CASE("Four Tiny Ovals")
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( ovalRecord{ 3.f, 3.f, .25f, .25f, 0.f } );
ovalList.push_back( ovalRecord{ 4.f, 3.f, .25f, .25f, 0.f } );
ovalList.push_back( ovalRecord{ 3.f, 4.f, .25f, .25f, 0.f } );
ovalList.push_back( ovalRecord{ 4.f, 4.f, .25f, .25f, 0.f } );
auto rr = ovalListToRaster( ovalList, 10, 10 );
REQUIRE( rr.size() == 9 );
CHECK( rr[ 0 ].lineY == 2 );
CHECK( rr[ 3 ].lineY == 3 );
CHECK( rr[ 6 ].lineY == 4 );
CHECK( rr[ 0 ].value == doctest::Approx( 0.0857864245f ) );
CHECK( rr[ 1 ].value == doctest::Approx( 0.414213538f ) );
CHECK( rr[ 2 ].value == doctest::Approx( 0.0857864245f ) );
CHECK( rr[ 3 ].value == doctest::Approx( 0.414213538f ) );
CHECK( rr[ 4 ].value == doctest::Approx( 0.656854272f ) );
CHECK( rr[ 5 ].value == doctest::Approx( 0.414213538f ) );
CHECK( rr[ 6 ].value == doctest::Approx( 0.0857864245f ) );
CHECK( rr[ 7 ].value == doctest::Approx( 0.414213538f ) );
CHECK( rr[ 8 ].value == doctest::Approx( 0.0857864245f ) );
}
TEST_CASE( "Case 3 Coverage" )
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( { 2.f, 2.f, 0.35f, 0.35f, 0.f } );
ovalList.push_back( { 3.f, 3.f, 0.35f, 0.35f, 0.f } );
ovalList.push_back( { 5.f, 4.f, 0.35f, 0.35f, 0.f } );
ovalList.push_back( { 4.f, 5.f, 0.35f, 0.35f, 0.f } );
auto rr = ovalListToRaster( ovalList, 10, 10 );
REQUIRE( rr.size() == 9 );
CHECK( rr[ 0 ].lineY == 1 );
CHECK( rr[ 0 ].startX == 1 );
CHECK( rr[ 0 ].endX == 3 );
CHECK( rr[ 0 ].value == doctest::Approx( 0.0857864245f ) );
CHECK( rr[ 1 ].value == doctest::Approx( 0.0857864245f ) );
CHECK( rr[ 2 ].value < 1.f ); // this value should be about twice the above
}
TEST_CASE("Clipped Oval")
{
std::vector< ovalRecord > ovalList;
// these four ovals are outside the frame buffer
ovalList.push_back( { -20.f, 5.5f, 3.f,3.f, 0.f } );
ovalList.push_back( { 20.f, 5.5f, 3.f,3.f, 0.f } );
ovalList.push_back( { 5.f, -20.f, 3.f,3.f, 0.f } );
ovalList.push_back( { 5.f, 20.f, 3.f,3.f, 0.f } );
auto rr = ovalListToRaster( ovalList, 10, 10 );
CHECK( rr.empty() ); // The circle is completely to the left
}
TEST_CASE("Concentric Ovals")
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( { 10.f, 10.f, 8.f,8.f, 0.f } );
auto r1 = ovalListToRaster( ovalList, 20, 20 );
ovalList.push_back( { 10.f, 10.f, 3.f,3.f, 0.f } );
auto r2 = ovalListToRaster( ovalList, 20, 20 );
REQUIRE( r1.size() == r2.size() );
for( int ii = 0; ii < r1.size(); ii += 1 )
{
CHECK( r1[ ii ].lineY == r2[ ii ].lineY );
CHECK( r1[ ii ].startX == r2[ ii ].startX );
CHECK( r1[ ii ].endX == r2[ ii ].endX );
CHECK( r1[ ii ].value == r2[ ii ].value );
}
}
TEST_CASE("Deduplicate Zero Output")
{
std::vector< ovalRecord > ovalList;
REQUIRE( deduplicateOvalList( ovalList ) == 0 ); // check empty
ovalList.push_back( { 100.f, 100.f, 25.f, 25.f, 0.f } );
REQUIRE( deduplicateOvalList( ovalList ) == 0 ); // check with just one
ovalList.push_back( { 200.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 300.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 400.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 500.f, 100.f, 25.f, 25.f, 0.f } );
CHECK( deduplicateOvalList( ovalList ) == 0 ); // all non-overlapping
ovalList.clear();
ovalList.push_back( { 100.f, 100.f, 10.f, 10.f, 0.f } );
ovalList.push_back( { 100.f, 100.f, 10.f, 10.f, 0.f } ); // two of the same
CHECK( deduplicateOvalList( ovalList, 0.f ) == 0 ); // cover_limit == 0.f
}
TEST_CASE("Deduplicate Remove Cases")
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( { 200.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 300.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 400.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 500.f, 100.f, 25.f, 25.f, 0.f } );
// add exact duplicates of the above
ovalList.push_back( { 200.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 300.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 400.f, 100.f, 25.f, 25.f, 0.f } );
ovalList.push_back( { 500.f, 100.f, 25.f, 25.f, 0.f } );
CHECK( deduplicateOvalList( ovalList ) == 4 );
}
TEST_CASE("Deduplicate Edge Cases")
{
std::vector< ovalRecord > ovalList;
ovalList.push_back( { 100.f, 300.f, 10.f, 10.f, 0.f } );
ovalList.push_back( { 200.f, 100.f, 20.f, 20.f, 0.f } );
ovalList.push_back( { 200.f, 100.f, 25.f, 25.f, 0.f } );
REQUIRE( deduplicateOvalList( ovalList ) == 1 );
CHECK( ovalList[ 1 ].radiusx == 25.f );
CHECK( ovalList[ 1 ].radiusy == 25.f );
}
TEST_CASE("Deduplicate Pivot")
{
std::vector< ovalRecord > ovalList;
// test the case where the leftmost oval is removed
ovalList.push_back( { 100.f, 100.f, 20.f, 20.f, 0.f } );
ovalList.push_back( { 121.f, 101.f, 40.f, 20.f, 0.f } );
ovalList.push_back( { 200.f, 100.f, 25.f, 25.f, 0.f } );
REQUIRE( deduplicateOvalList( ovalList ) == 1 );
CHECK( ovalList[ 0 ].radiusx == 40.f );
CHECK( ovalList[ 0 ].radiusy == 20.f );
}
TEST_SUITE_END();