Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume

Visibility algorithms have recently regained attention because of the ever increasing size of polygon datasets and more dynamic objects in a scene. Dynamic objects handling makes large polygon datasets impossible to display in real time with conventional approaches. Therefore, occlusion culling tech...

Full description

Saved in:

Bibliographic Details
Main Author:	Paunoo @ Balu, Baldeve
Format:	Thesis
Language:	English
Published:	2006
Subjects:	QA75 Electronic computers Computer science
Online Access:	http://eprints.utm.my/id/eprint/5143/1/BaldevePaunooBaluMFSKSM2006.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-utm-ep.5143
record_format	uketd_dc
spelling	my-utm-ep.51432018-02-28T06:55:17Z Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume 2006-04 Paunoo @ Balu, Baldeve QA75 Electronic computers. Computer science Visibility algorithms have recently regained attention because of the ever increasing size of polygon datasets and more dynamic objects in a scene. Dynamic objects handling makes large polygon datasets impossible to display in real time with conventional approaches. Therefore, occlusion culling techniques are required for output-sensitive rendering. Most scenes are displayed with static objects and only a few use dynamic objects in their visualization. In this thesis, the aim of the research carried out, is to handle dynamic objects efficiently with faster frame rate display. This algorithm is implemented using portal occlusion culling and kD-tree, which is suitable for indoor and architectural scenes. An occlusion culling technique was developed for handling dynamic objects in static scenes using dynamic bounding volume. Dynamic objects are wrapped in bounding volumes and then inserted into spatial hierarchical data structure as a volume to avoid updating the structure of every dynamic object at each frame. Dynamic bounding volumes are created for each occluded dynamic object by using physical constraints of that object and are assigned with a validity period. These bounding volumes and validity periods are later inserted into kD-tree. The dynamic objects are ignored until the bounding volume is visible or the validity period has expired. After numerous tests and analysis have been done, dynamic bounding volume culling shows better performance than portal culling especially when there are many low speed dynamic objects in the scene. Dynamic bounding volume culling proved to be efficient in avoiding enormous calculations of dynamic objectâ€™s position thus improves the rendering speed. 2006-04 Thesis http://eprints.utm.my/id/eprint/5143/ http://eprints.utm.my/id/eprint/5143/1/BaldevePaunooBaluMFSKSM2006.pdf application/pdf en public masters Universiti Teknologi Malaysia, Faculty of Computer Science and Information System Faculty of Computer Science and Information System
institution	Universiti Teknologi Malaysia
collection	UTM Institutional Repository
language	English
topic	QA75 Electronic computers Computer science
spellingShingle	QA75 Electronic computers Computer science Paunoo @ Balu, Baldeve Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
description	Visibility algorithms have recently regained attention because of the ever increasing size of polygon datasets and more dynamic objects in a scene. Dynamic objects handling makes large polygon datasets impossible to display in real time with conventional approaches. Therefore, occlusion culling techniques are required for output-sensitive rendering. Most scenes are displayed with static objects and only a few use dynamic objects in their visualization. In this thesis, the aim of the research carried out, is to handle dynamic objects efficiently with faster frame rate display. This algorithm is implemented using portal occlusion culling and kD-tree, which is suitable for indoor and architectural scenes. An occlusion culling technique was developed for handling dynamic objects in static scenes using dynamic bounding volume. Dynamic objects are wrapped in bounding volumes and then inserted into spatial hierarchical data structure as a volume to avoid updating the structure of every dynamic object at each frame. Dynamic bounding volumes are created for each occluded dynamic object by using physical constraints of that object and are assigned with a validity period. These bounding volumes and validity periods are later inserted into kD-tree. The dynamic objects are ignored until the bounding volume is visible or the validity period has expired. After numerous tests and analysis have been done, dynamic bounding volume culling shows better performance than portal culling especially when there are many low speed dynamic objects in the scene. Dynamic bounding volume culling proved to be efficient in avoiding enormous calculations of dynamic objectâ€™s position thus improves the rendering speed.
format	Thesis
qualification_level	Master's degree
author	Paunoo @ Balu, Baldeve
author_facet	Paunoo @ Balu, Baldeve
author_sort	Paunoo @ Balu, Baldeve
title	Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
title_short	Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
title_full	Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
title_fullStr	Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
title_full_unstemmed	Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
title_sort	dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume
granting_institution	Universiti Teknologi Malaysia, Faculty of Computer Science and Information System
granting_department	Faculty of Computer Science and Information System
publishDate	2006
url	http://eprints.utm.my/id/eprint/5143/1/BaldevePaunooBaluMFSKSM2006.pdf
_version_	1747814566852558848

Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume

Similar Items