A 1 log N parallel algorithm for detecting convex hulls on image boards
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
| Veröffentlicht in: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 7(1998), 6 vom: 30., Seite 922-5 |
|---|---|
| 1. Verfasser: | |
| Weitere Verfasser: | |
| Format: | Online-Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1998
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on image processing : a publication of the IEEE Signal Processing Society |
| Schlagworte: | Journal Article |
| Zusammenfassung: | 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 |
|---|---|
| Beschreibung: | Date Completed 29.06.2010 Date Revised 15.02.2008 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1057-7149 |
| DOI: | 10.1109/83.679445 |