메뉴 건너뛰기




Volumn 30, Issue 3, 1990, Pages 378-384

A sublogarithmic convex hull algorithm

Author keywords

computational geometry; convex hull problem; divide and conquer; F.1.2; F.2.2; Parallel algorithms; pram

Indexed keywords


EID: 0345496340     PISSN: 00063835     EISSN: 15729125     Source Type: Journal    
DOI: 10.1007/BF01931655     Document Type: Article
Times cited : (11)

References (12)
  • 2
    • 84936328115 scopus 로고    scopus 로고
    • M. J. Atallah and D. C. Chen: An optimal parallel algorithm for the visibility of a simple polygon from a point. In Proc. of the Fifth Annual ACM Symposium on Computational Geometry, pp. 114–123, 1989.
  • 6
    • 84936301909 scopus 로고    scopus 로고
    • M. Ben-Or: Lower bounds for algebraic computation trees. In Proc. 15th Annual ACM Symposium on Theory of Computing, pp. 80–86, 1983.
  • 7
    • 84936348517 scopus 로고    scopus 로고
    • R. Cole and M. T. Goodrich: Optimal parallel algorithms for polygon and point set problems. In Proc. of the Fourth Annual ACM Symposium on Computational Geometry, 1988.
  • 11
    • 84936346717 scopus 로고    scopus 로고
    • F. P. Preparata and M. L. Shamos: Computational Geometry: An Introduction. Springer-Verlag, 1985.


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