A 1 log N parallel algorithm for detecting convex hulls on image boards.
other
Where this comes from
- Record sourced from PubMed, PMID 18276309.
- Also identified by DOI 10.1109/83.679445.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
By finding the maximum and minimum of {yi-mxi|1=or<i=or<N} for certain slopes m, we propose here a simple and fast parallel algorithm to obtain the convex hull of N arbitrarily given points on an image board, The mathematical theory needed is included, and computation time is 1 log N.