Building optimal bounding volumes for real-time 3D visualization

• Autorzy: Iones A. , Zhukov S. , Krupkin A.
• Konferencja: Conference on Computer Graphics and Image Processing, GKPO' 98 (5 ; 18-22.05.1998 ; Borki, Poland)
• Języki publikacji: EN

Abstrakty

EN

Bounding volume hierarchies are widely employed in many areas of Computer Graphics. Usually they are used as crude approximations of scene geometry to speed up time-consuming computations such as visibility tests for frustum culling,ray shooting, etc. A number of bounding volume types have been disscrused by various researchers. They include bounding spheres,(14), axis-aligned and oriented bounding boxes (OBBs), (12,13) ,and others. Although it is practically possible to use any of these bounding volumes, some types prove to be particulary useful ib certain applications. E. g., Gottschalk et al. ([13]) used OBBs to implement a very effective exact collision detection scheme. In this paper we address the problem of efficient bounding volume selection, the solution of which allows us to significantly accelerate such operations as visibility tests for frustum culling and ray shooting. We prove that minimal surface area (minimal perimter in 2D) oriented bounding box is optimal among all the oriented bounding boxes whit respect to the tree operations stated agove. Then,we develop a numbers of algorithms to create optimal oriented bounding boxes and thier approximations and finaly discuss the results of our practical implementation.

Słowa kluczowe

EN

computational geometry; bounding method; frustrum culling; ray shooting; real-time graphics

• Wydawca: Institute of Information Technology of the Warsaw University of Life Sciences – SGGW
• Czasopismo: Machine Graphics and Vision
• Rocznik: 1998
• Tom: Vol. 7, No. 1/2
• Strony: 245--258
• Opis fizyczny: Bibliogr. 14 poz.

Twórcy

autor

Iones A.

autor

Zhukov S.

autor

Krupkin A.

• CREAT Studio (USA, SF) Applied Math Departament, St. Petersburg State Technical University (Russia)