Linear Time Distance Transforms for Quadtrees

Simple item page
dc.contributor.authorShaffer, Clifford A.en
dc.contributor.authorStout, Quentin F.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:05Zen
dc.date.available2013-06-19T14:36:05Zen
dc.date.issued1989-08-01en
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
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000144/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000144/01/TR-89-07.pdfen
dc.identifier.trnumberTR-89-07en
dc.identifier.urihttp://hdl.handle.net/10919/19480en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleLinear Time Distance Transforms for Quadtreesen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-89-07.pdf
Size:
998.19 KB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports