This thesis presents an efficient buffer management scheme for 3-D graphic rendering systems. The purpose of this scheme is to reduce the off-chip memory accesses, which have become a valuable resource, and very often a performance bottleneck of embedded 3-D applications. The 3-D buffers, including depth and color frame buffers, will be divided into rectangular blocks. The proposed scheme can first provide the management of buffer clear operation. For most of time, the rendering of each 3-D frame starts from the buffer clear command to clear the data remaining in buffers from the previous frame. Instead of clearing the buffers residing in the off-chip memory immediately, our scheme will just set the clear flag in an on-chip buffer management table which provides a control information entry for each of the blocks in the buffer. When the blocks have to be accessed later during rendering process, they won¡¦t be brought in from on-chip memory; instead, they are cleared directly in the corresponding cache location. When the cache blocks are replaced, the corresponding off-chip buffer blocks will be updated. Only those blocks in the off-chip color buffer which are not visited will be actually cleared when the color frame is swapped for display. The second contribution of the propose management scheme is to compress and decompress the depth blocks to save the transfer data amount of these blocks. Since the difference of the depth values of the neighboring pixels belonging to the same triangle plane will be the same, this difference value can be stored and encoded along with the run-length information which can lead to significant saving of the storage space. The actual reduction ratio depends on the relative object complexity to the output screen size, the block size, and the degree of the anti-aliasing considered. However, our experimental results show that the compression ratio of 17-28% can be achieved for the moderate block size. The entire buffer management has been implemented, and the entire gate count is 65k, which is about 10% of the entire 3-D systems. The proposed management chip is very suitable for embedded 3D graphic rendering systems where the memory bandwidth budget is very tightly restricted.

Uždengtos geometrijos atrinkimas – tai būdas nustatyti geometriją, kuri yra uždengta su kita geometrija ir dėl to gali būti nevaizduojama, nes neturės jokios įtakos vaizduojamam paveikslui. Tokios geometrijos nevaizdavimas didina vaizdavimo procedūros našumą. Egzistuoja eilė uždengtos geometrijos nustatymo būdų, iš kurių vienas yra hierarchinis uždengtos geometrijos atrinkimo algoritmas. Šiame darbe yra analizuojami uždengtos geometrijos nustatymo būdai bei nagrinėjamos pasirinkto algoritmo veikimo spartinimo galimybės panaudojus DirectCompute technologiją. Ši technologija yra Microsoft DirectX 11 bibliotekų rinkinio dalis, kuri leidžia panaudoti grafinį procesorių bendro pobūdžio skaičiavimams. Darbe iškeltų tikslų pasiekimui yra realizuotos kelios bazinės algoritmo versijos modifikacijos, atliekami modifikuotų versijų veikimo laiko bei įvairių veikimo laiką įtakojančių faktorių tyrimai. Yra aptariami gauti rezultatai bei pateikiamos išvados. / Occlusion culling is a method, which task is to determine geometry occluded with other geometry. Rendering this geometry is useless because it wouldn’t impact rendered picture in any way, so discarding it will improve render time. There are various methods to determine occluded geometry and hierarchical occlusion culling is one of them. This document contains a short summary of these methods, but it’s mainly focused on improving hierarchical occlusion culling algorithm performance by making use of DirectCompute technology. This technology is a part of Microsoft DirectX 11 API, which helps the developer to use graphics processor for general-purpose computation. Main goal is reached by performing in-depth analysis of implemented hierarchical occlusion culling algorithm modifications. This analysis consists of both general performance and various performance-related analyses. Further down the road conclusions and recommendations are given based on performed work and overall results.