View Item 

Show simple item record

Linear time distance transforms for quadtrees

dc.contributor.authorShaffer, Clifford A.en_US
dc.contributor.authorStout, Quentin F.en_US
dc.date.accessioned2006-04-10T14:35:45Z
dc.date.available2006-04-10T14:35:45Z
dc.date.issued1991-09en_US
dc.identifier.citationShaffer, Clifford A., Stout, Quentin F. (1991/09)."Linear time distance transforms for quadtrees." CVGIP: Image Understanding 54(2): 215-223. <http://hdl.handle.net/2027.42/29144>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B6WDD-4DX4358-2K/2/180682f5c16b5012bb25130138722c01en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/29144
dc.description.abstractLinear time algorithms are given for computing the chessboard distance transform for both pointer-based and linear quadtree representations. Comparisons between algorithmic styles for the two representations are made. Both versions of the algorithm consist of a pair of tree traversals.en_US
dc.format.extent1045616 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleLinear time distance transforms for quadtreesen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan 48109-2122, USAen_US
dc.contributor.affiliationotherDepartment of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, Virginia 24061-0106, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/29144/1/0000186.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/1049-9660(91)90064-Ven_US
dc.identifier.sourceCVGIP: Image Understandingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000186.pdf
Size:
1021.KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.