2014-02-10 02:10:30 +01:00
|
|
|
/*************************************************************************/
|
|
|
|
/* editor_atlas.cpp */
|
|
|
|
/*************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
2017-08-27 14:11:45 +02:00
|
|
|
/* https://godotengine.org */
|
2014-02-10 02:10:30 +01:00
|
|
|
/*************************************************************************/
|
2017-01-01 22:01:57 +01:00
|
|
|
/* Copyright (c) 2007-2017 Juan Linietsky, Ariel Manzur. */
|
2017-04-08 00:45:00 +02:00
|
|
|
/* Copyright (c) 2014-2017 Godot Engine contributors (cf. AUTHORS.md) */
|
2014-02-10 02:10:30 +01:00
|
|
|
/* */
|
|
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
|
|
/* a copy of this software and associated documentation files (the */
|
|
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
|
|
/* the following conditions: */
|
|
|
|
/* */
|
|
|
|
/* The above copyright notice and this permission notice shall be */
|
|
|
|
/* included in all copies or substantial portions of the Software. */
|
|
|
|
/* */
|
|
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
|
|
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
|
|
/*************************************************************************/
|
|
|
|
#include "editor_atlas.h"
|
2015-11-11 21:39:06 +01:00
|
|
|
#include "print_string.h"
|
2014-02-10 02:10:30 +01:00
|
|
|
|
|
|
|
struct _EditorAtlasWorkRect {
|
|
|
|
|
|
|
|
Size2i s;
|
|
|
|
Point2i p;
|
|
|
|
int idx;
|
2017-03-19 00:36:26 +01:00
|
|
|
_FORCE_INLINE_ bool operator<(const _EditorAtlasWorkRect &p_r) const { return s.width > p_r.s.width; };
|
2014-02-10 02:10:30 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct _EditorAtlasWorkRectResult {
|
|
|
|
|
|
|
|
Vector<_EditorAtlasWorkRect> result;
|
|
|
|
int max_w;
|
|
|
|
int max_h;
|
|
|
|
};
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
void EditorAtlas::fit(const Vector<Size2i> &p_rects, Vector<Point2i> &r_result, Size2i &r_size) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
ERR_FAIL_COND(p_rects.size() == 0);
|
2014-02-10 02:10:30 +01:00
|
|
|
|
|
|
|
Vector<_EditorAtlasWorkRect> wrects;
|
|
|
|
wrects.resize(p_rects.size());
|
2017-08-24 12:17:27 +02:00
|
|
|
long total_area = 0;
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < p_rects.size(); i++) {
|
|
|
|
wrects[i].s = p_rects[i];
|
|
|
|
wrects[i].idx = i;
|
2017-08-24 12:17:27 +02:00
|
|
|
total_area += p_rects[i].width * p_rects[i].height;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
wrects.sort();
|
|
|
|
int widest = wrects[0].s.width;
|
|
|
|
|
|
|
|
Vector<_EditorAtlasWorkRectResult> results;
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i <= 12; i++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
int w = 1 << i;
|
|
|
|
int max_h = 0;
|
|
|
|
int max_w = 0;
|
|
|
|
if (w < widest)
|
2014-02-10 02:10:30 +01:00
|
|
|
continue;
|
|
|
|
|
2017-08-24 12:17:27 +02:00
|
|
|
Vector<int> wmax;
|
|
|
|
wmax.resize(total_area / w);
|
|
|
|
for (int j = 0; j < wmax.size(); j++)
|
|
|
|
wmax[j] = 0;
|
2015-11-11 21:39:06 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int j = 0; j < wrects.size(); j++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-08-24 12:17:27 +02:00
|
|
|
int new_x = 0;
|
|
|
|
int new_y = 0;
|
|
|
|
|
|
|
|
int piece_w = wrects[j].s.width;
|
|
|
|
int piece_h = wrects[j].s.height;
|
|
|
|
|
|
|
|
bool found_place;
|
|
|
|
|
|
|
|
do {
|
|
|
|
found_place = true;
|
|
|
|
new_x = 0;
|
|
|
|
if (wmax.size() <= new_y + piece_h) {
|
|
|
|
int prevS = wmax.size();
|
|
|
|
wmax.resize(new_y + piece_h + 128);
|
|
|
|
for (int k = prevS; k < wmax.size(); k++)
|
|
|
|
wmax[k] = 0;
|
|
|
|
}
|
|
|
|
for (int k = 0; k < piece_h; k++) {
|
|
|
|
if (new_x < wmax[new_y + k]) new_x = wmax[new_y + k];
|
|
|
|
if (new_x + piece_w > w) {
|
|
|
|
new_y += k + 1;
|
|
|
|
found_place = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (found_place) {
|
|
|
|
// one more check is calculating lost space of atlas
|
|
|
|
long lost_area = 0;
|
|
|
|
for (int k = 0; k < piece_h; k++) {
|
|
|
|
lost_area += new_x - wmax[new_y + k];
|
|
|
|
}
|
|
|
|
if (lost_area >= piece_w * piece_h / 2) {
|
|
|
|
found_place = false;
|
|
|
|
new_y++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} while (!found_place);
|
|
|
|
|
|
|
|
wrects[j].p.x = new_x;
|
|
|
|
wrects[j].p.y = new_y;
|
|
|
|
|
|
|
|
int end_h = new_y + piece_h;
|
|
|
|
int end_w = new_x + piece_w;
|
|
|
|
|
|
|
|
for (int k = 0; k < piece_h; k++) {
|
|
|
|
wmax[new_y + k] = end_w;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (end_h > max_h)
|
2017-03-19 00:36:26 +01:00
|
|
|
max_h = end_h;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
|
|
|
if (end_w > max_w)
|
2017-03-19 00:36:26 +01:00
|
|
|
max_w = end_w;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
_EditorAtlasWorkRectResult result;
|
2017-03-19 00:36:26 +01:00
|
|
|
result.result = wrects;
|
|
|
|
result.max_h = max_h;
|
|
|
|
result.max_w = max_w;
|
2014-02-10 02:10:30 +01:00
|
|
|
results.push_back(result);
|
2017-08-24 12:17:27 +02:00
|
|
|
float efficiency = float(max_w * max_h) / float(next_power_of_2(max_w) * next_power_of_2(max_h));
|
|
|
|
print_line("Processing atlas: width " + itos(w) + " ,height " + itos(max_h) + " ,efficiency " + rtos(efficiency));
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
2017-08-24 12:17:27 +02:00
|
|
|
//find the result with the most efficiency
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
int best = -1;
|
2017-08-24 12:17:27 +02:00
|
|
|
float max_eff = 0;
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < results.size(); i++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2015-11-11 21:39:06 +01:00
|
|
|
float h = results[i].max_h;
|
|
|
|
float w = results[i].max_w;
|
2017-08-24 12:17:27 +02:00
|
|
|
float efficiency = float(w * h) / float(next_power_of_2(w) * next_power_of_2(h));
|
|
|
|
if (efficiency > max_eff) {
|
2017-03-19 00:36:26 +01:00
|
|
|
best = i;
|
2017-08-24 12:17:27 +02:00
|
|
|
max_eff = efficiency;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
r_result.resize(p_rects.size());
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
for (int i = 0; i < p_rects.size(); i++) {
|
2014-02-10 02:10:30 +01:00
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
r_result[results[best].result[i].idx] = results[best].result[i].p;
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|
|
|
|
|
2017-03-19 00:36:26 +01:00
|
|
|
r_size = Size2(results[best].max_w, results[best].max_h);
|
2014-02-10 02:10:30 +01:00
|
|
|
}
|