LadybirdBrowser/ladybird
1
1
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird.git synced 2025-01-08 20:32:56 +03:00
Code Issues Packages Projects Releases Wiki Activity

LibGfx: Add an algorithm to disperse overlapping rectangles

Browse Source
This commit is contained in:
Tom 2021-07-18 10:15:56 -06:00 committed by Andreas Kling
parent 5ae42736f8
commit 1ecb725357
Notes: sideshowbarker 2024-07-18 08:39:08 +09:00 
Author: https://github.com/tomuta
Commit: https://github.com/SerenityOS/serenity/commit/1ecb7253579
Pull-request: https://github.com/SerenityOS/serenity/pull/8859
1 changed files with 57 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

57
Userland/Libraries/LibGfx/Rect.h
View File

@ -551,6 +551,63 @@ public:
return {};
}
template<typename Container>
static bool disperse(Container& rects)
{
auto has_intersecting = [&]() {
for (auto& rect : rects) {
for (auto& other_rect : rects) {
if (&rect == &other_rect)
continue;
if (rect.intersects(other_rect))
return true;
}
}
return false;
};
if (!has_intersecting())
return false;
auto calc_delta = [&](Rect<T> const& rect) -> Point<T> {
auto rect_center = rect.center();
Point<T> center_sum;
for (auto& other_rect : rects) {
if (&other_rect == &rect)
continue;
if (rect.intersects(other_rect))
center_sum += rect_center - other_rect.center();
}
double m = sqrt((double)center_sum.x() * (double)center_sum.x() + (double)center_sum.y() * (double)center_sum.y());
if (m != 0.0)
return { (double)center_sum.x() / m + 0.5, (double)center_sum.y() / m + 0.5 };
return {};
};
Vector<Point<T>, 8> deltas;
do {
bool changes = false;
deltas.clear_with_capacity();
for (auto& rect : rects) {
auto delta = calc_delta(rect);
if (!delta.is_null())
changes = true;
deltas.append(delta);
}
// TODO: If we have no changes we would loop infinitely!
// Figure out some way to resolve this. Maybe randomly moving an intersecting rect?
VERIFY(changes);
size_t i = 0;
for (auto& rect : rects)
rect.translate_by(deltas[i++]);
} while (has_intersecting());
return true;
}
[[nodiscard]] bool is_adjacent(Rect<T> const& other) const
{
if (is_empty() || other.is_empty())