Seed Filling Algorithm Based on Fast Marching Method
Xiangxu Meng · Journal of Engineering Graphics · 2005
present a region filling algorithm based on Fast Marching Method, which can be used in one color or gradient filling for both boundary-defined regions and interior-defined 4-connected regions. Given a pixel (seed point) interior to a region and the filling color, the algorithm fills all other pixels interior to the region according to the arrival time of the front computed by fast marching method. It takes O(nlogn) time assuming there are n points in the region.