TWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORM

Simple item page
dc.contributor.authorGavrilova, Marinaeng
dc.contributor.authorAlsuwaiyel, Muhammad H.eng
dc.date.accessioned2008-02-26T20:32:48Z
dc.date.available2008-02-26T20:32:48Z
dc.date.computerscience2000-06-20eng
dc.date.issued2000-06-20eng
dc.description.abstractGiven an n x n binary image of white and black pixels, we present two algorithms for computing the distance transform and the nearest feature transform using the Euclidean metric. The first algorithm is a fast sequentioal O (n) time algorithm. The second is an optimal O (n) time parallel algorithm that runs on a linear array of n processors.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department2000-661-13eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30621
dc.identifier.urihttp://hdl.handle.net/1880/45485
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleTWO ALGORITHMS FOR COMPUTING THE EUCLIDEAN DISTANCE TRANSFORMeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
Thumbnail Image
Name:
2000-661-13.pdf
Size:
101.77 KB
Format:
Adobe Portable Document Format
Description:
Download
Thumbnail Image
Name:
2000-661-13.ps
Size:
890.06 KB
Format:
Postscript Files
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications