Bounding Volumes in Computer Graphics Master thesis

نویسنده

  • Petr Konečný
چکیده

Zadání Prostudujte publikované metody, které používají obalová tělesa a jejich hierarchie v počítačové grafice. Zaměřte se ná ulohyřešení globální iluminace a detekce kolizí. V písemnéčásti vypracujte porovnání vybran´ych metod a teoreticky zpracujte nově navženou metodu. V praktickéčásti práce vyzkoušejte některé z těchto metod a porovnejte v´ysledky získané při vyhodnocení experimentálních scén. Task Investigate published methods that use bounding volumes and their hierarchies in the computer graphics. Focus on the problems of global illumination and collision detection. In written part compare selected methods and theoretically examine new method. In practical part implement some of these methods and compare results obtained on experimental scenes. 2 Prohlášení Prohlašuji, ˇ ze tato práce je m´ym p ˚ uvodním autorsk´ym dílem, které jsem vypracoval samostatně. Všechny zdroje, prameny a literaturu, které jsem při vypracování používal a z nichž jsemčerpal, v práciřádně cituji s uvedenímúplného odkazu na příslušn´y zdroj. Declaration I declare that this thesis is my original work and that I have written it independently. All sources and literature that I have used during elaboration of the thesis are cited with complete reference to the corresponding source. Acknowledgement First of all I would like to thank Jiří Sochor, the supervisor of the thesis, for numerous advices and invaluable discussions during my work on it. This work would not be possible without Karel Zikan who has drawn my attention to the subject and provided support during the research as well as enormous amount of help in many mathematical topics. My thanks go also to Henry Sowizral of Sun Microsystems for support during first implementation of these ideas. I would also like to thank researchers from SUNY at Stony Brook who kindly provided their implementation for comparison purposes, namely Martin Held, James Klosowski and Joseph Mitchell. The work on this thesis would be much harder without existence of Debian GNU/Linux distribution. Each letter in this thesis (and then some more) was typed on a keyboard attach to this system. 3 Abstract In this thesis we show how the techniques based on bounding volume hierarchies can be used to solve various problems in computer graphics. We concentrate mainly on the problem of collision detection and a more general task of proximity computation. We employ a special class of bounding volumes – fixed directions hulls – to implement time and memory efficient algorithms for these problems. The fixed directions hulls are analyzed in a detail and some rarely used …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tighter Bounding Volumes for Better Occlusion Culling Performance

Bounding volumes are used in computer graphics to approximate the actual geometric shape of an object in a scene. The main intention is to reduce the costs associated with visibility or interference tests. The bounding volumes most commonly used have been axis-aligned bounding boxes and bounding spheres. In this paper, we propose the use of discrete orientation polytopes (k-dops) as bounding vo...

متن کامل

Using Projection to Accelerate Ray Tracing

Using Projection to accelerate Ray Tracing Anastasia Bezerianos M.Sc. Graduate Department of Computer Science University of Toronto 2001 The high cost of Ray Tracing image rendering has driven many researchers to devise acceleration techniques like bounding volume hierarchies. This thesis introduces new ways of building bounding volume hierarchies. We modify existing algorithms to use bounding ...

متن کامل

Easy Realignment of k-DOP Bounding Volumes

In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is equally efficient for rigid motions as for arbitrary point motions (deformations). We propose a new efficient realignment algorithm, which produces tighter results compared to all known algorithms. It can be implemented ...

متن کامل

Implementation of Axis-aligned Bounding Box for Opengl 3d Virtual Environment

This paper describes a simple and straight forward implementation of Axis-Aligned Bounding-Box (AABB) for OpenGL 3-Dimensional (3D) virtual environment for games and simulation purpose. The implementation of AABB is conducted in OpenGL graphic library version 1.2 with C++ programming language by using Visual C++. The implementation could help young and begineer computer graphics student to mast...

متن کامل

Efficient bounding of displaced Bézier patches

In this paper, we present a new approach to conservative bounding of displaced Bézier patches. These surfaces are expected to be a common use case for tessellation in interactive and real-time rendering. Our algorithm combines efficient normal bounding techniques, min-max mipmap hierarchies and oriented bounding boxes. This results in substantially faster convergence for the bounding volumes of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998