Fast and accurate visibility preprocessing

Simple item page
dc.contributor.advisorBlake, Edwin Hen_ZA
dc.contributor.authorNirenstein, Shaunen_ZA
dc.date.accessioned2015-01-05T07:08:17Z
dc.date.available2015-01-05T07:08:17Z
dc.date.issued2003en_ZA
dc.descriptionBibliography: leaves 147-158.en_ZA
dc.description.abstractCurrently, the standard approach to visibility preprocessing algorithms is to use a form of approximate solution, known as conservative culling. Such algorithms over-estimate the set of visible polygons. This compromise has been considered necessary in order to perform visibility preprocessing quickly. These algorithms attempt to satisfy the goals of both rapid preprocessing and rapid run-time rendering. We observe, however, that there is a need for algorithms with superior performance in preprocessing, as well as for algorithms that are more accurate. For most applications these features are not required simultaneously. In this thesis we present two novel visibility preprocessing algorithms, each of which is strongly biased toward one of these requirements.en_ZA
dc.identifier.apacitationNirenstein, S. (2003). <i>Fast and accurate visibility preprocessing</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Computer Science. Retrieved from http://hdl.handle.net/11427/11412en_ZA
dc.identifier.chicagocitationNirenstein, Shaun. <i>"Fast and accurate visibility preprocessing."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Computer Science, 2003. http://hdl.handle.net/11427/11412en_ZA
dc.identifier.citationNirenstein, S. 2003. Fast and accurate visibility preprocessing. University of Cape Town.en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Nirenstein, Shaun AB - Currently, the standard approach to visibility preprocessing algorithms is to use a form of approximate solution, known as conservative culling. Such algorithms over-estimate the set of visible polygons. This compromise has been considered necessary in order to perform visibility preprocessing quickly. These algorithms attempt to satisfy the goals of both rapid preprocessing and rapid run-time rendering. We observe, however, that there is a need for algorithms with superior performance in preprocessing, as well as for algorithms that are more accurate. For most applications these features are not required simultaneously. In this thesis we present two novel visibility preprocessing algorithms, each of which is strongly biased toward one of these requirements. DA - 2003 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 2003 T1 - Fast and accurate visibility preprocessing TI - Fast and accurate visibility preprocessing UR - http://hdl.handle.net/11427/11412 ER - en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/11412
dc.identifier.vancouvercitationNirenstein S. Fast and accurate visibility preprocessing. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Computer Science, 2003 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/11412en_ZA
dc.language.isoengen_ZA
dc.publisher.departmentDepartment of Computer Scienceen_ZA
dc.publisher.facultyFaculty of Scienceen_ZA
dc.publisher.institutionUniversity of Cape Town
dc.subject.otherComputer Scienceen_ZA
dc.titleFast and accurate visibility preprocessingen_ZA
dc.typeDoctoral Thesis
dc.type.qualificationlevelDoctoral
dc.type.qualificationnamePhDen_ZA
uct.type.filetypeText
uct.type.filetypeImage
uct.type.publicationResearchen_ZA
uct.type.resourceThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
thesis_sci_2003_nirenstein_s.pdf
Size:
18.37 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
PhD / Doctoral