rectangles

I'm looking for an algorithm here, independent of specific programming language. The problem: We have a 2-dimensional display area (think simple buffer of pixels). Periodically, some of the pixels are changed. We need to find a set of rectangles that encapsulate all changed pixels. It would be trivial, but undesirable, to compute a single, potentially large, rectangle that encapsulates all changed pixels. We would rather have multiple, smaller, tight-fitting rectangles down to a specified minimum size (that is a variable which can be changed). For example, suppose that within the entire

I was developing an task when I decided to use java.awt.Rectangle to calculate the intersection between two rectangles. I realised that the output is different from what I expected. I'm not sure if I understood how this method works or not. For the values in the example here java.awt.Rectangle[x=0,y=10,width=5,height=8] java.awt.Rectangle[x=3,y=15,width=17,height=14] I expect the intersection to be java.awt.Rectangle[x=3,y=10,width=2,height=8] but the program prints java.awt.Rectangle[x=3,y=15,width=2,height=3] instead! here is my code: public void printIntersection(){ Rectangle r1 = new

I would like to know if there is any algorithm that does something like this: Given a specific surface it divides it into smaller rectangles of the same size. Something like this example figure: The grey area is the surface, and the red squares is the partition itself. I am thinking if there is a optimized way to do this. A very bad approach would be a for loop in all the pixels and check if there is a rectangle for that specific spot, if not, would create a rectangle, and so on.. Maybe someone knows a algorithm already done? or a better solution? Thanks alot in advance ;) Paul Samsotha Here's

I tried to using the algorithm shown here: https://discuss.leetcode.com/topic/15733/my-java-solution-sum-of-areas-overlapped-area However, that algorithm only deals with finding the areas of only TWO overlapped rectangles. How would I go on about finding the area of the intersection of say 3, or 4 or 5, etc number of overlapping rectangles, if I know the length, breadth of each rectangle? benten Shapely is a good library for stuff like this. from shapely.geometry import box # make some rectangles (for demonstration purposes and intersect with each other) rect1 = box(0,0,5,2) rect2 = box(0.5,0

I'm looking for a simple way to calculate the difference between two rectangles. I mean all points which belong to one of the rectangles, but not to both (so it's like XOR). The rectangles are axis-aligned in this case, so there will be only right angles. I believe the difference region can be expressed in 0-4 rectangles (0 if both rectangles are the same, 1 if just one edge is different, 4 in the general case), and I'd like to get the difference region as a list of rectangles. You can also think of it as the areas of the screen that have to be updated when a solid rectangle is moved/resized.

Here is the problem. I have rectangular canvas that have size of 1. So it have coordinate sistem of (0.0 ... 1.0 - x and 0.0 ... 1.0 - y). I also have some tiles. Tiles are also rectangles. They have diffrent size and amount of tiles is a variable. I want to stack tiles in rectangular canvas, from 0.0 to 1.0 ( from left to right, from top to bottom ): 1) tiles have to fit in canvas (but fill as much space as they could) 2) tiles have to be scaled (if they don't fit), each tile should be scaled by the same amount (they have to remain same proportions). 3) imagine that you have this 'tiles' in