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. Thank you!
Presentation is loading. Please wait.
Published byTheresa Bangs
Modified over 3 years ago
CSC418 Computer Graphics n Polygon normals n Back Faces n Visibility Algorithms
Polygon Normal n Triangle normal calculation n Polygon normal calculation n Polymeshes (vertex normals)
Polygon Normal n Triangle normal calculation N=(P2-P1)X(P3-P2) P2 P3 P1
Polygon Normal n Polygon normal calculation N=(P2-P1)X(P3-P2) P2 P3 P1 P4 P5 Pn
Polygon Normal n Polygon normal calculation N=(P2-P1)X(P3-P2) Problems n Sliver triangles n Non-planar polygons P2 P3 P1 P4 P5 Pn
Polygon Normal n Polygon normal calculation Nx = yj – yi)(zj + zi) Ny = zj – zi)(xj + xi) Nz = xj – xi)(yj + yi) j= (i+1) mod n P2 P3 P1 P4 P5 Pn
Polymesh Normal n Face normals
Polymesh Normal n Vertex normals
Polymesh Normal n Vertex normals average the face normals
Bilinear Interpolation P uv = (1-u)(1-v)P0 + ( u )(1-v)P1 + ( u )( v )P2 + (1-u)( v )P3 P0 P1 P2 P3 u v P uv
Bilinear Interpolation P uv = (1-u)(1-v)P0 + ( u )(1-v)P1 + ( u )( v )P2 + (1-u)( v )P3 P0 P1 P2 P3 u v P uv Gourard shading (color interpolation)
Visibility Problem n What is NOT visible?
Visibility Problem n What is NOT visible? primitives outside of the field of view back-facing primitives primitives occluded by other objects closer to the camera
V N E
n N.V > 0 is a back face?
Backface culling n N.(P-E) >0 V N E P
Backface culling Where in the graphics pipeline can we do backface culling? canonical projection
Occluded faces Does backface culling always determine visibility completely for a single object?
Occluded faces n In typical scenes some polygons will overlap, we must determine which portion of each polygon is visible to eye!
Painters Algorithm n Sort primitives in Z. n Draw primitives back to front (CBA). A B C
Painters Algorithm n Problems –Large faces –Intersecting faces –Cycles
Visibility Problem n Image space algorithms –Operate in display terms pixels, scanlines –Visibility resolved to display resolution –Examples: Z-buffer, ray-tracing –O(n*resolution) n Object Space algorithms –Analytically compute visible fragments –Examples: painters algorithm, BSP –O(n 2 )
CSC418 Computer Graphics n Next Lecture –BSP trees –Depth sorting –Z-buffer A-buffer
Computer Graphics Inf4/MSc 28/10/08Lecture 91 Computer Graphics Lecture 9 Visible Surface Determination Taku Komura.
CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.
Computer Graphics Inf4/MSc Computer Graphics Lecture 9 Visible Surface Determination.
3D Graphics Rendering and Terrain Modeling
David Luebke5/11/2015 CS 551 / 645: Introductory Computer Graphics David Luebke
Lecture Fall 2001 Visibility Back-Face Culling Painter’s Algorithm.
Hidden Surface Removal CSE 581. Visibility Assumption: All polygons are opaque What polygons are visible with respect to your view frustum? Outside:
CS 551 / 645: Introductory Computer Graphics Visible Surface Determination.
CAP4730: Computational Structures in Computer Graphics Visible Surface Determination.
CECS461 Computer Graphics II University of Missouri at Columbia Hidden Surface Removal.
Visibility in Computer Graphics Toni Sellarès Unversitat de Girona
Computer Graphics Visible Surface Determination. Goal of Visible Surface Determination To draw only the surfaces (triangles) that are visible, given a.
Graphics Graphics Korea University cgvr.korea.ac.kr 1 Hidden Surface Removal 고려대학교 컴퓨터 그래픽스 연구실.
Part I: Basics of Computer Graphics
CS 445 / 645: Introductory Computer Graphics
UBI 516 Advanced Computer Graphics
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2007 Tamara Munzner Clipping II, Hidden Surfaces.
Chapter 6: Vertices to Fragments Part 2 E. Angel and D. Shreiner: Interactive Computer Graphics 6E © Addison-Wesley Mohan Sridharan Based on Slides.
© 2019 SlidePlayer.com Inc. All rights reserved.