This paper presents a new GPU-based rasterization algorithm for Boolean operations that handles arbitary closed polygons. We construct an efficient data structure for interoperation of CPU and GPU and propose a fast GPU-based contour extraction method to ensure the performance of our algorithm. We then design a novel traversing strategy to achieve an error-free calculation of intersection point for correct Boolean operations. We finally give a detail evaluation and the results show that our algorithm has a higher performance than exsiting algorithms on processing polygons with large amount of vertices.

This letter proposes a Light Space Partitioned Shadow Maps (LSPSMs) algorithm which implements shadow rendering based on a novel partitioning scheme in light space. In stead of splitting the view frustum like traditional Z-partitioning methods, we split partitions from the projection of refined view frustum in light space. The partitioning scheme is performed dual-directionally while limiting the wasted space. Partitions are created in dynamic number corresponding to the light and view directions. Experiments demonstrate that high quality shadows can be rendered in high efficiency with our algorithm.

Vector data differs in the rasterized height field by data type. It is difficult to render dynamic vectors on height field because their shapes and locations may change at any time. This letter proposes a novel method: View-dependent Projective Atlases (VdPAs). As an intermediate data source, VdPAs act as rendering targets which enable height field and vectors to be rasterized at the same resolution. Then, VdPAs can be viewed as super-tiles. State of art height field rendering algorithms can be used for scenario rendering. Experimental results demonstrate that atlases are able to make dynamic vectors to be rendered on height field with real-time performance and high quality.