-
1
-
-
33744637415
-
Visibility graphs and oriented matroids
-
R. Tamassia, I.G. Tollis (Eds.), Springer, New York
-
J. Abello, K. Kumar, Visibility graphs and oriented matroids, in: R. Tamassia, I.G. Tollis (Eds.), Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894, Springer, New York, 1995, pp. 147-158.
-
(1995)
Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science
, vol.894
, pp. 147-158
-
-
Abello, J.1
Kumar, K.2
-
2
-
-
0019683897
-
An optimal algorithm for determining the visibility of a polygon from an edge
-
D. Avis, G.T. Toussaint, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput. 30 (1981) 910-1014.
-
(1981)
IEEE Trans. Comput.
, vol.30
, pp. 910-1014
-
-
Avis, D.1
Toussaint, G.T.2
-
3
-
-
0040339077
-
Recovery of convex hulls from external visibility graphs
-
Waterloo, Canada
-
H. Everett, A. Lubiw, J. O'Rourke, Recovery of convex hulls from external visibility graphs, in: Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 309-314.
-
(1993)
Proc. 5th Canad. Conf. Comput. Geom.
, pp. 309-314
-
-
Everett, H.1
Lubiw, A.2
O'Rourke, J.3
-
4
-
-
0031539050
-
On recognizing and characterizing visibility graphs of simple polygons
-
S.K. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, Discrete Comput. Geom. 17 (2) (1997) 143-162.
-
(1997)
Discrete Comput. Geom.
, vol.17
, Issue.2
, pp. 143-162
-
-
Ghosh, S.K.1
-
5
-
-
0026239341
-
An output-sensitive algorithm for computing visibility graphs
-
S.K. Ghosh, D.M. Mount, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput. 20 (1991) 888-910.
-
(1991)
SIAM J. Comput.
, vol.20
, pp. 888-910
-
-
Ghosh, S.K.1
Mount, D.M.2
-
6
-
-
0041103519
-
Semispaces of configurations, cell complexes of arrangements
-
I.E. Goodman, R. Pollack, Semispaces of configurations, cell complexes of arrangements, J. Combin. Theory Ser. A 37 (1984) 257-293.
-
(1984)
J. Combin. Theory Ser. A
, vol.37
, pp. 257-293
-
-
Goodman, I.E.1
Pollack, R.2
-
7
-
-
0023247608
-
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
-
L.J. Guibas, J. Hershberger, D. Leven, M. Sharir, R.E. 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.J.1
Hershberger, J.2
Leven, D.3
Sharir, M.4
Tarjan, R.E.5
-
8
-
-
0024774782
-
An optimal visibility graph algorithm for triangulated simple polygons
-
J. Hershberger, An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica 4 (1989) 141-155.
-
(1989)
Algorithmica
, vol.4
, pp. 141-155
-
-
Hershberger, J.1
-
9
-
-
0001604495
-
Computational geometry column 18
-
J. O'Rourke, Computational geometry column 18, Internat. J. Comput. Geom. Appl. 3 (1993) 107-113; also: SIGACT News 24 (1) (1993) 20-25.
-
(1993)
Internat. J. Comput. Geom. Appl.
, vol.3
, pp. 107-113
-
-
O'Rourke, J.1
-
10
-
-
0039397685
-
-
J. O'Rourke, Computational geometry column 18, Internat. J. Comput. Geom. Appl. 3 (1993) 107-113; also: SIGACT News 24 (1) (1993) 20-25.
-
(1993)
SIGACT News
, vol.24
, Issue.1
, pp. 20-25
-
-
-
11
-
-
85033886414
-
Pseudo-visibility graphs in pseudo-polygons: Part I
-
Dept. Comput. Sci., Smith College, Northampton, MA, January 1996; revised April
-
J. O'Rourke, I. Streinu, Pseudo-visibility graphs in pseudo-polygons: Part I, Technical Report 041, Dept. Comput. Sci., Smith College, Northampton, MA, January 1996; revised April 1996.
-
(1996)
Technical Report 041
-
-
O'Rourke, J.1
Streinu, I.2
-
12
-
-
85033886414
-
Pseudo-visibility graphs in pseudo-polygons: Part II
-
Dept. Comput. Sci., Smith College, Northampton, MA, April
-
J. O'Rourke, I. Streinu, Pseudo-visibility graphs in pseudo-polygons: Part II, Technical Report 042, Dept. Comput. Sci., Smith College, Northampton, MA, April 1996.
-
(1996)
Technical Report 042
-
-
O'Rourke, J.1
Streinu, I.2
|