Three-dimensional weak visibility: Complexity and applications

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 219-232

  Wang, Cao An ^a   Zhu, Binhai ^b  

^a MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Computational geometry; Polyhedral terrain; Visibility

Indexed keywords

EID: 0347968342     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00132-7     Document Type: Article

References (30)

1. P. Agarwal, M. Sharir, On the number of views of polyhedral terrains, in: Proc. 5th Canadian CG Conf., 1993, pp. 55-60.
2. D. Avis, T. Gum, G. Toussaint, Visibility between two edges of a simple polygon, Visual Comput. 2 (6) (1986) 342-357.
3. D. Avis, G.T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput. C-30 (1981) 910-1014.
4. M. Bern, D. Dobkin, D. Eppstein, R. Grossman, Visibility with a moving point of view, Algorithmica 11 (1994) 360-378.
5. B.K. Bhattacharya, A. Mukhopadhyay, G.T. Toussaint, A linear time algorithm for computing the shortest line segment from which a polygon is weakly visible, in: Proc. 2nd Workshop Algorithms Data Struct., Lecture Notes in Computer Science, vol. 519, Springer, Berlin, 1991, p. 412-A24.
6. P. Bose, T. Shermer, G. Toussaint, B. Zhu, Guarding polyhedral terrains, Comput. Geometry: Theory Appl. 7 (1997) 173-185.
7. B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, Line in space-combinatorics, algorithms and applications, in: Proc. 21st STOC, 1989, pp. 382-393.
8. D.Z. Chen, An optimal parallel algorithm for detecting weak visibility of a simple polygon, in: Proc. 8th Annu. ACM Symp. Comput. Geom., 1992, pp. 63-72.
9. D.Z. Chen, Optimally computing the shortest weakly visible subedge of a simple polygonm, in: Proc. 4th Annu. Internat. Symp. Algorithms Comput. (ISAAC 93), Lecture Notes in Computer Science, vol. 762, Springer, Berlin, 1993, pp. 323-332.
10. R. Cole, M. Sharir, Visibility problems for polyhedral terrains, J. Symbolic Comput. 7 (1989) 11-30.
11. M. Cohen, J. Wallace, Radiosity and Realistic Image Synthesis, Academic Press, New York, 1993.
12. L. deFloriani, B. Falcidieno, C. Pienovi, D. Allen, G. Nagy, A visibility-based model for terrain features, in: Proc. 2nd Internat. Symp. on Spatial Data Handling, 1986, pp. 235-250.
13. H. Edelsbrunner, L. Guibas, J. Pach, R. Pollack, R. Seidel, M. Sharir, Arrangements of curves in the plane: topology, combinatorics, and algorithms, Theoret. Comput. Sci. 92 (1992) 319-336.
14. Z. Gigus, J. Canny, R. Seidel, Efficiently computing and representing aspect graphs of polyhedral objects, IEEE Trans. PAMI 13 (6) (1991) 542-551.
15. Z. Gigus, J. Malik, Computing the aspect graphs for line drawings of polyhedral objects, IEEE Trans. PAMI 12 (2) (1990) 113-122.
16. S.K. Ghosh, A. Maheshwari, S.P. Pal, S. Saluja, C.E. Veni Madhavan, Characterizing weak visibility polygons and related problems, in: Proc. 2nd Canad. Conf. Comput. Geom., 1990, pp. 93-97.
17. S.K. Ghosh, D.M. Mount, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput. 20 (1991) 888-910.
18. 2) problems in computational geometry, Report 1993-15, Department of Comput. Sci., Utrecht Univ., 1993.
19. J. Lee, Analyses of visibility sites on topographic surfaces, Int. J. GIS. 5 (1991) 413-429.
20. J. Matoušek, N. Miller, J. Pach, M. Sharir, S. Sifrony, E. Welzl, Fat triangles determine linearly many holes, in: Proc. 32nd Annu. IEEE Symp. Found. Comput. Sci., 1991, pp. 49-58.
21. H. Plantinga, An algorithm for finding the weakly visible faces from a polygon in 3-d, in: Proc. 4th Canad. Conf. Comput. Geom., 1992, pp. 45-51.
22. H. Plantinga, C. Dyer, Visibility, occlusion, and the aspect graph, Int. J. Comput. Vision 5 (1990) 137-160.
23. F.P. Preparata, J.S. Vitter, A simplified technique for hidden-line elimination in terrains, in: Proc. 9th Symp. Theoret. Aspects Comput. Sci., Lecture Notes in Computer Science, vol. 577, Springer, Berlin, 1992, pp. 135-146.
24. J.H. Reif, S. Sen, An efficient output-sensitive hidden-surface removal algorithms and its parallelization, in: Proc. 4th Annu. ACM Symp. Comput. Geom., 1988, pp. 193-200.
25. J.-R. Sack, S. Suri, An optimal algorithm for detecting weak visibility of a polygon, Report SCS-TR-114, School Comput. Sci., Carleton Univ., Ottawa, ON, 1986.
26. M. Sharir, The shortest watchtower and related problems for polyhedral terrains, Inform. Process. Lett., 29 (5) (1988) 265-270.
27. S.J. Teller, Computing the antipenumbra of an area light source, Comput. Graph. 26 (4) (1992) 139-148.
28. S. Teller, P. Hanrahan, Global visibility algorithms for illumination computations, in: Proc. SIGGRAPH '93, 1993, pp. 239-246.
29. B. Zhu, Computational geometry in two and a half dimensions, Ph.D., Thesis, School of Computer Science, McGill University, Montreal, Canada, 1994.
30. B. Zhu, Computing the shortest watchtower of a polyhedral terrain in O(n log n) time, Comput. Geometry: Theory Appl. 8 (1997) 181-193.