Article ID Journal Published Year Pages File Type
10335952 Computers & Graphics 2010 11 Pages PDF
Abstract
► A novel and rapid 3D seed-filling algorithm is proposed. ► The problems of the existing seed-filling algorithms are analyzed and discussed. ► A new frame work of algorithm is presented to enclose the improved 2D seed-filling algorithm. ► A parameter of leaping value(MaxSpan) is defined to accelerate the search.
Related Topics
Physical Sciences and Engineering Computer Science Computer Graphics and Computer-Aided Design
Authors
, , ,