Visibility with a moving point of view-Reference-Cited by-同舟云学术

Visibility with a moving point of view

Published:1994-04 Issue:4 Volume:11 Page:360-378
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Bern Marshall,Dobkin David,Eppstein David,Grossman Robert

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01187019.pdf

Reference30 articles.

1. K. Abrahamson, N. Dadoun, D. K. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm,Proc. 25th Annual Allerton Conf. on Communications, Control, and Computing, 1987, pp. 624?633.

2. P. K. Agarwal,Intersection and Decomposition Algorithms for Planar Arrangements, Cambridge University Press, Cambridge, 1991.

3. M. J. Atallah, Some dynamic computational geometry problems,Comput. Math. Appl. 11 (1985), 1171?1181.

4. J. L. Bentley and T. A. Ottmann, Algorithms for reporting and counting geometric intersections,IEEE Trans. Comput. 28 (1979), 643?647.

5. R. Cole and M. Sharir, Visibility problems for polyhedral terrains,J. Symbolic Comput. 7 (1989), 11?30.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Largest empty circle centered on a query line;Journal of Discrete Algorithms;2010-06

2. Linear Data Structures for Fast Ray-Shooting amidst Convex Polyhedra;Algorithmica;2008-08-26

3. Multi‐visibility maps of triangulated terrains;International Journal of Geographical Information Science;2007-11

4. On incremental rendering of silhouette maps of a polyhedral scene;Computational Geometry;2007-10

5. REGION INTERVISIBILITY IN TERRAINS;International Journal of Computational Geometry & Applications;2007-08