An input-size/output-size trade-off in the time-complexity of rectilinear hidden surface removal

Authors:
Michael T. Goodrich;Mikhail J. Atallah;Mark H. Overmars
Affiliations:
-;-;-
Venue:
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Year:
1990

Generalized sweep methods for parallel computational geometry

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Merging visibility maps

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient hidden surface removal for objects with small union size

SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A simple output-sensitive algorithm for hidden surface removal

ACM Transactions on Graphics (TOG)
Generalized hidden surface removal

SCG '93 Proceedings of the ninth annual symposium on Computational geometry

Hi-index	0.00