A constant-time parallel algorithm for computing convex hulls-Reference-Cited by-同舟云学术

A constant-time parallel algorithm for computing convex hulls

Published:1982-06 Issue:2 Volume:22 Page:129-134
ISSN:0006-3835
Container-title:BIT
language:en
Short-container-title:BIT

Author:

Akl Selim G.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01944471.pdf

Reference14 articles.

1. B. Grünbaum,Convex Polytopes, Wiley, New York, 1967.

2. R. V. Benson,Euclidean Geometry and Convexity, McGraw-Hill, New York, 1966.

3. R. L. Graham,An efficient algorithm for determining the convex hull of a finite planar set, Information Processing Letters, Vol. 1, 1972, pp. 132–133.

4. A. L. Chow,A parallel algorithm for determining convex hulls of sets of points in two dimensions, Proceedings of the Nineteenth Allerton Conference on Communication, Control and Computing, Monticello, Illinois, September 30 October 2, 1981, pp. 214–223.

5. H. Hadwiger, H. Debrunner and V. Klee,Combinatorial Geometry in the Plane, Holt, Rinehart and Winston, New York, 1964.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A filtering technique for fast Convex Hull construction in R2;Journal of Computational and Applied Mathematics;2020-01

2. Deterministic Parallel Computational Geometry;Handbook of Computational Geometry;2000

3. Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers;Journal of Parallel and Distributed Computing;1999-01

4. Sorting and computing convex hulls on processor arrays with reconfigurable bus systems;Information Sciences;1993-08

5. On the performance of peeling algorithms;Applied Stochastic Models and Data Analysis;1992-06