메뉴 건너뛰기




Volumn 14, Issue 2, 1995, Pages 169-182

A time-optimal parallel algorithm for three-dimensional convex hulls

Author keywords

Convex hull; Deterministic; Parallel algorithm; PRAM; Three dimensional; Time optimal

Indexed keywords


EID: 0141982298     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01293667     Document Type: Article
Times cited : (9)

References (32)
  • 9
    • 84936678327 scopus 로고    scopus 로고
    • D. Z. Chen. Efficient geometric algorithms in the EREW-PRAM. Proc. 28th Allerton Conf. on Communications, Control, and Computing, pp. 818–827, 1990.
  • 10
    • 0003553355 scopus 로고
    • Parallel Algorithms for Geometric Problems
    • Department of Computer Science, University of Illinois, Urbana, IL
    • (1980) Ph.D. thesis
    • Chow, A.L.1
  • 13
    • 84936678328 scopus 로고    scopus 로고
    • M. T. Goodrich. Geometic partitioning made easier, even in parallel. Proc. 9th Ann. ACM Symp. on Computational Geometry, pp. 73–82, 1993.
  • 19
    • 84936678329 scopus 로고    scopus 로고
    • B. Chazelle and J. Matousek. Derandomizing an output-sensitive convex hull algorithm in three dimensions. Technical Report, Department of Computer Science, Princeton University, 1992.
  • 21
    • 84936678317 scopus 로고    scopus 로고
    • M. Ghouse and M. T. Goodrich. In-place techniques for parallel convex hull algorithms. Proc. 3rd ACM Symp. on Parallel Algorithms and Architecture, pp. 192–203, 1991.
  • 30
    • 84936678316 scopus 로고    scopus 로고
    • R. Tamassia and J. S. Vitter. Optimal cooperative search in fractional cascaded data structures. Proc. 2nd ACM Symp. on Parallel Algorithms and Architecture, pp. 307–316, 1990. To appear in Algorithmica.
  • 32
    • 84936678315 scopus 로고    scopus 로고
    • N. M. Amato and F. P. Preparata. An NC1 parallel 3D convex hull algorithm. Proc. 9th Ann. ACM Symp. on Computational Geometry, pp. 289–297, 1993.


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