Home | Contact Us

C-Sharp | Java | Python | Swift | GO | WPF | Ruby | Scala | F# | JavaScript | SQL | PHP | Angular | HTML

Computer Graphics Back Face Removal Algorithm

Computer Graphics Back Face Removal Algorithm with Computer Graphics Tutorial, Line Generation Algorithm, 2D Transformation, 3D Computer Graphics, Types of Curves, Surfaces, Computer Animation, Animation Techniques, Keyframing, Fractals etc.

<< Back to COMPUTER

Back Face Removal Algorithm

It is used to plot only surfaces which will face the camera. The objects on the back side are not visible. This method will remove 50% of polygons from the scene if the parallel projection is used. If the perspective projection is used then more than 50% of the invisible area will be removed. The object is nearer to the center of projection, number of polygons from the back will be removed.

It applies to individual objects. It does not consider the interaction between various objects. Many polygons are obscured by front faces, although they are closer to the viewer, so for removing such faces back face removal algorithm is used.

When the projection is taken, any projector ray from the center of projection through viewing screen to object pieces object at two points, one is visible front surfaces, and another is not visible back surface.

This algorithm acts a preprocessing step for another algorithm. The back face algorithm can be represented geometrically. Each polygon has several vertices. All vertices are numbered in clockwise. The normal M1 is generated a cross product of any two successive edge vectors. M1represent vector perpendicular to face and point outward from polyhedron surface

                          N1=(v2-v1 )(v3-v2)
                          If         N1.P≥0 visible
                          N1.P<0 invisible


  1. It is a simple and straight forward method.
  2. It reduces the size of databases, because no need of store all surfaces in the database, only the visible surface is stored.

Back Face Removed Algorithm

Repeat for all polygons in the scene.

  1. Do numbering of all polygons in clockwise direction i.e.
                  v1 v2 v3.....vz
  2. Calculate normal vector i.e. N1
                  N1=(v2-v1 )*(v3-v2)
  3. Consider projector P, it is projection from any vertex
                  Calculate dot product
  4. Test and plot whether the surface is visible or not.
                  If Dot ≥ 0 then
                surface is visible
                        Not visible

Next TopicZ-Buffer Algorithm

Related Links:

Related Links

Adjectives Ado Ai Android Angular Antonyms Apache Articles Asp Autocad Automata Aws Azure Basic Binary Bitcoin Blockchain C Cassandra Change Coa Computer Control Cpp Create Creating C-Sharp Cyber Daa Data Dbms Deletion Devops Difference Discrete Es6 Ethical Examples Features Firebase Flutter Fs Git Go Hbase History Hive Hiveql How Html Idioms Insertion Installing Ios Java Joomla Js Kafka Kali Laravel Logical Machine Matlab Matrix Mongodb Mysql One Opencv Oracle Ordering Os Pandas Php Pig Pl Postgresql Powershell Prepositions Program Python React Ruby Scala Selecting Selenium Sentence Seo Sharepoint Software Spellings Spotting Spring Sql Sqlite Sqoop Svn Swift Synonyms Talend Testng Types Uml Unity Vbnet Verbal Webdriver What Wpf