| 一种基于快速行进法的区域填充算法 |
| |
| 引用本文： | 潘荣江,孟祥旭. 一种基于快速行进法的区域填充算法[J]. 工程图学学报, 2005, 26(2): 31-34 |
| |
| 作者姓名： | 潘荣江 孟祥旭 |
| |
| 作者单位： | 山东大学计算机科学与技术学院,济南,250100 |
| |
| 摘 要： | 提出了一种基于快速行进法的区域填充算法,可用于内点表示或边界表示的4 连通区域的单色和渐变填充。给定区域内的一点(种子点)和要填充的颜色,算法按照快速行进法计算的波前到达时间对区域进行填充,直到整个区域填充完毕。算法的时间复杂性为O (nlogn)。
|
| 关 键 词： | 计算机应用 算法 快速行进法 区域填充 |
| 文章编号： | 1003-0158(2005)02-0031-04 |
| 修稿时间： | 2004-06-17 |
Seed Filling Algorithm Based on Fast Marching Method |
| |
| PAN Rong-Jiang,MENG Xiang-Xu. Seed Filling Algorithm Based on Fast Marching Method[J]. Journal of Engineering Graphics, 2005, 26(2): 31-34 |
| |
| Authors: | PAN Rong-Jiang MENG Xiang-Xu |
| |
| Abstract: | 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. |
| |
| Keywords: | computer application algorithm fast marching method region filling |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
