Visible - Visible-Surface Detection Methods Chapter 9...

Info iconThis preview shows pages 1–8. Sign up to view the full content.

View Full Document Right Arrow Icon
Visible-Surface Detection Methods Chapter 9 Intro. to Computer Graphics Spring 2009, Y. G. Shin
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
The Visibility Problem [Problem Statement] GIVEN: a set of 3-D surfaces, a projection from 3-D to 2-D screen, DETERMINE: the nearest surface encountered at any point on 2-D screen Remove of hidden parts of an object Hidden-surface removal : surface rendering Hidden-line removal : line drawing
Background image of page 2
Techniques Visible-surface algorithms are 3D versions of sorting, i.e., depth comparison Avoid comparing all pairs of objects using the following coherence: object coherence: no comparison between components of objects if objects are separated each other face coherence: surface properties vary smoothly across a face edge coherence: an edge changes its visibility not frequently
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Techniques implied edge coherence: line of intersection of two face can be determined from two intersection points scan-line coherence: little change in visible spans from one scanline to another area coherence: a group of pixels is often covered by the same visible surface span coherence: (special case of area coherence) homogeneous runs in a scanline depth coherence: adjacent parts of the same surface are typically close in depth frame coherence: animation frames contain small changes from the previous frame
Background image of page 4
Techniques for Efficient Algorithms Bounding volumes approximate complex objects with simple enclosures before making comparisons. the simplest approximate enclosure is a boundary box
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Backface Removal (Backface Culling) Remove entire polygons that face away from the viewer If we are dealing with a single convex object, culling completely solves the hidden surface problem Geometric test for the visibility surface visible : 0 < N V V N s silhouette : 0 = N V
Background image of page 6
Back-face Culling More. . Vertex order in surface normal calculation
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 8
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/29/2010 for the course CSE 4190.411 taught by Professor Shinyeonggil during the Fall '08 term at Seoul National.

Page1 / 27

Visible - Visible-Surface Detection Methods Chapter 9...

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online