An efficient output-sensitive hidden surface removal algorithm and its parallelization
暂无分享,去创建一个
[1] Franco P. Preparata,et al. An optimal real-time algorithm for planar convex hulls , 1979, CACM.
[2] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[3] Michael McKenna. Worst-case optimal hidden-surface removal , 1987, TOGS.
[4] Leonidas J. Guibas,et al. Visibility and intersectin problems in plane geometry , 1985, SCG '85.
[5] Alfred Schmitt,et al. Time and Space Bounds for Hidden Line and Hidden Surface Algorithms , 1981, Eurographics.
[6] Richard Cole,et al. Cascading divide-and-conquer: A technique for designing parallel algorithms , 1989, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[7] Bernard Chazelle,et al. Intersection of convex objects in two and three dimensions , 1987, JACM.
[8] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[9] D. T. Lee,et al. Location of a point in a planar subdivision and its applications , 1976, STOC '76.
[10] Kurt Mehlhorn,et al. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.
[11] Kurt Mehlhorn,et al. Arbitrary Weight Changes in Dynamic Trees , 1981, RAIRO Theor. Informatics Appl..
[12] Thomas J. Wright. A Two-Space Solution to the Hidden Line Problem for Plotting Functions of Two Variables , 1973, IEEE Transactions on Computers.
[13] Otto Nurmi. A fast line-sweep algorithm for hidden line elimination , 1985, BIT Comput. Sci. Sect..
[14] Leonidas J. Guibas,et al. Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..
[15] Richard Cole,et al. Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..