Hidden surface removal for rectangles

AbstractA simple but important special case of the hidden surface removal problem is one in which the scene consists of n rectangles with sides parallel to the x- and y-axes, with viewpoint at z=∞ (that is, an orthographic projection). This special case has application to overlapping windows in computer displays. An algorithm with running time O(n log n + k log n) is given for static scenes, where k is the number of line segments in the output. Algorithms are given for a dynamic setting (that is, rectangles may be inserted and deleted) that take time O(log2n log log n + k log2 n) per insert or delete, where k is now the number of visible line segments that change (appear or disappear). Algorithms for point location in the visible scene are also given

Compositing concepts for the presentation of graphical application windows on embedded systems

Modern automotive systems feature multiple displays used to render 2D and 3D graphical applications to provide functionalities like driving assistance and entertainment. The performance of the hardware used in automotive environments differs greatly from what is commonly available on desktop workstations, since automotive embedded systems are limited by power consumption and size. The windowing system supporting the graphical applications displayed on board must therefore achieve a greater level of efficiency compared to those used on desktop systems. The compositor, the component of the windowing system that is responsible to draw the content of the applications on screen, must therefore be efficient in the bitblitting operations, especially by minimizing the overdraw that occurs in case of overlapping windows. A concept for a compositor was developed, which features a data structure designed for storing overlapping windows and a set of algorithms to optimize the bitblitting operations. The compositor, using a prediction model that represents the time requirements of the bitblitting commands, is able to reduce the bitblitting time by choosing at runtime the best strategy to draw windows on screen