SCOPUS 정보 검색 플랫폼

Volumn 27, Issue 4, 1987, Pages 458-473

Corrections to Lee's visibility polygon algorithm

Author keywords

computational geometry; F.2.2; visibility

Indexed keywords

MATHEMATICAL TECHNIQUES - GEOMETRY;

BLOCKED EXTERIOR CASE; COMPUTATIONAL GEOMETRY; INTERIOR CASE; VISIBILITY POLYGON ALGORITHM;

COMPUTER PROGRAMMING;

EID: 0023577153 PISSN: 00063835 EISSN: 15729125 Source Type: Journal
DOI: 10.1007/BF01937271 Document Type: Article

Times cited : (106)

References (8)

1
- 0000955797
- A linear algorithm for computing the visibility polygon from a point
- (1981) J. Algorithms , vol.2 , pp. 186-197
- El Gindy, H.¹ Avis, D.²

2
- 84909652108
- An algorithm for the solution of the two-dimensional hidden-line problem
- (1967) IEEE Trans. on Electronic Computers , vol.16 EC , pp. 784-790
- Freeman, H.¹ Loutrel, P.P.²

3
- 84936297858
- P. Henrici: Applied and Computational Complex Analysis, Vol. 1, John Wiley & Sons, (1974).

4
- 84936223842
- B. Joe and R. B. Simpson: Visibility of a simple polygon from a point, Technical Report CS-85-38. Dept. of Computer Science, Univ. of Waterloo, (1985).

5
- 0022716095
- Triangular meshes for regions of complicated shape
- (1986) Int. J. for Num. Meth. in Eng. , vol.23 , pp. 751-778
- Joe, B.¹ Simpson, R.B.²

6
- 84936241850
- B. Joe and R. B. Simpson: Algorithms and correctness proofs for visibility polygon computations, Technical Report CS-87-03, Dept. of Computer Science, Univ. of Waterloo, (1987).

7
- 0020124841
- Visibility of a simple polygon
- (1983) Computer Vision, Graphics, and Image Processing , vol.22 , pp. 207-221
- Lee, D.T.¹

8
- 0042549294
- Decomposition of polygons into convex sets
- (1978) IEEE Trans. on Comp. , vol.100-127 , pp. 1078-1082
- Schachter, B.¹

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