SCOPUS 정보 검색 플랫폼

Volumn 33, Issue 3, 2006, Pages 165-173

A linear time algorithm to remove winding of a simple polygon

Author keywords

Algorithm; Pruning; Revolution; Visibility polygon; Winding

Indexed keywords

EID: 84867954545 PISSN: 09257721 EISSN: None Source Type: Journal
DOI: 10.1016/j.comgeo.2005.05.001 Document Type: Article

Times cited : (4)

References (13)

2
- 33745512033
- Visibility of disjoint polygons
- Ta. Asano, Te. Asano, L.J. Guibas, J. Hershberger, and H. Imai Visibility of disjoint polygons Algorithmica 1 1986 49 63
- (1986) Algorithmica , vol.1 , pp. 49-63
- Asano, Ta.¹ Asano, Te.² Guibas, L.J.³ Hershberger, J.⁴ Imai, H.⁵

3
- 0022131733
- Efficient algorithms for finding the visibility polygons for a polygonal region with holes
- Te. Asano Efficient algorithms for finding the visibility polygons for a polygonal region with holes Trans. IECE Japan E68 1985 557 559
- (1985) Trans. IECE Japan , vol.68 E , pp. 557-559
- Asano, Te.¹

4
- 0018655601
- Computational models of space: Isovists and isovist fields
- L. Davis, and M. Benedikt Computational models of space: Isovists and isovist fields Comput. Graph. Image Process. 11 1979 49 72
- (1979) Comput. Graph. Image Process. , vol.11 , pp. 49-72
- Davis, L.¹ Benedikt, M.²

5
- 0000647688
- A servey of object-space hidden surface removal
- S.E. Dorward A servey of object-space hidden surface removal Internat. J. Comput. Geom. Appl. 4 1994 325 362
- (1994) Internat. J. Comput. Geom. Appl. , vol.4 , pp. 325-362
- Dorward, S.E.¹

6
- 0000955797
- A linear algorithm for computing the visibility polygon from a point
- H. ElGindy, and 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.¹ Avis, D.²

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

8
- 0029250227
- An optimal algorithm for computing visibility in the plane
- P.J. Heffernan, and J.S.B. Mitchell An optimal algorithm for computing visibility in the plane SIAM J. Comput. 24 1 1995 184 201
- (1995) SIAM J. Comput. , vol.24 , Issue.1 , pp. 184-201
- Heffernan, P.J.¹ Mitchell, J.S.B.²

9
- 0022436559
- Sorting Jordan sequences in linear time using level-linked search trees
- K. Hoffmann, K. Mehlhorn, P. Rosenstiehl, and R.E. Tarjan Sorting Jordan sequences in linear time using level-linked search trees Inform. Control 68 1986 170 184
- (1986) Inform. Control , vol.68 , pp. 170-184
- Hoffmann, K.¹ Mehlhorn, K.² Rosenstiehl, P.³ Tarjan, R.E.⁴

10
- 33747288736
- On the correctness of a linear-time visibility polygon algorithm
- B. Joe On the correctness of a linear-time visibility polygon algorithm International J. Comput. Math. 32 1990 155 172
- (1990) International J. Comput. Math. , vol.32 , pp. 155-172
- Joe, B.¹

11
- 0023577153
- Corrections to Lee's visibility polygon algorithm
- B. Joe, and R.B. Simpson Corrections to Lee's visibility polygon algorithm BIT 27 1987 458 473
- (1987) BIT , vol.27 , pp. 458-473
- Joe, B.¹ Simpson, R.B.²

12
- 0020124841
- Visibility of a simple polygon
- D.T. Lee Visibility of a simple polygon Comput. Vis. Graph. Image Process. 22 1983 207 221
- (1983) Comput. Vis. Graph. Image Process. , vol.22 , pp. 207-221
- Lee, D.T.¹

13
- 85041675959
- Worst-case optimal algorithms for constructing visibility polygons with holes
- S. Suri, J. O'Rourke, Worst-case optimal algorithms for constructing visibility polygons with holes, in: Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, 1986, pp. 14-23
- (1986) Proceedings of the 2nd Annual ACM Symposium on Computational Geometry , pp. 14-23
- Suri, S.¹ O'Rourke, J.²

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