Issue No. 06 - June (1996 vol. 7)

ISSN: 1045-9219

pp: 545-554

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.506693

ABSTRACT

<p><b>Abstract</b>—Recently it has been noticed that for semigroup computations and for selection rectangular meshes with multiple broadcasting yield faster algorithms than their square counterparts. The contribution of this paper is to provide yet another example of a fundamental problem for which this phenomenon occurs. Specifically, we show that the problem of computing the convex hull of a set of <it>n</it> sorted points in the plane can be solved in <tmath>${\rm O}(n^{{\textstyle{1 \over 8}}}\, {\rm log}^{{\textstyle{3 \over 4}}}\,n)$</tmath> time on a rectangular mesh with multiple broadcasting of size</p><tf>$$n^{{\textstyle{3 \over 8}}}\,{\rm log}^{{\textstyle{1 \over 4}}}\,n\times {\textstyle{{n^{{ \textstyle{5 \over 8}}}} \over {{\rm log}^{{\textstyle{1 \over 4}}}\,n}}}.$$</tf><p>The fastest previously-known algorithms on a square mesh of size <tmath>$\sqrt n\times \sqrt n$</tmath> run in <tmath>${\rm O}(n^{{\textstyle{1 \over 6}}})$</tmath> time in case the <it>n</it> points are pixels in a binary image, and in <tmath>${\rm O}(n^{{\textstyle{1 \over 6}}}\,{\rm log}^{{\textstyle{2 \over 3}}}\,n).$</tmath> time for sorted points in the plane.</p>

INDEX TERMS

Convex hulls, meshes with broadcasting, parallel algorithms, pattern recognition, image processing, computational geometry.

CITATION

James L. Schwing, Jingyuan Zhang, Himabindu Gurla, Dharmavani Bhagavathi, Stephan Olariu, "Square Meshes Are Not Optimal for Convex Hull Computation",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 7, no. , pp. 545-554, June 1996, doi:10.1109/71.506693SEARCH