CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - boundary fill algorithm
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Network Marketing
Management
E-commerce
Business guide
Business plan
Successful incentive
Human Resources
Report papers
Marketing materials
Consulting and training
Website
Software Engineering
File Format
Technology Management
Industry research
Program doc
Other
Search - boundary fill algorithm - List
[
File Format
]
Seed-Filling
DL : 0
平面区域填充算法是计算机图形学领域的一个很重要的算法,区域填充即给出一个区域的边界(也可以是没有边界,只是给出指定颜色),要求将边界范围内的所有象素单元都修改成指定的颜色(也可能是图案填充)。区域填充中最常用的是多边形填色,本文中我们就讨论几种多边形区域填充算法。-The planar area filling algorithm is a very important algorithms in the field of computer graphics, area fills, i.e. given a boundary of the area (which may be no boundary, but given the specified color), all pixel elements within the borders are modified to specify the color (or pattern fills). The most commonly used in the area fill, polygon fill, in this article, we discuss several polygon area fill algorithm.
Date
: 2026-01-09
Size
: 21kb
User
:
绯烟绯烟
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.