SCOPUS 정보 검색 플랫폼

Volumn 4, Issue 1, 1989, Pages 423-432

A fast las vegas algorithm for triangulating a simple polygon

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041002459 PISSN: 01795376 EISSN: 14320444 Source Type: Journal
DOI: 10.1007/BF02187741 Document Type: Article

Times cited : (35)

References (15)

1
- 84936595207
- M. J. Atallah, R. Cole, and M. T. Goodrich, Cascading divide-and-conquer: a technique for designing parallel algorithms, Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987, pp. 151–160.

2
- 0000351241
- Triangulation and shape complexity
- (1984) ACM Transactions on Graphics , vol.3 , pp. 135-152
- Chazelle, B.¹ Incerpi, J.²

3
- 0037765301
- New applications of random sampling in computational geometry
- (1987) Discrete and Computational Geometry , vol.2 , pp. 195-222
- Clarkson, K.L.¹

4
- 84936595205
- K. L. Clarkson, Applications of random sampling in computational geometry, II, Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, pp. 1–11.

5
- 84936595369
- K. L. Clarkson, R. Cole, and R. E. Tarjan, private communication.

6
- 84936595370
- K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II, Discrete and Computational Geometry, this issue, 387–421.

7
- 84936595371
- K. L. Clarkson, R. E. Tarjan, and C. J. Van Wyk, A fast Las Vegas algorithm for triangulating a simple polygon, Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988, pp. 18–22.

9
- 84910836060
- Triangulating simple polygons and equivalent problems
- (1984) ACM Transactions on Graphics , vol.3 , pp. 153-174
- Fournier, A.¹ Montuno, D.Y.²

10
- 84936595372
- K. Y. Fung, T. M. Nicholl, R. E. Tarjan, and C. J. Van Wyk, Simplified linear-time Jordan sorting and polygon clipping, ACM Transactions on Graphics, submitted.

12
- 15744365331
- ɛ-nets and simplex range queries
- (1987) Discrete and Computational Geometry , vol.2 , pp. 127-151
- Haussler, D.¹ Welzl, E.²

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

15
- 0023952676
- An O(n log log n)-time algorithm for triangulating a simple polygon
- (1988) SIAM Journal on Computing , vol.17 , pp. 143-178
- Tarjan, R.E.¹ Van Wyk, C.J.²

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