Algorithms for removing the hidden lines of 2D figures in assembly drawing

Zhao Qi-cheng · 2000

An efficient algorithm is put forward which can remove the hidden lines. Firstly, the definition of the view is presented; then the hidden relations are obtained by using bound Rectangle. Therefore, the bound in which the hidden lines will be searched is reduced. As a result, the degree of calculating intersecting pairs is reduced. A kind of method acts on figure elements. The algorithm is efficient and reliable. Finally, an example is offered.

Read the paper · More papers on PaperTik