-
1
-
-
0038850747
-
Visibility with reflection
-
B. Aronov, A. Davis, T.K. Dey, S.P. Pal, D.C. Prasad, Visibility with reflection, in: Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry, 1995, pp. 316-325.
-
(1995)
Proceedings of the Eleventh Annual ACM Symposium on Computational Geometry
, pp. 316-325
-
-
Aronov, B.1
Davis, A.2
Dey, T.K.3
Pal, S.P.4
Prasad, D.C.5
-
2
-
-
21344439275
-
Visibility with multiple reflections
-
Proceedings of the Scandinavian Workshop on Algorithm Theory
-
B. Aronov, A. Davis, T.K. Dey, S.P. Pal, D.C. Prasad, Visibility with multiple reflections, in: Proceedings of the Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 1097, 1996, pp. 284-295.
-
(1996)
Lecture Notes in Computer Science
, vol.1097
, pp. 284-295
-
-
Aronov, B.1
Davis, A.2
Dey, T.K.3
Pal, S.P.4
Prasad, D.C.5
-
3
-
-
0018515704
-
Algorithms for counting and reporting geometric intersections
-
J.L. Bentley, T. Ottmann, Algorithms for counting and reporting geometric intersections, IEEE Trans. Comput. 28 (1979) 643-647.
-
(1979)
IEEE Trans. Comput.
, vol.28
, pp. 643-647
-
-
Bentley, J.L.1
Ottmann, T.2
-
4
-
-
0038850746
-
An o(n log n) algorithm for computing a link center in a simple polygon
-
Proceedings of Sixth Symposium on Theoretical Aspects of Computer Science
-
H.N. Djidjev, A. Lingas, J.R. Sack, An o(n log n) algorithm for computing a link center in a simple polygon, in: Proceedings of Sixth Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 349, 1989, pp. 96-107.
-
(1989)
Lecture Notes in Computer Science
, vol.349
, pp. 96-107
-
-
Djidjev, H.N.1
Lingas, A.2
Sack, J.R.3
-
5
-
-
0000955797
-
A linear algorithm for computing the visibility polygon from a point
-
H. ElGindy, D. Avis, A linear algorithm for computing the visibility polygon from a point, J. Algorithms 2 (1981) 186-197.
-
(1981)
J. Algorithms
, vol.2
, pp. 186-197
-
-
Elgindy, H.1
Avis, D.2
-
6
-
-
0004490736
-
Computing the visibility polygon from a convex set and related problems
-
S.K. Ghosh, Computing the visibility polygon from a convex set and related problems, J. Algorithms 12 (1991) 75-95.
-
(1991)
J. Algorithms
, vol.12
, pp. 75-95
-
-
Ghosh, S.K.1
-
7
-
-
0023247608
-
Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons
-
L. Guibas, J. Hershberger, D. Leven, M Sharir, R. Tarjan, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica 2 (1987) 209-233.
-
(1987)
Algorithmica
, vol.2
, pp. 209-233
-
-
Guibas, L.1
Hershberger, J.2
Leven, D.3
Sharir, M.4
Tarjan, R.5
-
11
-
-
0041111213
-
Computing the link center of a simple polygon
-
W. Lenhart, R. Pollack, J. Sack, R. Seidal, M. Sharir, S. Suri, G. Toussaint, S. Whitesides, C. Yap, Computing the link center of a simple polygon, Discrete Comput. Geom. 3 (1988) 281-293.
-
(1988)
Discrete Comput. Geom.
, vol.3
, pp. 281-293
-
-
Lenhart, W.1
Pollack, R.2
Sack, J.3
Seidal, R.4
Sharir, M.5
Suri, S.6
Toussaint, G.7
Whitesides, S.8
Yap, C.9
-
13
-
-
0040628889
-
-
Ph.D. Thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
-
D.C. Prasad, New visibility problems: Combinatorial and computational complexities, Ph.D. Thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India, 1996.
-
(1996)
New Visibility Problems: Combinatorial and Computational Complexities
-
-
Prasad, D.C.1
-
14
-
-
0026923143
-
Recent results in art galleries
-
T. Shermer, Recent results in art galleries, Proceedings of the IEEE 80 (1992) 1384-1399.
-
(1992)
Proceedings of the IEEE
, vol.80
, pp. 1384-1399
-
-
Shermer, T.1
-
15
-
-
0022097228
-
A linear time algorithm for minimum link paths inside a simple polygon
-
S. Suri, A linear time algorithm for minimum link paths inside a simple polygon, Comput. Vision Graphics Image Processing 35 (1986) 99-110.
-
(1986)
Comput. Vision Graphics Image Processing
, vol.35
, pp. 99-110
-
-
Suri, S.1
-
16
-
-
0003828759
-
-
Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD
-
S. Suri, Minimum link paths in polygons and related problems, Ph.D. Thesis, Department of Computer Science, Johns Hopkins University, Baltimore, MD, 1987.
-
(1987)
Minimum Link Paths in Polygons and Related Problems
-
-
Suri, S.1
|