SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Computational Geometry: Theory and Applications

Volumn 16, Issue 4, 2000, Pages 235-243

Planar segment visibility graphs

(4) Everett, H a Hoang C T b Kilakos, K c Noy, M d

a LORIA (France)

b LAKEHEAD UNIVERSITY (Canada)

c LONDON SCHOOL OF ECONOMICS (United Kingdom)

d UNIVERSITAT POLITÈCNICA DE CATALUNYA (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346385887 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/S0925-7721(00)00009-2 Document Type: Article

Times cited : (7)

References (15)

1
- 0000254759
- On visibility graphs of simple polygons
- J. Abello, H. Lin, S. Pisupati, On visibility graphs of simple polygons, Congr. Numer. 90 (1992) 119-128.
- (1992) Congr. Numer. , vol.90 , pp. 119-128
- Abello, J.¹ Lin, H.² Pisupati, S.³

2
- 38249008851
- Some results on visibility graphs
- T. Andreae, Some results on visibility graphs, Discrete Appl. Math. 40 (1992) 5-18.
- (1992) Discrete Appl. Math. , vol.40 , pp. 5-18
- Andreae, T.¹

3
- 0039331818
- Empty simplices in Euclidean space
- I. Barany, Z. Füredi, Empty simplices in Euclidean space, Canad. Math. Bull. 30 (1987) 436-445.
- (1987) Canad. Math. Bull. , vol.30 , pp. 436-445
- Barany, I.¹ Füredi, Z.²

4
- 0003524084
- MacMillan, New York
- J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, MacMillan, New York, 1976.
- (1976) Graph Theory with Applications
- Bondy, J.A.¹ Murty, U.S.R.²

5
- 0347551976
- Triangulating with high connectivity
- T.K. Dey, M.B. Dillencourt, S.K. Ghosh, Triangulating with high connectivity, in: Proc. of the 6th Canadian Conf. on Computational Geometry, 1994, pp. 339-343.
- (1994) Proc. of the 6th Canadian Conf. on Computational Geometry , pp. 339-343
- Dey, T.K.¹ Dillencourt, M.B.² Ghosh, S.K.³

6
- 0004252604
- Springer, New York
- R. Diestel, Graph Theory, Graduate Texts in Mathematics, Vol. 173, Springer, New York, 1997.
- (1997) Graph Theory, Graduate Texts in Mathematics , vol.173
- Diestel, R.¹

7
- 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.¹ Mount, D.M.²

8
- 0001592623
- Konvexe Fünfecke in ebenen Punktmengen
- H. Harborth, Konvexe Fünfecke in ebenen Punktmengen, Elem. Math. 33 (1978) 116-118.
- (1978) Elem. Math. , vol.33 , pp. 116-118
- Harborth, H.¹

9
- 0001434692
- Sets with no empty convex 7-gon
- J.D. Horton, Sets with no empty convex 7-gon, Canad. Math. Bull. 26 (1983) 482-484.
- (1983) Canad. Math. Bull. , vol.26 , pp. 482-484
- Horton, J.D.¹

10
- 0025399908
- Connectivity of plane triangulations
- J.-P. Laumond, Connectivity of plane triangulations, Inform. Process. Lett. 34 (1990) 87-96.
- (1990) Inform. Process. Lett. , vol.34 , pp. 87-96
- Laumond, J.-P.¹

11
- 0346436234
- Planar visibility graphs
- S.-Y. Lin, C. Chen, Planar visibility graphs, in: Proc. of the 6th Canadian Conf. on Computational Geometry, 1994, pp. 30-35.
- (1994) Proc. of the 6th Canadian Conf. on Computational Geometry , pp. 30-35
- Lin, S.-Y.¹ Chen, C.²

12
- 0003862832
- Oxford University Press, New York
- J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
- (1987) Art Gallery Theorems and Algorithms
- O'Rourke, J.¹

13
- 0039397685
- Computational geometry column 18
- J. O'Rourke, Computational Geometry Column 18, SIGACT News 24 (1993) 20-25.
- (1993) SIGACT News , vol.24 , pp. 20-25
- O'Rourke, J.¹

14
- 0039844849
- A unified approach to visibility representations of planar graphs
- R. Tamassia, I. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
- (1986) Discrete Comput. Geom. , vol.1 , pp. 321-341
- Tamassia, R.¹ Tollis, I.²

15
- 85046605718
- Characterizing bar line-of-sight graphs
- S. Wismath, Characterizing bar line-of-sight graphs, in: Proc. 1st ACM Symp. on Computational Geometry, 1985, pp. 147-152.
- (1985) Proc. 1st ACM Symp. on Computational Geometry , pp. 147-152
- Wismath, S.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.