SCOPUS 정보 검색 플랫폼

Volumn 25, Issue 1, 1997, Pages 177-193

On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347702216 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1006/jagm.1997.0869 Document Type: Article

Times cited : (23)

References (14)

1
- 0003864427
- Ph.D. thesis, University of British Columbia
- T. M. Chan, "Output-Sensitive Construction of Convex Hulls," Ph.D. thesis, University of British Columbia, 1995.
- (1995) Output-Sensitive Construction of Convex Hulls
- Chan, T.M.¹

2
- 0039173487
- Output-Sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three
- T. M. Chan, J. Snoeyink, and C. Yap, Output-Sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three, in Proc. of the 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 282-291, 1995.
- (1995) Proc. of the 6th ACM-SIAM Symposium on Discrete Algorithms , pp. 282-291
- Chan, T.M.¹ Snoeyink, J.² Yap, C.³

3
- 0014705383
- An algorithm for convex polytopes
- D. R. Chand and S. S. Kapur, An algorithm for convex polytopes, J. Assoc. Comput. Mech. 17 (1970), 78-86.
- (1970) J. Assoc. Comput. Mech. , vol.17 , pp. 78-86
- Chand, D.R.¹ Kapur, S.S.²

4
- 0021372387
- Linear time algorithms for two- and three-variable linear programs
- M. E. Dyer, Linear time algorithms for two- and three-variable linear programs, SIAM J. Comput. 13 (1984), 31-45.
- (1984) SIAM J. Comput. , vol.13 , pp. 31-45
- Dyer, M.E.¹

5
- 49649136358
- An efficient algorithm for determining the convex hull of a finite planar set
- R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Inform. Process. Lett. 1 (1972), 132-133.
- (1972) Inform. Process. Lett. , vol.1 , pp. 132-133
- Graham, R.L.¹

6
- 0015599132
- On the identification of the convex hull of a finite set of points in the plane
- R. A. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Inform. Process. Lett. 2 (1973), 18-21.
- (1973) Inform. Process. Lett. , vol.2 , pp. 18-21
- Jarvis, R.A.¹

7
- 0003657590
- Addison-Wesley, Reading, MA
- D. E. Knuth, "The Art of Computer Programming. Vol. 3. Sorting and Searching," Addison-Wesley, Reading, MA, 1973.
- (1973) The Art of Computer Programming. Vol. 3. Sorting and Searching , vol.3
- Knuth, D.E.¹

8
- 0022663183
- The ultimate planar convex hull algorithm?
- D. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm? SIAM J. Comput. 15 (1986), 287-289.
- (1986) SIAM J. Comput. , vol.15 , pp. 287-289
- Kirkpatrick, D.¹ Seidel, R.²

9
- 0020828745
- 3 and related problems
- 3 and related problems, SIAM J. Comput. 30 (1983), 852-865.
- (1983) SIAM J. Comput. , vol.30 , pp. 852-865
- Megiddo, N.¹

10
- 0003487647
- Springer-Verlag, New York
- F. P. Preparata and M. I. Shamos, "Computational Geometry: An Introduction," Springer-Verlag, New York, 1985.
- (1985) Computational Geometry: An Introduction
- Preparata, F.P.¹ Shamos, M.I.²

12
- 0346009897
- Randomizing optimal geometric algorithms
- L. Shafer and W. Steiger, Randomizing optimal geometric algorithms, in Canadian Conference on Computational Geometry, 1993," pp. 133-138.
- (1993) Canadian Conference on Computational Geometry , pp. 133-138
- Shafer, L.¹ Steiger, W.²

14
- 0019625307
- A lower bound to finding convex hulls
- A. Yao, A lower bound to finding convex hulls, J. Assoc. Comput. Math. 28 (1981), 780-787.
- (1981) J. Assoc. Comput. Math. , vol.28 , pp. 780-787
- Yao, A.¹

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