Check patentability & draft patents in minutes with Patsnap Eureka AI!

Polygon filling method for computer drawing

A filling method and polygonal technology, which is applied in the direction of filling planes with attributes, can solve the problems of reducing polygon filling efficiency, achieve the effects of reducing cumulative repeated filling area, wide application range, and improving filling efficiency

Active Publication Date: 2019-07-30
HUNAN UNIV OF SCI & TECH
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It can be seen that during the filling process, a large number of areas outside the polygon are filled invalidly many times, thus reducing the efficiency of polygon filling

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Polygon filling method for computer drawing
  • Polygon filling method for computer drawing
  • Polygon filling method for computer drawing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0063] Take the polygon filling with 6 sides and 6 vertices as an example, the known vertex coordinates are (145, 18), (247, 150), (320, 10), (363, 212), (140, 316), (8, 170), the following Introduce the whole implementation process.

[0064] Step 1: Number the vertices of the polygon in sequence. Number the vertices of the polygon in a clockwise direction, and number them sequentially as P 1 ,P 2 ,P 3 ,P 4 ,P 5 ,P 6 , P 7 , where P 7 is the auxiliary vertex, as shown in Table 1.

[0065] Table 1 Hexagon vertex numbers

[0066] vertex number P 1

P 2

P 3

P 4

P 5

P 6

P 7

x-axis coordinate 145 247 320 363 140 8 145 y-axis coordinate 18 150 10 212 316 170 18

[0067] Step 2: Calculate and obtain the optimal fence line. The algorithm is as follows:

[0068] (2-2-1): Make the initial fence line X=min_x; i=1; the first temporary quantity delta 1 =+∞; the second temporary variable delta 2 =0; the third tem...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a polygon filling method for computer drawing. The polygon filling method comprises the following steps that 1, numbering vertexes of polygons in sequence; 2, calculating and obtaining coordinates of an optimal fence line; 3, setting pixel filling as a taking and supplementing mode; 4, calculating an intersection point of the horizontal scanning line and the polygon and filling the scanning line segment; 5, scanning each pixel point on each edge line by line by using a horizontal scanning line, and repeating the step 4 until the scanning is finished; 6, completing filling. By introducing the fence lines and optimally selecting the positions of the fence lines, the accumulated repeated filling area of the algorithm is reduced, the filling efficiency is improved, andthe method can be used for filling polygonal areas without edges or with filling colors different from frame colors or even with different edge colors, and is high in universality and wide in application range.

Description

technical field [0001] The invention relates to a polygon filling method for computer drawing. Background technique [0002] Drawing area filling is an important process in the field of computer graphics and digital graphics and image processing, and it is also the most basic operation of coloring. The filling content includes colors, lines, graphics and images, etc. and so on have a wide range of applications. With the development of computer hardware technology, the processing speed of computer graphics and images is getting faster and faster. An excellent filling algorithm will further reduce the occupancy rate of computing resources and save time for area filling. When computer is used for area filling, an area of ​​any shape can be treated as a polygon. Therefore, the quality of the filling algorithm directly affects the accuracy of polygon filling and real-time display. [0003] Currently commonly used polygon filling algorithms mainly include edge mark filling algor...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06T11/40
CPCG06T11/40
Inventor 杨大炼苗晶晶姜永正郭帅平肖冬明沈意平
Owner HUNAN UNIV OF SCI & TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com