Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Fast and accurate visibility preprocessing
Bibliography: leaves 147-158.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
Department of Computer Science
2015
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1867613159653638145 |
|---|---|
| access_status_str | Open Access |
| author | Nirenstein, Shaun |
| author2 | Blake, Edwin H |
| author_browse | Blake, Edwin H Nirenstein, Shaun |
| author_facet | Blake, Edwin H Nirenstein, Shaun |
| author_sort | Nirenstein, Shaun |
| collection | Thesis |
| description | Bibliography: leaves 147-158. |
| format | Thesis |
| id | oai:open.uct.ac.za:11427/11412 |
| institution | University of Cape Town (South Africa) |
| language | eng |
| last_indexed | 2026-06-10T12:31:43.046Z |
| license_str | Not specified — see source repository |
| provenance_str_mv | Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository |
| publishDate | 2015 |
| publishDateRange | 2015 |
| publishDateSort | 2015 |
| publisher | Department of Computer Science |
| publisherStr | Department of Computer Science |
| record_format | dspace |
| source_str | UCTD — University of Cape Town Open Access Repository |
| spelling | oai:open.uct.ac.za:11427/11412 Fast and accurate visibility preprocessing Nirenstein, Shaun Blake, Edwin H Computer Science Bibliography: leaves 147-158. 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. 2015-01-05T07:08:17Z 2015-01-05T07:08:17Z 2003 Doctoral Thesis Doctoral PhD http://hdl.handle.net/11427/11412 eng application/pdf Department of Computer Science Faculty of Science University of Cape Town |
| spellingShingle | Computer Science Nirenstein, Shaun Fast and accurate visibility preprocessing |
| thesis_degree_str | Doctoral |
| title | Fast and accurate visibility preprocessing |
| title_full | Fast and accurate visibility preprocessing |
| title_fullStr | Fast and accurate visibility preprocessing |
| title_full_unstemmed | Fast and accurate visibility preprocessing |
| title_short | Fast and accurate visibility preprocessing |
| title_sort | fast and accurate visibility preprocessing |
| topic | Computer Science |
| url | http://hdl.handle.net/11427/11412 |
| work_keys_str_mv | AT nirensteinshaun fastandaccuratevisibilitypreprocessing |