1 / 12

Visibility Computations

Visibility Computations. Visible Surface Determination Global Visibility Computations Visibility Culling. Visible Surface Determination. Given a set of 3D objects and a viewing specification, determine the lines or surfaces of the object that are visible

loring
Download Presentation

Visibility Computations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Visibility Computations • Visible Surface Determination • Global Visibility Computations • Visibility Culling Dinesh Manocha, 770

  2. Visible Surface Determination Given a set of 3D objects and a viewing specification, determine the lines or surfaces of the object that are visible • Hidder-line or hidden-surface elimination • Visible-line or visible-surface determination Dinesh Manocha, COMP236

  3. Visible Surface Determination No best solution • Fast algorithms for interactive computer graphics • Detailed realistic solutions: shadows, transparency and texture effects • Computer animation: reflections and refractions Trade-off between speed and detail Dinesh Manocha, COMP236

  4. Use of Sorting All visible surface algorithms involve sorting [Sutherland et al.74] • Sort based on the geometric distance of a volume, edge or surface from the viewpoint • Use of coherence to improve its efficiency: the tendency for the characteristics of a scene to be locally constant. Dinesh Manocha, COMP236

  5. Object Space Algorithms Implemented in the physical coordinate system in which the objects are described foreach object in the worlddo begin determine those parts of the object whose view is unobstructed by other parts of it or any or any other object; draw those parts in the appropriate color end Dinesh Manocha, COMP236

  6. Image Space Algorithms Implemented in the screen coordinate system in which the objects are viewed foreach pixel in the imagedo begin determine the object closest to the viewer that is pierced by the projector through the pixel; draw the pixel in the appropriate color end Dinesh Manocha, COMP236

  7. Visibility: Too Bloody Difficult [Whitted’93] A difference classification of visibility • Back-end accumulator (e.g. Z-buffer) • Middle-end accumulator (scan-line conversion) • Front-end accumulator (e.g. ray tracing) Dinesh Manocha, COMP236

  8. Secondary Visibility [Whitted’93] • Shadows • Environment Mapping • Ray Tracing • Radiosity Dinesh Manocha, COMP236

  9. Visibility Partitioning Preprocess [Whitted’93] • Is a very expensive process • Only limited to static scenes • Things have changed with faster hardware Dinesh Manocha, COMP236

  10. Cookie Cutter Algorithms General object space approaches that involve geometric partitioning • Sutherland 1971-72 • Weiler/Atherton 1977 • Abram 1986 Dinesh Manocha, COMP236

  11. Area Visibility or Global Visibility Visibility from a region or space • Cohen et al. 1986 • Teller et al. 1991, 93 • Heckbert 1991 Dinesh Manocha, COMP236

  12. Visibility Culling Eliminate a subset of the model not visible from the current viewpoint • View-frustum culling • Backface culling • Occlusion culling Dinesh Manocha, 770

More Related