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
|
#!/usr/bin/env python3
import make_spritemap
import numpy as np
import os
import sys
import unittest
sys.path.append(os.path.normpath(
os.path.dirname(os.path.abspath(__file__)) + '/..'))
class TestMinimumAverageCostRectangle(unittest.TestCase):
def test_case1(self):
FRAGMENT_COST = 4
bitmask = np.array([
[False, False, True],
[False, False, False],
[True, False, False],
[True, False, False]
])
cost, rectangle = make_spritemap.minimum_average_cost_rectangle(
bitmask, FRAGMENT_COST=FRAGMENT_COST)
self.assertEqual(rectangle, (2, 0, 4, 1))
self.assertAlmostEqual(cost, (FRAGMENT_COST + 2) / 2.0)
class TestMinimumAverageCostGrow(unittest.TestCase):
def test_basic_right(self):
bitmask = np.array([
[False, False, False, False],
[False, False, False, False],
[False, True, True, False],
[False, True, False, False],
[False, False, False, False],
])
cost, rectangle = make_spritemap.minimum_average_cost_grow(
bitmask, (2, 1, 4, 2))
self.assertEqual(rectangle, (2, 1, 4, 3))
self.assertAlmostEqual(cost, 2.0)
cost, rectangle = make_spritemap.minimum_average_cost_grow(
bitmask, (2, 1, 4, 3))
self.assertEqual(rectangle, (2, 1, 4, 3))
self.assertEqual(cost, None)
def test_basic_left(self):
bitmask = np.array([
[False, False, False, False],
[False, False, False, False],
[False, True, False, False],
[True, False, False, False],
[False, False, False, False],
])
cost, rectangle = make_spritemap.minimum_average_cost_grow(
bitmask, (2, 3, 4, 4))
self.assertEqual(rectangle, (2, 0, 4, 4))
self.assertAlmostEqual(cost, 3.0)
def test_basic_vertical(self):
bitmask = np.array([
[False, True, False, False],
[False, False, False, False],
[False, True, False, False],
[False, False, False, True],
[False, False, False, False],
])
cost, rectangle = make_spritemap.minimum_average_cost_grow(
bitmask, (3, 1, 4, 2))
self.assertEqual(rectangle, (2, 1, 4, 2))
self.assertAlmostEqual(cost, 1.0)
bitmask = np.array([
[False, True, False, False],
[False, False, False, False],
[False, False, False, False],
[False, True, False, False],
[False, False, False, False],
])
cost, rectangle = make_spritemap.minimum_average_cost_grow(
bitmask, (2, 1, 3, 2))
self.assertEqual(rectangle, (2, 1, 4, 2))
self.assertAlmostEqual(cost, 1.0)
class TestComputeRectangleCovering(unittest.TestCase):
def test_basic(self):
"""Tests a case where the optimal solution consists of a single minimum
average cost rectangle."""
FRAGMENT_COST = 4
bitmask = np.array([
[False, False, False, False],
[False, False, False, False],
[False, True, True, False],
[False, True, False, False],
[False, False, False, False],
])
cost, rectangles = make_spritemap.compute_rectangle_covering(
bitmask,
FRAGMENT_COST=FRAGMENT_COST
)
self.assertEqual(cost, FRAGMENT_COST + 4)
self.assertItemsEqual(rectangles, [(2, 1, 4, 3)])
def test_grow(self):
"""Tests a case where the optimal solution can be found by growing the
initial minimum average cost rectangle."""
FRAGMENT_COST = 4
bitmask = np.array([
[False, False, False, False, False, False],
[False, False, False, False, False, False],
[False, True, True, False, False, False],
[False, True, False, False, False, False],
[False, True, False, False, False, False],
[False, True, False, False, False, False],
[False, False, False, False, False, False],
])
cost, rectangles = make_spritemap.compute_rectangle_covering(
bitmask,
FRAGMENT_COST=FRAGMENT_COST
)
self.assertEqual(cost, FRAGMENT_COST + 8)
self.assertItemsEqual(rectangles, [(2, 1, 6, 3)])
def test_nogrow(self):
"""Similar to test_grow, but tests a situation in which growing the
initial rectangle is in fact not optimal."""
FRAGMENT_COST = 4
bitmask = np.array([
[False, False, False, False, False, False],
[False, False, False, False, False, False],
[False, True, True, True, False, False],
[False, True, False, False, False, False],
[False, True, False, False, False, False],
[False, True, False, False, False, False],
[False, False, False, False, False, False],
])
cost, rectangles = make_spritemap.compute_rectangle_covering(
bitmask,
FRAGMENT_COST=FRAGMENT_COST
)
self.assertEqual(cost, 2 * FRAGMENT_COST + 6)
self.assertItemsEqual(rectangles, [(2, 1, 6, 2), (2, 2, 3, 4)])
def test_diag_growth_bug(self):
"""Regression test for a silly bug."""
FRAGMENT_COST = 4
bitmask = np.array([
[True, False, False, False],
[False, False, False, False],
[False, False, False, False],
[False, False, False, True],
])
cost, rectangles = make_spritemap.compute_rectangle_covering(
bitmask,
FRAGMENT_COST=FRAGMENT_COST
)
self.assertEqual(cost, 2 * FRAGMENT_COST + 2)
self.assertItemsEqual(rectangles, [(0, 0, 1, 1), (3, 3, 4, 4)])
if __name__ == '__main__':
unittest.main()
|