Show simple item record

Fast and accurate visibility preprocessing

dc.contributor.advisorBlake, Edwin Hen_ZA
dc.contributor.authorNirenstein, Shaunen_ZA
dc.date.accessioned2015-01-05T07:08:17Z
dc.date.accessioned2018-11-26T13:53:29Z
dc.date.available2015-01-05T07:08:17Z
dc.date.available2018-11-26T13:53:29Z
dc.date.issued2003en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/11412
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/11427/11412
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.language.isoengen_ZA
dc.subject.otherComputer Scienceen_ZA
dc.titleFast and accurate visibility preprocessingen_ZA
dc.typeThesisen_ZA
dc.type.qualificationlevelDoctoralen_ZA
dc.type.qualificationnamePhDen_ZA
dc.publisher.institutionUniversity of Cape Town
dc.publisher.facultyFaculty of Scienceen_ZA
dc.publisher.departmentDepartment of Computer Scienceen_ZA


Files in this item

FilesSizeFormatView
thesis_sci_2003_nirenstein_s.pdf19.25Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record