Hidden line removal (HLR) is the method of computing which edges are not hidden by the faces of parts for a specified view and the display of parts in the projection of a model into a 2D plane. Hidden line removal is utilized by a CAD to display the visual lines. It is considered that information openly exists to define a 2D wireframe model as well as the 3D topological information.

Various hidden line algorithm are as follows:

1. Image space algorithm
2. Priority algorithm
3. Floating horizon algorithm
4. Object space algorithm
5. Ray tracing
6. Roberts Warnock

Priority algorithm

Priority algorithm is basis on organization all the polygons in the view according to the biggest Z-coordinate value of each. If a face intersects more than one face, other visibility tests besides the Z-depth required to solve any issue. This step comprises purposes of wrapper.

Imagines that objects are modeled with lines and lines are generated where surfaces join. If only the visible surfaces are created then the invisible lines are automatically removed.

ABCD, ADFG, DCEF are given higher priority-1. Hence, all lines in this faces are visible, that is, AB, BC, CD, DA, AD, DF, FG, AG, DC, CE, EF and DF are visible.

AGHB, EFGH, BCEH are given lower priority-2. Hence, all lines in this faces other than priority-1 are invisible, that is BH, EH and GH. These lines must be eliminated.