Computing the shortest watchtower of a polyhedral terrain in O(n log n) time

Computational Geometry: Theory and Applications

Volumn 8, Issue 4, 1997, Pages 181-193

  Zhu, Binhai ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000681356     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00009-0     Document Type: Article

References (15)

1. B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Lines in space - combinatorics, algorithms and applications, in: Proc. 21st STOC (1989) 382-393.
2. B. Chazelle and L. Guibas, Fractional cascading, Part I: A data structuring technique, Algorithmica 1 (3) (1986) 133-162.
3. R. Cole, Searching and sorting similar lists, J. Algorithms 7 (3) (1986) 202-220.
4. R. Cole and M. Sharir, Visibility problems for polyhedral terrains, J. Symb. Comput. 7 (1989) 11-30.
5. B. Chazelle and M. Sharir, An algorithm for generalized point location and its application, J. Symb. Comput. 10 (3) (1990) 281-309.
6. L. deFloriani, B. Falcidieno, C. Pienovi, D. Allen and G. Nagy, A visibility-based model for terrain features, in: Proc. 2nd Internat. Symp. on Spatial Data Handling (1986) 235-250.
7. D.P. Dobkin and D.G. Kirkpatrick, A linear time algorithm for determining the separation of convex polyhedra, J. Algorithms 6 (4) (1985) 381-392.
8. D.P. Dobkin and D.G. Kirkpatrick, Determining the separation of preprocessed polyhedra - a unified approach, in: Proc. 17th ICALP (1990) 400-413.
9. D.G. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput. 12 (1) (1983) 28-35.
10. D. Muller and F. Preparata, Finding the intersection of n half-spaces in time O(n log n), Theoret. Comput. Sci. 8 (4) (1979) 45-55.
11. F.P. Preparata and 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 577 (Springer, Berlin, 1992) 135-146.
12. R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).
13. J.H. Reif and S. Sen, An efficient output-sensitive hidden-surface removal algorithms and its parallelization, in: Proc. 4th ACM Symp. on Computational Geometry (1988) 193-200.
14. M. Sharir, The shortest watchtower and related problems for polyhedral terrains, Inform. Process. Lett. 29 (5) (1988) 265-270.
15. N. Sarnak and R.E. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986) 669-679.