JPH04581A - Pattern storage device with hierarchical structure - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

Detailed Description of the Invention [Industrial Field of Application] The present invention is applicable to pattern storage devices such as gray scale patterns, amokake patterns, filling patterns, etc. [Prior Art] Dot impact printers, word processors, etc. A method of storing data as map data is known.

In addition, in devices capable of producing high-quality print output, such as laser printers, there is a method (halftone) in which cells are covered with a certain density pattern (halftone).A method is also known in which the density pattern is stored as outline data.

[Problem to be solved by the invention] The method of storing dot pattern data requires a memory with a number of bits corresponding to the number of pixels composing the pattern, so in order to store a pattern for high-quality print output, a huge amount of memory is required. The problem is that it requires a lot of memory. The same 5111m
The pixel size is 0.5 to memorize the corner check pattern.
In the case of ran angle and 1. There is a problem in that, in order to store the same pattern, it is necessary to create dot pattern data that depends on the pixel size, such as the need for different data depending on the Orran angle.The density pattern is laid out in cells. Although this method generates very high-quality patterns, it requires a large amount of numerical processing and has the problem that the amount of calculation required to generate a pattern from a pattern storage device is extremely large.

The method of storing outline data has the advantage that affine transformations such as enlargement/reduction/rotation of patterns are easy and the stored data does not depend on pixel size, but it is difficult to store patterns with complex outlines because of the large amount of outline data. There is a problem with the need for data.

Various techniques are also known for compressing bitmap data and outline data. [Means for Solving the Problems] The present invention was devised to solve these problems.
This is a new pattern storage device that does not depend on pixel size, can be expanded or reduced, and does not require a huge amount of data. Its main feature is that it stores patterns using area division and a hierarchical structure [Embodiment] The details of the present invention will be explained below based on the illustrated embodiment.

FIG. 1 is a schematic diagram showing an embodiment of the present invention.

Reference numeral 1 in the figure is a pattern storage device in which patterns are stored using the method of the present invention.

Reference numeral 2 denotes a pattern reading device, which searches and refers to desired pattern data specified by an external read signal from the pattern storage device.

Reference numeral 6 denotes a pattern generator that generates a pattern from referenced pattern data.

Reference numeral 4 is a dot pattern drawing device which converts the pattern into dot data and spreads it over a designated portion of the image memory 5.

The operation of the apparatus configured as described above will be explained in detail below.

FIG. 2 is an example of a pattern stored in the pattern storage device of the present invention. As a simple example, we have chosen one consisting of areas divided only by horizontal and vertical line segments. However, this is not intended to limit the scope of the invention.

FIG. 6 is an example in which patterns generated from the pattern storage device of the present invention are laid out. This is also a simple example, and the fact that the area covered is rectangular does not limit the present invention. Further, although a simple black and white image is used, gray scale or color can be assigned to each area, so this also does not limit the scope of the present invention.

FIG. 4 shows the coordinate system of the example pattern. The X-axis is set to increase to the right, and the Y-axis is set to increase to the top. The pattern is rectangular and placed parallel to the coordinate axes. FIG. 5 shows the hierarchical structure of the example pattern, in which the coordinates of the rectangular circle are selected in the range (0,0)-(10o,1oo). (a) is the first layer, (b) (c) (d) is the second layer,
(E) (E) is the third layer.

In the first layer, the pattern is divided into nine rectangular areas of five columns and six rows. Each divided rectangular area has a second layer. If further division is necessary, each divided rectangular area is divided into rectangles again at the second layer. If division is not necessary, the area is divided into rectangles again at the second layer if further division is necessary. If division is not necessary, specify whether the area is black or white (or grayscale or color) in the second layer.

Repeat this for as many layers as necessary. In the example, only the area with code e is specified by the coordinates of (o, o)-(1° o, 1oo), regardless of the rectangle that needs to be re-rectangularly divided. (Note that the vertical and horizontal scales are not the same.) FIG. 6 is an example of the actual data structure on the memory. Fifth
The rectangle (a) in the figure - (f) shows the data structure in Figure 6 (a) -
(to) corresponds.

There are two types of data structures.

For rectangles that require division, that is, have further lower-level structures, an X-divided list pointer, an Consists of.

For rectangles that do not require division, see Figure 6 (C) (D) (
e) It is composed of an X-divided list pointer, an X-divided list pointer, and information indicating whether the background is black or white, as shown in (e) and (f).

The number, size, and two positions of rectangles created by dividing the rectangle using the X-divided list and the X-divided list can be calculated as follows. First, the desired pattern size (vertical and horizontal length) is specified. The X-divided list in Figure 6 (a) shows that new vertical lines are drawn at 10% and 90% of the length of the horizontal sides of the rectangle.Similarly, the It can be seen that new horizontal lines are drawn at 10% and 90% of the length of the vertical sides of the rectangle. (Figure 5 (a)) Name the divided rectangles a - i in order. Size of each rectangle 2
I found the location. Repeat this as many times as necessary for the lower layers.

Items (d) and (f) in FIG. 6 can be shared. Also, in many cases, patterns have the same partial structure, and memory can be saved by sharing the data structure.

It is also possible to store infinitely detailed patterns by configuring a layer data structure to point to a higher level data structure.

[Effects of the Invention] A new pattern storage device that does not depend on the size of pixels, can be freely enlarged and reduced, and does not require a huge amount of data has been realized. Suitable for pattern storage devices such as laser printers. Furthermore, the amount of communication data is reduced when pattern data is downloaded from the combiner to the pattern storage device of the laser printer.

Suitable for memorizing color patterns.

[Brief explanation of the drawing]

FIG. 1 is a schematic diagram showing an embodiment of the present invention. Reference numeral 1 in the figure is a pattern storage device in which patterns are stored using the method of the present invention. Reference numeral 2 denotes a pattern reading device, which searches and refers to desired pattern data from a pattern storage device. Reference numeral 6 denotes a pattern generator that generates a pattern from referenced pattern data. Reference numeral 4 denotes a dot pattern drawing device which converts the pattern into don't data and spreads it over the designated portion of the image memory 5. FIG. 2 is a diagram showing an example of a pattern stored in the pattern storage device of the present invention. FIG. 5 is a diagram showing an example in which patterns generated from the pattern storage device of the present invention are laid out. FIG. 4 is a diagram showing the coordinate system of the example pattern. Figure 5 is a diagram showing the hierarchical structure of example patterns, and (a) is a diagram showing the hierarchical structure of example patterns.
Floor threat, (B) (C) (D) is the second level, (H) (H)
is the third layer. FIG. 6 is a diagram showing an example of the data structure on the actual memory. that's all

Claims (1)

[Scope of Claims] A pattern storage means having a hierarchical structure, a pattern reading means for reading out the pattern information using a read signal from an outside, a means for generating pattern data based on the pattern information, and a pattern storage means for generating pattern data based on the pattern information. What is claimed is: 1. A pattern storage device having a hierarchical structure, comprising: means for drawing pattern data as a dot pattern on an image memory;