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

메뉴 건너뛰기

Discrete and Computational Geometry

Volumn 16, Issue 3, 1996, Pages 277-304

Isomorphism of spiral polygons

(2) MacDonald, G a Shermer, T a

a SIMON FRASER UNIVERSITY (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030516567 PISSN: 01795376 EISSN: None Source Type: Journal
DOI: 10.1007/BF02711513 Document Type: Article

Times cited : (2)

References (15)

1
- 0039044991
- Clear visibility and the dimension of kernels of starshaped sets
- M. Breen, Clear Visibility and the Dimension of Kernels of Starshaped Sets, Proc. Amer. Math. Soc. 85 (1982), 414-418.
- (1982) Proc. Amer. Math. Soc. , vol.85 , pp. 414-418
- Breen, M.¹

2
- 33744556173
- Visibility graphs of polygonal rings
- Quebec
- L. Cai and H. Everett, Visibility Graphs of Polygonal Rings, Proc. 7th Canadian Conf. on Computational Geometry, Quebec, 1995, pp. 157-161.
- (1995) Proc. 7th Canadian Conf. on Computational Geometry , pp. 157-161
- Cai, L.¹ Everett, H.²

3
- 0026460645
- An optimal algorithm for intersecting line segments in the plane
- B. Chazelle and H. Edelsbrunner, An Optimal Algorithm for Intersecting Line Segments in the Plane, J. Assoc. Comput. Mach. 39 (1992), 1-54.
- (1992) J. Assoc. Comput. Mach. , vol.39 , pp. 1-54
- Chazelle, B.¹ Edelsbrunner, H.²

4
- 0024137119
- Covering polygons is hard
- J. Culberson and R. Reckhow, Covering Polygons is Hard, Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 601-611.
- (1988) Proc. 29th IEEE Symp. on Foundations of Computer Science , pp. 601-611
- Culberson, J.¹ Reckhow, R.²

5
- 0001818143
- Recognizing visibility graphs of spiral polygons
- H. Everett and D. Corneil, Recognizing Visibility Graphs of Spiral Polygons, J. Algorithms 11 (1990), 1-26.
- (1990) J. Algorithms , vol.11 , pp. 1-26
- Everett, H.¹ Corneil, D.²

6
- 0023247608
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- L. Guibas, J. Hershberger, D. Leven, M. Sharir, and 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.¹ Hershberger, J.² Leven, D.³ Sharir, M.⁴ Tarjan, R.⁵

7
- 0013016956
- An efficient algorithm for link-distance problems
- Y. Ke, An Efficient Algorithm for Link-Distance Problems, Proc. 5th ACM Symp. on Computational Geometry, 1989, 69-78.
- (1989) Proc. 5th ACM Symp. on Computational Geometry , pp. 69-78
- Ke, Y.¹

8
- 0022683358
- Computational complexity of art gallery problems
- D. Lee and A. Lin, Computational Complexity of Art Gallery Problems, IEEE Trans. Inform. Theory 32, (1986), 276-282.
- (1986) IEEE Trans. Inform. Theory , vol.32 , pp. 276-282
- Lee, D.¹ Lin, A.²

9
- 33744712467
- M.Sc. Thesis, School of Computing Science, Simon Fraser University, Burnaby
- G. MacDonald, Isomorphism and Layout of Spiral Polygons, M.Sc. Thesis, School of Computing Science, Simon Fraser University, Burnaby, 1993.
- (1993) Isomorphism and Layout of Spiral Polygons
- MacDonald, G.¹

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

11
- 84922441895
- personal communication
- J. O'Rourke, personal communication.
- O'Rourke, J.¹

12
- 0039044989
- Hiding people in polygons
- T. Shermer, Hiding People in Polygons, Computing 42 (1989), 109-131.
- (1989) Computing , vol.42 , pp. 109-131
- Shermer, T.¹

13
- 0026923143
- Recent results in art galleries
- T. Shermer, Recent Results in Art Galleries, Proc. IEEE 80 (1992), 1384-1399.
- (1992) Proc. IEEE , vol.80 , pp. 1384-1399
- Shermer, T.¹

14
- 38249001715
- On recognizing unions of two convex polygons and related problems
- T. Shermer, On Recognizing Unions of Two Convex Polygons and Related Problems, Pattern Recognition Lett. 14 (1993), 737-745.
- (1993) Pattern Recognition Lett. , vol.14 , pp. 737-745
- Shermer, T.¹

15
- 0003828759
- Ph.D. Thesis, Johns Hopkins University, Baltimore, MD
- S. Suri, Minimum Link Paths in Polygons and Related Problems, Ph.D. Thesis, Johns Hopkins University, Baltimore, MD, 1987.
- (1987) Minimum Link Paths in Polygons and Related Problems
- Suri, S.¹

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