Object space algorithm: Back-Face removal. · No faces on the back of the object are displayed. · In general – about half of objects faces are back faces. Computer Graphics Lecture 8 Hidden Surface Removal Taku Komura 1 1 Or if N.V > 0 we are viewing the back face so polygon is obscured. . Tree construction and traversal (object-space ordering algorithm – good for relatively few static. Occluded surfaces: hidden surface removal (visibility). ▫ Back faces: back face culling. ▫ Faces OpenGL): Z-buffer (or depth buffer) algorithm. ▫ Requires lots .
|Published (Last):||15 January 2005|
|PDF File Size:||17.17 Mb|
|ePub File Size:||11.82 Mb|
|Price:||Free* [*Free Regsitration Required]|
We think you have liked this presentation. If you wish to download it, please recommend it to your friends in any social system. Share buttons are a little bit lower. Published by Tyler Maxwell Modified over 3 years ago. Primitive lies outside field of view last lecture Primitive is back-facing Primitive is occluded by one or more graphcis nearer the viewer hidden surface removal 3 3.
We do not draw polygons facing the other direction Test z component of surface normals. If negative graphivs cull, since normal points away from viewer. Need to decide the order to draw — far objects first 7 7.
Key issue is order determination. Choose polygon arbitrarily Divide scene into front relative to normal and back half-spaces. Remval any polygon lying on both sides.
Choose a polygon from each side — split scene again. Recursively divide each side until each node contains only 1 polygon.
Lecture 9 Choose polygon arbitrarily 3 4 1 2 5 5a 5b back front Choose polygon arbitrarily Divide scene into front relative to normal and back half-spaces.
Choose polygon arbitrarily 5 5a 5b 2 Choose polygon arbitrarily Divide scene into front relative to normal and back half-spaces. Choose polygon arbitrarily 3 4 1 2 5 5a 5b back front Choose polygon arbitrarily Divide scene into front relative to normal and back half-spaces. Once we have the regions — need priority list BSP tree can be traversed to yield a correct priority list for an arbitrary viewpoint. Start at root polygon. If viewer is in front half-space, draw polygons behind root first, then the root polygon, then polygons in front.
If viewer is in back half-space, draw polygons in front of root first, then the root polygon, then polygons behind. If polygon is on edge — either can be used. Recursively descend the tree.
If eye is in rear half-space for a polygon can back face cull. A lot of computation required at start. Try to split polygons along good dividing plane Intersecting polygon splitting may be costly Cheap to check visibility once tree is set up.
Can be used to generate correct visibility for arbitrary views.
Initialise frame buffer to background remobal. Advantage Simple to implement in hardware. Memory for z-buffer is now not expensive Diversity of primitives — not just polygons. Disadvantage Waste time drawing hidden objects Z-precision errors May have to use point sampling Very important. Cells or rooms F Model scene as a graph: Cells or rooms Edges: Portals or doors Graph gives us: Chapter 15, all ij it.
Introductory text, Chapter 13, all of it Or equivalents in other texts, look out for: Collisions and Intersections When objects move, test for collision.
When projecting surfaces, check for intersections. Many slides adapted from Amitabh. All polygons are opaque What polygons are visible with respect to your view frustum?
Back Face Removal
Hidden Surface Removal Why make the effort? My presentations Profile Feedback Log out. Auth with social network: Registration Forgot your password? Download ppt “Hidden Surface Removal”. Introductory Computer Graphics David Backfaxe.
Hidden Surface Removal – ppt download