References
- AGARWAL , P. K. and SHARIR , M. , 1986 , Applications of a new space partitioning technique . Discrete and Computational Geometry , 9 , 11 – 38 .
- COLE , R. and SHARIR , M. , 1989 , Visibility problems for polyhedral terrains . Journal of Symbolic Computation , 7 , 11 – 30 .
- DE BERG , M. , HALPERIN , D. , OVERMARS , M. , SNOEYINK , J. , and KREVELD , M. VAN , 1991 , Efficient ray shooting and hidden surface removal . Algorithmica: An International journal in computer Science , 12 , 30 – 53 .
- DE FLORIANI , L. , 1989 , A pyramidal data structure for triangle-based surface description . I.E.E.E. Computer Graphics and Applications , 9 , 67 – 78 .
- DE FLORIANI , L. , and PUPPO , E. , 1992 , A hierarchical triangle-based model for terrain description . In Theories and Methods of Spatio-Temporal Reasoning in Geographic Space , edited by A. V. Frank and I. Campari . Lecture Notes in Computer Science , 639 ( New York : Springer-Verlag ), pp. 236 – 251 .
- DE FLORIANI , L. , and MAGILLO , P. , 1993 , Computing visibility maps on a Digital Terrain Model . In Proceedings European Conference on Spatial Information Theory (COSIT) , edited by A. V. Frank , I. Campari and V. Formentini . Lecture Notes in Computer Science , 716 ( New York : Springer-Verlag ), pp. 248 – 269 .
- DEVAI , F. , 1986 , Quadratic bounds for hidden line elimination . In Proceedings 2nd ACM Symposium on Computational Geometry , ( New York : ACM Press ), pp. 269 – 275 .
- FISHER , P. F. , 1993 , Algorithm and implementation uncertainty in viewshed analysis . International Journal of Geographical Information Systems , 7 , 331 – 347 .
- GOODCHILD , M. F. , and LEE , J. , 1989 , Coverage problems and visibility regions on topographic surfaces . Annals of Operation Research , 20 , 175 – 186 .
- HART , S. , and SHARIR , M. , 1986 , Non-linearity of Davenport-Schintzel sequences and of generalized path compression schemes . Combinatorica , 6 , 151 – 177 .
- KATZ , M. J. , OVERMARS , M. H. , and SHARIR , M. , 1991 , Efficient hidden surface removal for objects with small union size . In Proceedings 7th ACM Symposium on Computational Geometry ( New York : ACM Press ), pp. 31 – 40 .
- KIRKPATRICK , D. G. , 1983 , Optimal search in planar subdivision . SIAM Journal of Computing , 12 , 28 – 33 .
- LEE , J. and PREPARATA , F. P. , 1977 , Location of a point in a planar subdivision and its applications . SIAM Journal of Computing , 6 , 594 – 606 .
- LEE , J. , 1991 , Analyses of visibility sites on topographic surfaces . International Journal of Geographical Information Systems , 5 , 413 – 429 .
- MCKENNA , M. , 1987 , Worst case optimal hidden surface removal . ACM Transactions on Graphics , 6 , 19 – 28 .
- MULMULEY , K. , 1989 , An efficient algorithm for hidden surface removal . In Proceedings ACM Symposium on Computer Graphics , 23 ( New York : ACM Press ), pp. 379 – 388 .
- OVERMARS , M. and SHARIR , M. , 1992 , A simple output-sensitive algorithm for hidden surface removal . ACM Transactions on Graphics , 11 , 1 – 11 .
- PREPARATA , F. P. and SHAMOS , M. I. , 1985 , Computational Geometry : An Introduction ( Berlin New York : Springer Verlag ).
- REIF , J. H. and SEN , S. , 1988 , An efficient output-sensitive hidden-surface removal algorithm and its parallelization . In Proceedings 4th ACM Symposium on Computational Geometry, Urbana ( New York : ACM Press ), pp. 193 – 200 .
- SARNAK , N. and TARJAN , R. E. , 1986 , Planar point location using persistent search trees . Communications of the ACM , 29 , 669 – 679 .
- SCHMITT , A. , 1981 , Time and space bounds for hidden line and hidden surface algorithms . In Proceedings Eurographics ( Amsterdam : North Holland ), pp. 43 – 56 .