Evaluation of Hidden Surface Removal Methods Using Open GL
Al-Rafidain Engineering Journal (AREJ),
2021, Volume 26, Issue 2, Pages 300-308
10.33899/rengj.2021.129472.1081
Abstract
The research aims to address one of the complex problems that may be encountered when generating computer images for three-dimensional (3D) objects, which is the hidden surface detection and elimination. Several methods have been devised, through the last three decades, to solve this problem. However, the most popular methods used widely nowadays are depth or Z-Buffer (ZB) and Binary Space Partition Tree (BSPT). The first method (ZB) is very simple and more general but requires additional memory to store depth values in addition to intensity. On the other hand, (BSPT) method is more complex to implement but requires memory for pixel intensity only. Modelling graphical database in a binary tree make the dealing with parts of the database feasible. This is so important for clipping a part or more of the database when outside the viewing zone.The focus of this paper is to study these two methods, design an algorithm to implement each of them. After that a reasonable procedure is to found and applied for testing the performance of each of the two methods using exactly the same graphic load. A step by step increase of this load should be possible so that the behavior of the execution time at different complexity level and on average bases can be reported. The outcome results of the two methods should be compared and a recommendation to use which one of them is to be concluded [1]. Since one of the most popular graphics library which is being used during the last ten years and nowadays is the Open Graphic Library( OpenGL) from(Silicon Graphic Incorporation (SGI)[2], the algorithms of this work are implemented and the related software is carried out using this library with visual C platform.
Main Subjects:
- Article View: 17
- PDF Download: 19