메뉴 건너뛰기




Volumn 6, Issue 2, 1996, Pages 231-241

A fast parallel algorithm for finding the convex hull of a sorted point set

Author keywords

Computational geometry; Convex hull; Parallel algorithms; PRAM

Indexed keywords


EID: 0030559190     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000162     Document Type: Article
Times cited : (14)

References (19)
  • 5
    • 0027574294 scopus 로고
    • Recursive *-tree parallel data-structure
    • O. Berkman and U. Vishkin, "Recursive *-tree parallel data-structure", SIAM J. Comput. 22 (1993) 221-242.
    • (1993) SIAM J. Comput. , vol.22 , pp. 221-242
    • Berkman, O.1    Vishkin, U.2
  • 6
    • 0042807186 scopus 로고
    • Lower bounds for parallel random access machines with unbounded shared memory
    • ed. P.P. Preparata JAI Press, Greenwich, CT
    • F.E. Fich, F. Meyer auf der Heide, P.L. Ragde, and A. Wigderson, "Lower bounds for parallel random access machines with unbounded shared memory", in Advances in Computing Research, Vol. 4, ed. P.P. Preparata (JAI Press, Greenwich, CT, 1987) pp. 1-15.
    • (1987) Advances in Computing Research , vol.4 , pp. 1-15
    • Fich, F.E.1    Meyer auf der Heide, F.2    Ragde, P.L.3    Wigderson, A.4
  • 7
    • 0024020142 scopus 로고
    • Relations between concurrent-write models of parallel computation
    • F.E. Fich, P.L. Ragde, and A. Wigderson, "Relations between concurrent-write models of parallel computation", SIAM J. Comput. 17 (1988) 606-627.
    • (1988) SIAM J. Comput. , vol.17 , pp. 606-627
    • Fich, F.E.1    Ragde, P.L.2    Wigderson, A.3
  • 10
    • 0345496339 scopus 로고
    • Finding the convex hull of a sorted point set in parallel
    • M.T. Goodrich, "Finding the convex hull of a sorted point set in parallel", Information Processing Letters, 26 (1987) 173-179.
    • (1987) Information Processing Letters , vol.26 , pp. 173-179
    • Goodrich, M.T.1
  • 11
    • 49649136358 scopus 로고
    • 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", Information Processing Letters, 1 (1972) 132-133.
    • (1972) Information Processing Letters , vol.1 , pp. 132-133
    • Graham, R.L.1
  • 13
  • 15
    • 0002886578 scopus 로고
    • Finding the maximum, merging, and sorting in a parallel computation model
    • Y. Shiloach and U. Vishkin, "Finding the maximum, merging, and sorting in a parallel computation model", J. Algorithms 2 (1981) 88-102.
    • (1981) J. Algorithms , vol.2 , pp. 88-102
    • Shiloach, Y.1    Vishkin, U.2
  • 16
    • 0022104026 scopus 로고
    • On parallel searching
    • M. Snir, "On parallel searching", SIAM J. Comput. 14 (1985) 688-707.
    • (1985) SIAM J. Comput. , vol.14 , pp. 688-707
    • Snir, M.1
  • 17
    • 0001261631 scopus 로고
    • Parallelism in comparison problems
    • L.G. Valiant, "Parallelism in comparison problems", SIAM J. Comput. 4 (1975) 348-355.
    • (1975) SIAM J. Comput. , vol.4 , pp. 348-355
    • Valiant, L.G.1


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