论文信息 - Space-Optimal Hidden Line Elimination for Rectangles

Space-Optimal Hidden Line Elimination for Rectangles

Abstract The hidden line elimination problem for an input of iso-oriented rectangles of size n and output of size k can be solved in O (n log n + k log( n 2 k )) time and optimal O(n) space.

Athanasios K. Tsakalidis | Nectarios Kitsios

[1] Marshall Bern. Hidden Surface Removal for Rectangles , 1990, J. Comput. Syst. Sci..

[2] Kurt Mehlhorn,et al. Hidden Line Elimination for Isooriented Rectangels , 1990, Inf. Process. Lett..

[3] Ralf Hartmut Güting,et al. New algorithms for special cases of the hidden line elimination problem , 1987, Comput. Vis. Graph. Image Process..

[4] Mikhail J. Atallah,et al. An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version) , 1990, ICALP.