Algorithms for hidden-lines removal of polyhedra on scan line
Jingli Yang · Journal of Anhui University · 2006
Counting segment intersection in algorithms for hidden-lines removal of polyhedra adopts traditional algorithms usually.In order to improve the speed of counting segment intersection,we apply scan line algorithm which is recent research production in computational geometry field to counting segment intersection,instead of traditional algorithm of counting segment intersection.And through establishing continuous relations among segments in the space position,it achieves to eliminate hidden-lines fleetly.