Loading...
Please wait, while we are loading the content...
Similar Documents
Optimal computation of the contour of maximal elements on mesh-connected computers
| Content Provider | Semantic Scholar |
|---|---|
| Author | Murshed, M. Manzur Hegland, Markus |
| Copyright Year | 1998 |
| Abstract | Dehne presented an optimal algorithm to compute the contour of the maximal elements of n planar points on a pn pn mesh. We have calculated that Dehne’s algorithm requires23pn steps and we have been able to reduce the required steps to19pn through pre-sorting and using an efficient strategy in dividing the mesh into halves. It has also been es tablished that any implementation of Dehne’s algorithm requir es at least15pn steps. We have further developed a new optimal algorithm which requires at most 10pn steps. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://openresearch-repository.anu.edu.au/bitstream/1885/40811/3/TR-CS-98-06.pdf |
| Alternate Webpage(s) | http://www.gscit.monash.edu.au/~manzur/papers/iccit98.ps |
| Alternate Webpage(s) | http://cs.anu.edu.au/techreports/1998/TR-CS-98-06.ps.gz |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |