Repetitive Hidden Surface Removal for Polyhedra

Journal of Algorithms

Volumn 21, Issue 1, 1996, Pages 80-101

  Pellegrini, Marco ^a  

^a CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES;

INTERACTIVE SYSTEM; POLYHEDRON;

GRAPH THEORY;

EID: 0030371596     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0038     Document Type: Article

References (36)

1. P. K. Agarwal and J. Maloušek, Range searching with semialgebraic sets, in "Proc. of the 17th Symp. on Mathematical Foundations of Computer Science," number 629 in Lecture Notes in Computer Science, pages 1-13, 1992.
2. P. K. Agarwal and J. Matoušek, Ray shooting and parametric search, in "Proceedings of the 24th Annual ACM Symposium on Theory of Computing," pages 517-526, 1992.
3. P. K. Agarwal and M. Sharir, Applications of a new space partitioning technique, in "Proceedings of the 1991 Workshop on Algorithms and Data Structures," Lecture Notes in Computer Science, Vol. 519, pp. 379-391, Springer-Verlag, Berlin/New York, 1991.
4. M. Bern, D. Dobkin, D. Eppstein, and R. Grossman, Visibility with a moving point, in "Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, 1990," pp. 107-117.
5. M. Bern, Hidden surface removal for rectangles, J. Comput. System Sci. 40 (1989), 49-59.
6. J. L. Bentley and T. Ottman, Algorithms for reporting and counting geometric intersections, IEEE Trans. Comput. C-28 (1979), 643-647.
7. B. Chazelle, M. Sharir, and E. Welzl, Quasi-optimal upper bounds for simplex range searching and new zone theorems, in "Proceedings of the 6th ACM Symposium on Computational Geometry, 1990," pp. 23-33.
8. M. de Berg, Dynamic output-sensitive hidden surface removal for c-oriented polyhedra, Comput. Geom. Theory Appl. 2 (1992), 119-140.
9. M. de Berg, "Efficient Algorithms for Ray-Shooting and Hidden Surface Removal," Ph.D. thesis, Dept. of Comp. Sci., Utrecht University, 1992.
10. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld, Efficient ray-shooting and hidden surface removal, in "Proceedings of the 7th ACM Symposium on Computational Geometry, 1991," pp. 21-30.
11. M. de Berg, D. Halperin, M. Overmars, and M. van Kreveld, Sparse arrangements and the number of views of polyhedral scenes, manuscript, June 1992.
12. M. de Berg and M. Overmars, Hidden surface removal for axis-parallel polyhedra, in "Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990," pp. 252-261.
13. M. de Berg and M. Overmars, Hidden surface removal for c-oriented polyhedra, Comput. Geom. Theory Appl. 1, No. 5 (1992), 247-268.
14. H. Edelsbrunner, "Algorithms in Combinatorial Geometry," Springer-Verlag, Berlin/New York, 1987.
15. H. Edelsbrunner, L. Guibas, and J. Stolfi, Optimal point location in a monotone subdivision, SIAM J. Comput. 15 (1986), 317-339.
16. H. Fuchs, Z. M. Kedem, and B. Naylor, On visible surface generation by a priori tree structures, Comput. Graph. 14, No. 3 (1980), 124-133.
17. J. D. Foley, A. Van Dam, S. K. Feiner, and J. F. Hughes, "Computer Graphics: Principles and Practice," Addison-Wesley, Reading, MA, 1990.
18. Z. Gigus, J. Canny, and R. Seidel, Efficiently computing and representing aspect graphs of polyhedral objects, IEEE Trans. Pattern Anal. Mach. Intell. 13 (1991), 542-551.
19. Z. Gigus and J. Malik, Computing the aspect graphs for line drawings of polyhedral objects, IEEE Trans. Pattern Anal. Mach. Intell. 12 (1990), 113-122.
20. D. Kirkpatrick, Optimal search in planar subdivision, SIAM J. Comput. 12 (1983), 28-35.
21. J. J. Koenderink and J. van Doom, The singularities of visual mapping, Biol. Cybernet. 24 (1976), 51-59.
22. J. J. Koenderink and J. van Doom, The internal representation of solid shape with respect to vision, Biol. Cybernet. 32 (1979), 211-216.
23. J. Matoušek, Cutting hyperplane arrangements, Discrete Comput. Geom. 6 (1992), 315-334.
24. J. Matoušek, Efficient partition trees, Discrete Comput. Geom. 8 (1992), 315-334.
25. N. Megiddo, Applying parallel computation algorithms in the design of sequential algorithms, J. Assoc. Comput. Mach. 30 (1983), 852-865.
26. K. Mehlhorn, "Multidimensional Searching and Computational Geometry," Chap. 2, Springer-Verlag, Berlin/New York, 1984.
27. K. Mulmuley, Hidden surface removal with respect to a moving view point, in "Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991," pp. 512-522.
28. M. Overmars and M. Sharir, Output-sensitive hidden surface removal, in "Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 1989," pp. 598-603.
29. W. H. Plantiga and C. R. Dyer, An algorithm for constructing the aspect graph, in "Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986," pp. 123-131.
30. W. H. Plantiga and C. R. Dyer, Visibility, occlusion and the aspect graph, Internat. J. Comput. Vision 5 (1990), 137-160.
31. M. Pellegrini, Ray shooting on triangles in 3-space, Algorithmica 9 (1993), 471-494.
32. M. Pellegrini, On collision-free placements of simplices and the closest pair of lines in 3-space, SIAM J. Comput. 23, No. 1 (1994), 133-153.
33. M. S. Paterson and F. F. Yao, Efficient binary space partitions for hidden-surface removal and solid modeling, Discrete Comput. Geom. 5 (1990), 485-503.
34. J. H. Reif and S. Sen, An efficient output-sensitive hidden-surface removal algorithms and its parallelization, in "Proc. 4th Annu. ACM Sympos. Comput. Geom., 1988," pp. 193-200.
35. J. Snoeyink, The number of views of axis-parallel objects, Algorithmic Rev. 2 (1991), 27-32.
36. I. E. Sutherland, R.F. Sproul, and R. A. Schumaker, A characterization of ten hidden-surface algorithms, Comput. Surveys 6, No. 1 (1974), 1-55.