Distributed visibility servers

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.

Bibliographic Details
Main Author: Brittain, Eric A. (Eric Audwoyne), 1972-
Other Authors: Seth J. Teller.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2005
Subjects:
Online Access:http://hdl.handle.net/1721.1/8948
_version_ 1826203027167510528
author Brittain, Eric A. (Eric Audwoyne), 1972-
author2 Seth J. Teller.
author_facet Seth J. Teller.
Brittain, Eric A. (Eric Audwoyne), 1972-
author_sort Brittain, Eric A. (Eric Audwoyne), 1972-
collection MIT
description Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.
first_indexed 2024-09-23T12:30:33Z
format Thesis
id mit-1721.1/8948
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T12:30:33Z
publishDate 2005
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/89482019-04-10T10:28:04Z Distributed visibility servers Brittain, Eric A. (Eric Audwoyne), 1972- Seth J. Teller. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001. Includes bibliographical references (leaves 54-55). This thesis describes techniques for computing conservative visibility exploiting viewpoint prediction, spatial coherence and remote visibility servers to increase the rendering performance of a walk through client. Identifying visible (or partially visible) geometry from an instantaneous viewpoint of a 3-D computer graphics model in real-time is an important problem in interactive computer graphics. Since rendering is an expensive process (due to transformations, lighting and scan-conversion), successfully identifying the exact set of visible geometry before rendering increases the frame-rate of real-time applications. However, computing this exact set is computationally intensive and prohibitive in real-time for large models. For many densely occluded environments that contain a small number of large occluding objects (such as buildings, billboards and houses), efficient conservative visibility algorithms have been developed to identify a set of occluded objects in real-time. These algorithms are conservative since they do not identify the exact set of occluded geometry. While visibility algorithms that identify occluded geometry are useful in increasing the frame-rate of interactive applications, previous techniques have not attempted to utilize a set of workstations connected via a local area network as an external compute resource. We demonstrated a configuration with one local viewer and two remote servers. by Eric A. Brittain. S.M. 2005-08-23T16:35:20Z 2005-08-23T16:35:20Z 2001 2001 Thesis http://hdl.handle.net/1721.1/8948 48990905 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 55 leaves 4766717 bytes 4766476 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
spellingShingle Electrical Engineering and Computer Science.
Brittain, Eric A. (Eric Audwoyne), 1972-
Distributed visibility servers
title Distributed visibility servers
title_full Distributed visibility servers
title_fullStr Distributed visibility servers
title_full_unstemmed Distributed visibility servers
title_short Distributed visibility servers
title_sort distributed visibility servers
topic Electrical Engineering and Computer Science.
url http://hdl.handle.net/1721.1/8948
work_keys_str_mv AT brittainericaericaudwoyne1972 distributedvisibilityservers