dirtyrectangle | 易学教程

Optimum set of dirty rectangles

阅读更多关于 Optimum set of dirty 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

Optimum set of dirty rectangles

阅读更多关于 Optimum set of dirty 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

Dirty Rectangles

阅读更多关于 Dirty Rectangles

问题 Where may one find references on implementing an algorithm for calculating a "dirty rectangle" for minimizing frame buffer updates? A display model that permits arbitrary edits and computes the minimal set of "bit blit" operations required to update the display. 回答1: To build the smallest rectangle that contains all the areas that need to be repainted: Start with a blank area (perhaps a rectangle set to 0,0,0,0 - something you can detect as 'no update required') For each dirty area added: