Unlock instant, AI-driven research and patent intelligence for your innovation.

Simply-connected arbitrary polygon region filing method and system

A technology of area filling and polygon, applied in the direction of filling the plane with attributes, can solve the problems of not simple enough processing, stack overflow, insufficient coloring, etc., and achieve the effect of improving algorithm efficiency and simple coloring method

Active Publication Date: 2018-01-23
台州市吉吉知识产权运营有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

For the following eight-connected regions, it cannot be fully colored, and the scanning line algorithm has a fast processing speed, but for the case of concave polygons, it is slightly complicated
The efficiency of the seed point algorithm is lower, and if the coloring area is large, the number of points in the compressed stack will increase rapidly, which may easily lead to stack overflow
[0003] Existing a lot of related technologies exist, as the patent of publication No. 102376099A discloses a kind of method for improving the filling effect of vector graphics, which comprises the following steps: 1) Detecting whether there is an area to be compensated in the vector graphics based on scan lines ; 2) Based on the missing point stroke table, it is judged whether the existing area to be compensated is an intersection depression, and the area to be compensated that is confirmed to be an intersection depression is filled, and a system for improving the filling effect of vector graphics is also provided, and the provided system The method and method can eliminate various graphics distortions caused by intersection depressions, thereby greatly improving the filling effect of vector graphics such as vector glyphs at low resolutions, and improving the recognizability of text / graphics, but this method There are also the above-mentioned defects, the processing is not simple enough, and the efficiency is also low

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
  • Simply-connected arbitrary polygon region filing method and system
  • Simply-connected arbitrary polygon region filing method and system
  • Simply-connected arbitrary polygon region filing method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0037] The invention provides a method for filling arbitrary polygonal areas suitable for simple connectivity.

[0038] Simply connected arbitrary polygons, including convex and concave polygons. Area filling algorithm is a basic algorithm in computer graphics.

[0039] The so-called simply connected, that is, there are no holes in the region.

[0040] The overall flow of the method is as follows:

[0041] Proceed as follows:

[0042] Step S1, filling the concave corners of the original polygon to form a circumscribed convex envelope of the original polygon;

[0043] Step S2, coloring the circumscribed convex envelope.

[0044] The overall flow chart is as figure 1 shown.

[0045] The disadvantages of the existing technology are: 1. The scanning line algorithm has a fast processing speed, but it is slightly complicated for the case of concave polygons;

[0046] 2. The efficiency of the seed point algorithm is lower, and if the coloring area is large, the number of point...

Embodiment 2

[0106] System diagram such as Figure 12 As shown, a simply connected arbitrary polygon area filling system includes a filling unit and a coloring unit, the filling unit is used to fill the concave corners of the original polygon and form a circumscribed convex envelope, and the coloring unit is used to The circumscribed convex envelope is filled with color.

[0107] This system is applicable to the filling method of the single-connected arbitrary polygonal area in embodiment 1. The polygons with concave corners are filled by filling units to form convex polygons and then colored.

[0108] Further, the system also includes a judgment unit, a calculation unit, and a storage unit. in,

[0109] The judging unit is used to judge various conditions;

[0110] The calculation unit is used for calculation of various formulas, etc.;

[0111] The storage unit is used to store various data.

[0112] The judging unit, computing unit and storage unit can be set to belong to the fillin...

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 relates to the technical field of image processing and specifically relates to a simply-connected arbitrary polygon region filing method and system. The method comprises the following steps: S1) filling concave angles of an original polygon and forming an external convex envelope of the original polygon; and S2) carrying out color filling on the external convex envelope. The method is simple to process and high in efficiency.

Description

technical field [0001] The invention relates to the technical field of graphic processing, in particular to a method and system for filling a simply connected arbitrary polygonal area. Background technique [0002] The polygon area filling algorithm is basically divided into two categories at present: one is the scan line algorithm (Scan-LineFilling). This type of algorithm is based on the vector form data of the polygon edge boundary, which can be used for program coloring or interactive coloring. The basic idea of ​​​​the algorithm is to intersect with the polygon area through horizontal scanning lines, and will belong to the line segments inside the area Coloring, for concave polygons, it is necessary to distinguish the inside and outside of the polygon. In order to reduce the number of intersections between scan lines and polygon sides, a fast algorithm using edge table (ET) and active edge table (AET) has been developed; the other is seed coloring (Seed Filling) algori...

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
Inventor 郑晟
Owner 台州市吉吉知识产权运营有限公司