Optimal parallel algorithms for computing convex hulls and for sorting
Copyright policy )Optimal parallel algorithms for computing convex hulls and for sorting
A parallel algorithm is presented for computing the convex hull of a set ofn points in the plane. The algorithm usesn1−e processors, 0
- Queen's University Canada
parallel sorting algorithm, Software, source code, etc. for problems pertaining to convex and discrete geometry, Analysis of algorithms and problem complexity, median, selection, Convex sets in \(2\) dimensions (including convex curves), Discrete mathematics in relation to computer science, parallel algorithm, Searching and sorting, convex hull
parallel sorting algorithm, Software, source code, etc. for problems pertaining to convex and discrete geometry, Analysis of algorithms and problem complexity, median, selection, Convex sets in \(2\) dimensions (including convex curves), Discrete mathematics in relation to computer science, parallel algorithm, Searching and sorting, convex hull
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).23 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!