Implementation and Complexity of the Watershed-from-Markers Algorithm Computed as a Minimal Cost Forest

dc.contributor.author	Felkel, Petr	en_US
dc.contributor.author	Bruckschwaiger, Mario	en_US
dc.contributor.author	Wegenkittl, Rainer	en_US
dc.date.accessioned	2015-02-16T11:06:17Z
dc.date.available	2015-02-16T11:06:17Z
dc.date.issued	2001	en_US
dc.identifier.issn	1467-8659	en_US
dc.identifier.uri	http://dx.doi.org/10.1111/1467-8659.00495	en_US
dc.publisher	Blackwell Publishers Ltd and the Eurographics Association	en_US
dc.title	Implementation and Complexity of the Watershed-from-Markers Algorithm Computed as a Minimal Cost Forest	en_US
dc.description.seriesinformation	Computer Graphics Forum	en_US
dc.description.volume	20	en_US
dc.description.number	3	en_US
dc.identifier.doi	10.1111/1467-8659.00495	en_US
dc.identifier.pages	26-35	en_US