An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains

In this paper, we present an algorithm for hidden surface removal for a class of polyhedral surfaces which have a property that they can be ordered relatively quickly. For example, our results apply directly to terrain maps. A distinguishing feature of our algorithm is that its running time is sensitive to the actual size of the visible image, rather than the total number of intersections in the image plane which can be much larger than the visible image. The time complexity of this algorithm is O((k + n) log^2n) where n and k are, respectively, the input and the output sizes. Thus, in a significant number of situations this will be faster than the worst case optimal algorithms which have running time of @W(n^2) irrespective of the output size.

[1]  Kurt Mehlhorn,et al.  Multi-dimensional searching and computational geometry , 1984 .

[2]  Leonidas J. Guibas,et al.  Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..

[3]  Ferenc Dévai,et al.  Quadratic bounds for hidden line elimination , 1986, SCG '86.

[4]  Micha Sharir,et al.  Efficient Hidden Surface Removal for Objects with Small Union Size , 1992, Comput. Geom..

[5]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[6]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[7]  Micha Sharir,et al.  Output-sensitive hidden surface removal , 1989, 30th Annual Symposium on Foundations of Computer Science.

[8]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[9]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

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

[11]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[12]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[13]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[14]  Marshall W. Bern,et al.  Hidden surface removal for rectangles , 1988, SCG '88.

[15]  Kurt Mehlhorn,et al.  Sorting and Searching , 1984 .

[16]  Leonidas J. Guibas,et al.  Visibility and intersectin problems in plane geometry , 1985, SCG '85.

[17]  Jeffrey Scott Vitter,et al.  A Simplified Technique for Hidden-Line Elimination in Terrains , 1992, STACS.

[18]  Michael T. Goodrich.  A polygonal approach to hidden-line and hidden-surface elimination , 1992, CVGIP Graph. Model. Image Process..

[19]  Thomas J. Wright.  A Two-Space Solution to the Hidden Line Problem for Plotting Functions of Two Variables , 1973, IEEE Transactions on Computers.

[20]  Otto Nurmi.  A fast line-sweep algorithm for hidden line elimination , 1985, BIT Comput. Sci. Sect..

[21]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.

[22]  John H. Reif,et al.  An efficient output-sensitive hidden surface removal algorithm and its parallelization , 1988, SCG '88.