<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithms on Blips and Blinks</title><link>/tags/algorithms/</link><description>Recent content in Algorithms on Blips and Blinks</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Mon, 10 Apr 2023 21:50:07 +0300</lastBuildDate><atom:link href="/tags/algorithms/index.xml" rel="self" type="application/rss+xml"/><item><title>Reducing multiple overlapping rectangles into set of non-overlapping ones</title><link>/posts/reducing_rectangles/</link><pubDate>Mon, 10 Apr 2023 21:50:07 +0300</pubDate><guid>/posts/reducing_rectangles/</guid><description>Consider we have a set of multiple overlapping rectangles and we want to reduce it so in the result we have a set that occupies the same area but rectangles inside do not overlap with each other&amp;hellip;</description></item></channel></rss>