HAN Qi-Rui, LI Lan-You. A FAST ALGORITHM TO THE HIDDEN LINE PROBLEM FOR 2.5D POLYHEDRAJ. Journal of Computer-Aided Design & Computer Graphics, 1998, 10(3): 216-220.
Citation:
HAN Qi-Rui, LI Lan-You. A FAST ALGORITHM TO THE HIDDEN LINE PROBLEM FOR 2.5D POLYHEDRAJ. Journal of Computer-Aided Design & Computer Graphics, 1998, 10(3): 216-220.
HAN Qi-Rui, LI Lan-You. A FAST ALGORITHM TO THE HIDDEN LINE PROBLEM FOR 2.5D POLYHEDRAJ. Journal of Computer-Aided Design & Computer Graphics, 1998, 10(3): 216-220.
Citation:
HAN Qi-Rui, LI Lan-You. A FAST ALGORITHM TO THE HIDDEN LINE PROBLEM FOR 2.5D POLYHEDRAJ. Journal of Computer-Aided Design & Computer Graphics, 1998, 10(3): 216-220.
A FAST ALGORITHM TO THE HIDDEN LINE PROBLEM FOR 2.5D POLYHEDRA
Generally speaking,the calculation to hidden-line problem for polyhedra is complexity.But the caluclation for 2.5D polyhedra is easier to tackle by taking advantage of the feature of the 2.5D polyhedra.In this paper the hidden line problem for 2.5D polyhedra is discussed and a fast algorithm is given.With this algorithm the depth testing is not needed and the works for solving for points of intersection become much less.
DownLoad: