EXPERIENCES WITH NEW IMAGE COMPONENT ALGORITHMS

Simple item page
dc.contributor.authorSamet, Hananen_US
dc.contributor.authorTamminen, Markkuen_US
dc.contributor.editorK. BO and H.A. TUCKERen_US
dc.date.accessioned2015-09-29T08:29:15Z
dc.date.available2015-09-29T08:29:15Z
dc.date.issued1984en_US
dc.description.abstractWe present experiences and comparisons evaluating a fast algorithm for connected component labeling of quad- and octrees. The algorithm works without loss of efficiency on linear tree representations that may reside in external storage.en_US
dc.description.seriesinformationEurographics Conference Proceedingsen_US
dc.identifier.doi10.2312/eg.19841018en_US
dc.identifier.issn1017-4656en_US
dc.identifier.urihttp://dx.doi.org/10.2312/eg.19841018en_US
dc.publisherThe Eurographics Associationen_US
dc.titleEXPERIENCES WITH NEW IMAGE COMPONENT ALGORITHMSen_US
Files
Collections
EG1984 Proceedings (Technical Papers)