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: