Efficient hidden surface removal for objects with small union size

Agarwal, 1991, Ray shooting and parametric search Bern, 1990, Hidden surface removal for rectangles, J. Comp. Syst. Sci., 40, 49, 10.1016/0022-0000(90)90018-G Bentley, 1979, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput., 28, 643, 10.1109/TC.1979.1675432 de Berg, 1991, Efficient ray shooting and hidden surface removal, Proc. 7th ACM Symp. on Computational Geometry, 21 de Berg, 1990, Hidden surface removal for axis-parallel polyhedra, Proc. 31st IEEE Symp. on Foundations of Computer Science, 252, 10.1109/FSCS.1990.89544 de Berg, 1992, Computing and verifying depth orders, Proc. 8th ACM Symp. on Computational Geometry, 138 Chazelle, 1992, Counting and cutting cycles of lines and rods in space, Comput. Geom. Theory Appl., 1, 305, 10.1016/0925-7721(92)90009-H Cole, 1989, Visibility problems for polyhedral terrains, J. Symbolic Comput., 7, 11, 10.1016/S0747-7171(89)80003-3 Dévai, 1986, Quadratic bounds for hidden line elimination, Proc. 2nd ACM Symp. on Computational Geometry, 269 Goodrich, 1987, A polygonal approach to hidden line elimination, Proc. 25th Allerton Conf. on Communication, Control and Computing, 849 Goodrich, 1990, An input-size output-size trade-off in the time-complexity of rectilinear hidden surface removal, 443, 689 Güting, 1987, New algorithms for special cases of the hidden line elimination problem, Comp. Vision, 40, 188, 10.1016/S0734-189X(87)80114-7 Katz, 1991, Efficient hidden surface removal for objects with small union size, Proc. 7th ACM Symp. on Computational Geometry, 31 Kedem, 1986, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete Comput. Geom., 1, 59, 10.1007/BF02187683 Mairson, 1988, Reporting and counting intersections between two sets of line segments, Vol F-40, 307 Matoušek, 1993, Fat triangles determine linearly many holes, SIAM J. Comput. McKenna, 1987, Worst-case optimal hidden surface removal, ACM Trans. Graphics, 6, 19, 10.1145/27625.27627 Mulmuley, 1989, An efficient algorithm for hidden surface removal, I, Computer Graphics, 23, 379, 10.1145/74334.74372 Nurmi, 1985, A fast line-sweep algorithm for hidden line elimination, BIT, 25, 172, 10.1007/BF01935366 Overmars, 1989, Output-sensitive hidden surface removal, Proc. 30th IEEE Symp. on Foundations of Computer Science, 598, 10.1109/SFCS.1989.63541 Overmars, 1991, Merging visibility maps, Comput. Geom. Theory Appl., 1, 35, 10.1016/0925-7721(91)90011-3 Paterson, 1990, Binary space partitions with applications to hidden surface removal and solid modeling, Discrete Comput. Geom., 5, 485, 10.1007/BF02187806 Preparata, 1985 Preparata, 1990, Computation of the axial view of a set of isothetic parallelepipeds, ACM Trans. Graphics, 9, 278, 10.1145/78964.78967 Reif, 1988, An efficient output-sensitive hidden surface removal algorithm and its parallelization, Proc. 4th ACM Symp. on Computational Geometry, 193 Sharir, 1992, A simple output-sensitive algorithm for hidden surface removal, ACM Trans. Graphics, 11, 1, 10.1145/102377.112141 Schmitt, 1981, Time and space bounds for hidden line and hidden surface algorithms, Eurographics '81, 43 Sutherland, 1974, A characterization of ten hidden-surface algorithms, Comput. Surveys, 6, 1, 10.1145/356625.356626 Agarwal, 1992, Applications of a new space partitioning technique, Discrete Comput. Geom., 9