hidden surface removal for rectangles
A 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. An algorithm with running time &Ogr; ( n log n log 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 &Ogr; (log 2 n log log n + k log 2 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.
surface case parallel point project applications windows algorithm timing log segmentation dynamic change locatability