JP2003178299A - Diagram reducing compiling method and device and diagram deforming device and method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To automatically deform a house shape in an easy-to-see shape according to reduction in a map. <P>SOLUTION: A circumscribed rectangle setting device 14 of a removal determining device 12 sets a circumscribed rectangle in input house data 10. A comparator 16 compares the short side of the rectangle set by the rectangle setting device 14 with the reference length La, and outputs only the house data having the short side not less than the reference length La to a rear stage. A deforming device 18 simplifies the shape by repeating deformation until the shortest side of the house data from the removal determining device 12 becomes the reference length Lb or more. A reducing device 20 reduces the house data of simplifying the shape by the deforming device 18 to the size a little smaller than the size simply reduced to an objective contraction scale. <P>COPYRIGHT: (C)2003,JPO

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method and an apparatus for reducing a graphic, and a method and an apparatus for deforming a graphic, and more specifically, a graphic, for example, without feeling a visual discomfort.
TECHNICAL FIELD The present invention relates to a method and apparatus for reducing and compiling a plane figure of a building in map data, and a method and apparatus for changing a figure used for the reducing and compiling.

[0002]

2. Description of the Related Art Maps have different representations depending on the scale. The form of expression is specified as a diagram. When trying to create a map of a certain scale, a map of a scale larger than that scale exists, and when the contents of the map are available, the map of the large scale is compiled to create a map of a desired scale.

For example, a map with a scale of 1/2500 can be reduced to create a map with a scale of 1/10000. conventionally,
Photograph a map at a scale of 1/2500 and scale 1/100
After being reduced to 00, a human redraws each element such as a building based on the scale of 1/10000. In the redrawing based on a diagram by a human, it is easy to transform an element that is difficult to read because it is reduced by a photographic process so that it is easy to read, and it is easy to omit a too fine element. However, a high degree of skill is required for such modification and omission.

Recently, maps are being digitized. Digital maps can be scaled up and down freely by computer. However, the existing map processing software simply enlarges or reduces each element in the map and a typical building at the same magnification when enlarging or reducing the map.

[0005]

[Problems to be Solved by the Invention] When reducing a map,
The conventional map processing software simply reduces the building figure included in the map. In this case, not only the building is displayed too finely, but also the building shape is reduced in a state where it is saved. This often leads to unnecessary buildings being displayed and unnecessary fine building shapes being displayed, making the reduced map difficult to see and noisy. In other words, the reduced map often does not have a schematic representation according to the scale of the reduced map.

SUMMARY OF THE INVENTION It is an object of the present invention to eliminate such inconvenience and provide a graphic reduction knitting method and apparatus and a graphic deformation method and apparatus for automatically performing deformation and omission according to the scale after reduction. .

[0007]

A graphic reduction and compilation method according to the present invention is a graphic reduction and compilation method for reducing and compiling graphic data consisting of a plurality of vertices and connecting lines between vertices connecting these vertices in order. Determine whether the size of the graphic data to be processed is greater than or equal to a predetermined size, and if the size is less than the predetermined size, remove the removal determination step and the shape of the graphic data not removed by the removal determination step. The method further comprises a transformation step of transforming the length so as to exceed a predetermined reference length, and a reduction step of reducing the shape of the graphic data transformed by the transformation step to a size smaller by a predetermined amount according to the output resolution. To do.

The removal determination step can reduce the load of the deformation process. By providing a reduction step for reducing the shape of the graphic data transformed in the transformation step to a size smaller by a predetermined amount according to the output resolution, the transformed figure becomes easier to see.

In the transformation step, the shortest side searching step for searching the shortest side among the connecting lines between the vertices, or the top side of the convex portion or the bottom side of the concave portion of which the shortest side is substantially rectangular. The rectangle determining step of determining whether or not there is, and when the shortest side is substantially any of the top side of the convex portion and the bottom side of the concave portion of the rectangle, the vertices that are the start point and the end point of the shortest side are deleted. , A shortest side deleting step that connects the vertices on both sides thereof. Thereby, the convex portion and the concave portion can be efficiently deleted.

The deforming step further includes a continuation determining step of determining whether the connecting lines between the vertices having the predetermined reference length or less are continuous, and the determining step if the connecting lines between the vertices having the predetermined reference length or less are not continuous. The connection line between vertices with a standard length or less is divided by the line length ratio of the connection line between vertices on both sides, and the connection line between vertices on both sides is translated so that the division point is the end point, and the division point and parallel A line deleting step in which the end point on the opposite side of the connection line between vertices after movement is used as a substitute for the end point of the connection line between vertices having the predetermined reference length or less and the vertices of the connection line between vertices on both sides before translation. To do. Thereby, for example, a bent portion having a step can be simplified by a bent straight line having no step.

The deforming step further includes a step of thinning out every other intermediate vertex of the continuous connecting lines between the vertices having the predetermined reference length or less, and an intermediate process of connecting connecting lines between the vertices having the predetermined reference length or less. Of every other vertex in the intermediate point between adjacent vertices, and when the connecting line between the vertices of the predetermined reference length or less is continuous, the continuous reference length of less than the predetermined reference length. And a selecting step of selecting one of the vertex thinning step and the vertex substituting step according to the calculation result. As a result, it is possible to simplify the shape change portion in which short lines are connected.

The transformation step is performed on two sides of the target vertex.
A perpendicular vertex is drawn from the target vertex to a line connecting the two vertices, and when the length of the perpendicular is equal to or shorter than the predetermined reference length, the target vertex deleting step is included. This makes it possible to simplify a minute curved portion with a straight line.

In the reducing step, the shape of the graphic data transformed in the transforming step is reduced to a size smaller than a target scale size by a predetermined amount according to the output resolution. As a result, the reduction to the desired scale and the reduction for easy viewing can be performed at once.

The removal determining step includes a circumscribing rectangle setting step of setting a rectangle circumscribing the input graphic data, and a comparing step of comparing the short side of the rectangle set in the circumscribing rectangle setting step with a predetermined length. To do.
This makes it possible to efficiently detect graphics that can be deleted.

A reduction knitting apparatus according to the present invention is a figure reduction knitting apparatus that reduces and compiles figure data composed of a plurality of vertices and connecting lines between vertices connecting these vertices in order. It is determined whether or not the size is equal to or larger than the predetermined size, and if the size is less than the predetermined size, the removal determining unit removes the shape of the graphic data that is not removed by the removal determining unit, and the line length of each vertex connecting line exceeds the predetermined reference length. It is characterized by comprising a deforming means for deforming as described above and a reducing means for reducing the shape of the graphic data transformed by the deforming means to a size smaller by a predetermined amount according to the output resolution.

The removal determining means can reduce the load of the deformation process. By providing the reducing means for reducing the shape of the graphic data deformed by the deforming means to a size smaller by a predetermined amount according to the output resolution, the deformed graphic becomes easy to see.

Among the connecting lines between the vertices, the deforming means is
A shortest side searching means for searching the shortest side, a rectangle determining means for determining whether the shortest side is substantially the top side of the convex portion or the bottom side of the concave portion of the rectangle, and the shortest side is substantially And a shortest side deleting means for deleting a vertex which is a start point and an end point of the shortest side when any of the top side of the rectangular convex portion and the bottom side of the concave portion and connecting the vertices on both sides thereof.
Thereby, the convex portion and the concave portion can be efficiently deleted.

The deforming means further determines continuity determining means for determining whether or not the connecting lines between the vertices having the predetermined reference length or less are continuous, and the determining unit if the connecting lines for the vertices having the predetermined reference length or less are not continuous. The connection line between vertices with a standard length or less is divided by the line length ratio of the connection line between vertices on both sides, and the connection line between vertices on both sides is translated so that the division point is the end point, and the division point and parallel Line removing means for replacing the end point of the connecting line between the vertices after the movement with the end point of the connecting line between the vertices having the predetermined reference length or less and the vertex of the connecting line between the vertices on both sides before the parallel movement. To do. Thereby, for example, a bent portion having a step can be simplified by a bent straight line having no step.

The deforming means further includes an apex thinning means for thinning out every other middle vertex of the continuous connecting lines between the vertices having the predetermined reference length or less, and a middle point between the connecting lines for connecting the vertices having the predetermined reference length or less. If every other vertex is replaced with an intermediate point between adjacent vertices and a connecting line between vertices having the predetermined reference length or less is continuous, the vertices having the predetermined reference length or less are continuous. And a selecting means for calculating the number of connecting lines and selecting one of the apex thinning means and the apex substituting means according to the calculation result. This allows
It is possible to simplify the shape change part in which short lines are connected.

The deforming means draws a perpendicular from the target vertex on a line connecting two vertices on both sides of the target vertex, and deletes the target vertex when the length of the perpendicular is not more than the predetermined reference length. A vertex deleting means is provided. This allows
The slight bend can be simplified by a straight line.

The reduction means reduces the shape of the graphic data transformed by the transformation means to a size smaller than a target scale size by a predetermined amount according to the output resolution. As a result, the reduction to the desired scale and the reduction for easy viewing can be performed at once.

The removal determining means comprises a circumscribing rectangle setting means for setting a rectangle circumscribing the input graphic data, and a comparing means for comparing the short side of the rectangle set by the circumscribing rectangle setting means with a predetermined length. To do. This makes it possible to efficiently detect graphics that can be deleted.

The figure transforming method according to the present invention is a figure transforming method for transforming and simplifying figure data composed of a plurality of vertices and connecting lines between vertices connecting these vertices in order. The shortest side searching step of searching the shortest side, a rectangle determining step of determining whether the shortest side is substantially the top side of the convex portion or the bottom side of the concave portion of the rectangle, and the shortest side. Is a top side of a convex portion or a bottom side of a concave portion of a rectangular shape, the vertexes that are the start and end points of the shortest side are deleted, and the shortest side deleting step of connecting the vertices on both sides is performed. It is characterized by having. Thereby, the convex portion and the concave portion can be efficiently deleted.

The figure deforming method according to the present invention further comprises a continuation determining step of determining whether or not the connecting lines between vertices having the predetermined reference length or less are continuous, and the connecting lines between the vertices having the predetermined reference length or less are not continuous. , The vertices connecting line of the predetermined reference length or less is divided by the line length ratio of the vertices connecting lines on both sides,
The connecting lines between the vertices on both sides are moved in parallel so that the dividing points are the end points, and the end points on the opposite side of the dividing points and the connecting lines between the vertices after the parallel movement are connected between the vertices having the predetermined reference length or less. And a line deleting step for substituting the vertices of the connecting points between the vertices on both sides before translation. Thereby, for example, a bent portion having a step can be simplified by a bent straight line having no step.

According to the graphic transformation method of the present invention, the intermediate vertices of the connecting lines between consecutive vertices having the predetermined reference length or less are set to 1
A vertex thinning step of thinning out every other vertex, a vertex replacing step of replacing every other vertex in the middle of the continuous connecting lines between the vertexes having the predetermined reference length or less with an intermediate point between adjacent vertexes, and the predetermined vertex. When the connecting lines between the vertices of the reference length or less are continuous, the number of continuous connecting lines between the vertices of the predetermined reference length or less is calculated, and one of the vertex thinning step and the vertex replacing step is performed according to the calculation result. And a selecting step of selecting. As a result, it is possible to simplify the shape change portion in which short lines are connected.

The graphic transformation method according to the present invention further draws a perpendicular from the target vertex to a line connecting two vertices on both sides of the target vertex, and when the length of the perpendicular is not more than the predetermined reference length, the target The method includes a target vertex deleting step of deleting a vertex. This makes it possible to simplify a minute curved portion with a straight line.

A graphic transformation device according to the present invention is a graphic transformation device that transforms and simplifies graphic data consisting of a plurality of vertices and connecting lines between vertices connecting these vertices in order. Of the above, the shortest side searching means for searching the shortest side, a rectangle determining means for determining whether the shortest side is substantially the top side of the convex portion or the bottom side of the concave portion of the rectangle, and the shortest side. Is a top side of the convex portion or a bottom side of the concave portion of the rectangular shape, delete the vertices which are the start and end points of the shortest side, and connect the vertices on both sides with the shortest side deleting means. It is characterized by having. This allows
The convex portion and the concave portion can be efficiently deleted.

The graphic deforming apparatus according to the present invention further comprises a continuity determining means for determining whether or not the connecting lines between vertices having the predetermined reference length or less are continuous, and the connecting lines between the vertices having the predetermined reference length or less are not continuous. , The vertex connecting line of the predetermined reference length or less is divided by the line length ratio of the vertex connecting lines on both sides, and the vertex connecting lines on both sides are translated in parallel so that the dividing point is an end point. Delete the line that substitutes the split point and the end point on the opposite side of the connection line between vertices after translation for the end point of the connection line between vertices with the specified reference length or less and the vertex of the connection line between vertices on both sides before translation. And means. Thereby, for example, a bent portion having a step can be simplified by a bent straight line having no step.

The graphic deforming apparatus according to the present invention further sets the middle vertices of the continuous connecting lines between vertices having the predetermined reference length or less to 1
Vertices culling means for culling every other vertices, and vertices displacing means for displacing every other vertices in the middle of the continuous connection lines between vertices having a predetermined reference length or less at intermediate points between the vertices adjacent to the vertices. When the connecting lines between the vertices having the predetermined reference length or less are continuous, the number of continuous connecting lines between the vertices having the predetermined reference length or less is calculated, and the number of the apex thinning means and the apex substitution means are calculated according to the calculation result. And a selecting means for selecting one. As a result, it is possible to simplify the shape change portion in which short lines are connected.

The graphic deformation apparatus according to the present invention further draws a perpendicular from the target vertex to a line connecting two vertices on both sides of the target vertex, and when the length of the perpendicular is not more than the predetermined reference length, the target The method includes a target vertex deleting step of deleting a vertex. This makes it possible to simplify a minute curved portion with a straight line.

[0031]

Embodiments of the present invention will now be described in detail with reference to the drawings.

FIG. 1 shows a schematic block diagram of an embodiment of the present invention applied to the reduction of a digital map. Here, for example, 1/2500 house data on the map is 1 /
It is assumed that the size of the house is reduced to 10,000, that is, the house shape is reduced at a reduction rate of 1/4. Further, the house data is composed of a plurality of vertices and data of line segments that connect the vertices in a clockwise direction so as to show the outer shape, and generally has a polygonal structure.

House data 1 on a map of 1/2500 scale
0 is input to the removal determination device 12. Removal determination device 12
Is a device that detects houses that can be ignored at the reduced scale and removes them in advance. The removal determination device 12 is a circumscribed rectangle setting device 1 that sets a circumscribed rectangle in the input house data.
4 and a comparator 16 that compares the short side of the rectangle set by the rectangle setting device 14 with the reference length La and outputs only the house data whose short side is equal to or greater than the reference length La to the subsequent stage.

FIG. 2 shows an example of the shape of house data.
The operation of the circumscribing rectangle setting device 14 will be described with reference to FIG. Let each vertex of the house data be P _{1 to} P ₈ . The circumscribed rectangle setting device 14 searches the house data for the longest line segment (longest line segment). In the example shown in FIG. 2, the line segment _P 8 -P ₁ is the longest line segment. The direction of the longest line segment _P 8 -P ₁ and Y-axis. In other words, if the house data is rotated around any of the vertices so that the longest line segment is on the Y-axis, the subsequent processing becomes easy. It suffices to store the rotation angle and restore it after necessary processing.

Of the vertices P _{1 to} P ₈ of the house data, the two farthest points in the Y-axis direction are searched. In the example shown in FIG. 2, P ₁ and P ₆ are searched. The distance between the two farthest points P ₁ and P ₆ in the Y-axis direction is defined as one side of the target rectangle. Specifically, the distance between the intersections when a perpendicular line is drawn from the two farthest points P ₁ and P ₆ to the Y axis is one side of the target rectangle. The axis orthogonal to the Y axis is the X axis. The two vertices at which the intersection (vertical foot) with the X axis when the perpendicular is drawn from each vertex to the X axis are farthest from each other are searched. In the example shown in FIG. 2, P ₁ (or P ₈ ) and P ₅ . The distance between the legs of the perpendicular line drawn from the vertices P ₁ and P ₅ to the X axis is the length of another side of the target rectangle. The length of the shorter side of the obtained rectangle is compared with the reference length La, and if it is shorter than the reference length La, the house data is deleted.

The deforming device 18 simplifies the shape of the house data which is determined by the removal determining device 12 to be a certain size or more. Specifically, the deformation device 18 simplifies the shape by repeating the deformation of the house shape until the shortest side becomes the reference length Lb or more. The details will be described later.

The reducing device 20 converts the house data whose shape is simplified by the transforming device 18 into a target scale (here,
It is a device that reduces the size to a size slightly smaller than the size simply reduced to 1/10000). Generally, the reduction device 20 changes the house shape of the house data output from the transformation device 18 to the target scale (1 / 10,000 in this case).
The output device (display device or printer) for displaying the map is reduced to a size corresponding to half the line thickness. This is to avoid overlapping of capitals of adjacent figures.
If you reduce the width of the line, it will shrink too much.

The house data output from the reducing device 20 indicates a house shape of a size suitable for being expressed on a map of a desired scale. By providing the reduction device 20,
Overlapping of lines with adjacent line figures is avoided on the map of the desired scale, and the house shape becomes easy to see.

The control unit 22 controls the target scale (here, 1/10000) and the reduction rate (here, 1/4500) from the original scale (here, 1/2500).
{= 1/10000 / (1/2500)}) and the output resolution (for example, information indicating the output device) are input. The control device 22 determines the reference lengths La and Lb based on the target scale and reduction ratio.
The reference length La to the comparison circuit 16, the reference length Lb to the transformation device 18, and the reduction ratio and the output resolution to the reduction device 20.
Supply to each.

FIG. 3 shows an operation flow chart of the deforming device 18. First, the shortest side is searched (S1). A house shape model in which the side P ₁ P ₂ is the shortest side as shown in FIG. 4 will be described. When the shortest side P ₁ P ₂ is greater than or equal to the reference length Lb (S
2), the side P ₆ P ₁ after the shortest side P ₁ P ₂ and the side P ₂ P before the shortest side P ₁ P ₂
The difference θ between the direction angles of ₃ is calculated (S3), and it is confirmed whether the angle θ is larger than the reference value and smaller than (360−reference value) (S4). The reference value is, for example, 170
It is ゜. By steps S3 and S4, it is confirmed whether the front side and the rear side are substantially parallel and opposite.

When the front side and the rear side are substantially parallel and opposite to each other (S4), a protrusion having a width smaller than the reference length Lb as shown in FIGS. 5, 6, 7 and 8 is provided. A shape model can be assumed. 5 to 8, the side P ₁ P ₂ is the shortest side. In this specification, the side P _N P ₁ having the start point P ₁ of the shortest side P ₁ P ₂ as the end point is the rear side, and the side P ₂ P ₃ having the end point P _{2 of the} shortest side as the start point is the front side. 5 and 6 show shape models when the front side length is equal to or larger than the rear side length, and FIGS. 7 and 8 show shape models when the front side length is smaller than the rear side length. Figure 7
FIG. 8 shows a shape model obtained by horizontally inverting the shape model shown in FIG. 5, and FIG. 8 shows a shape model obtained by horizontally inverting the shape model shown in FIG.

The length of the front side P ₂ P _{3 and} the length of the rear side P _N P ₁ are compared (S5). In the shape models shown in FIGS. 5 and 6, the front side P ₂ P ₃ is longer than the rear side P _N P ₁ , and in the shape models shown in FIGS. 7 and 8, the front side P ₂ P ₃ is the rear side P _N P. ₁
Shorter.

Front side P_TwoP_ThreeIs the rear side P_NP₁Length of
In the above case (S5), that is, the shape model shown in FIGS.
P on the front side against Dell_TwoP_ThreeEnd point P_ThreeBut substantially after
Side P _NP₁The side P after the_N-1P_NLine (including extension line)
Mu. ) It is checked whether it is above (S6).

When the end point P _{3 of the} front side P ₂ P ₃ is substantially on the line of the rear rear side P _N-1 P _N (S6), it is deformed as shown in FIG. That is, first, from the shape shown in FIG. 5 (a), as shown in FIG. 5 (b), two end points _P 1 of the shortest side _P 1 _{P 2,} and _{P 2,} 2 vertices forming the bottom of the protruding portion P
_{One of N} and P ₃ , for example, the vertex P ₃ is deleted, and the remaining vertex P _N is connected to the vertex P ₄ . However, if the length of the vertical line when a perpendicular line is dropped on the line segment _{P N-1 P 4} connecting the front and rear vertices _{P N-1, P 4} from its apex _{P N} is equal to or less than the reference length Lb, the apex Since there is no meaning to leave P _N , FIG.
As shown in (c), the vertex P _N is also deleted and the vertex P _N is deleted.
_{N-1, P 4} between the directly connected. In FIG. 5C, the protrusion including the shortest side is completely deleted.

When the end point P _{3 of the} front side P ₂ P ₃ is not substantially on the line of the rear rear side P _N-1 P _N (S6), it is transformed as shown in FIG. That is, from the shape shown in FIG. 6A, as shown in FIG. 6B, both end points P ₁ of the shortest side P ₁ P ₂ ,
P ₂ is deleted, a perpendicular is drawn from the start point of the rear side P _N P ₁ to the front side P ₂ P ₃ , and the vertex P _N is moved to the foot P _Na . As a result, the protrusion is deleted at the height of the rear side P _N P ₁ .

When the length of the front side P ₂ P ₃ is less than the length of the rear side P _N P ₁ (S5), that is, the processing shown in steps S6 to S8 for the shape model shown in FIGS. 7 and 8. And perform processing with the left and right reversed. That is, the starting point P of the rear side P _N P _1
It is checked whether or not _N is substantially on the line (including the extension line) of the side P ₃ P ₄ further before the side P ₂ P ₃ (S).
9).

Rear side P_NP₁Starting point P_NIs substantially before
Side P_ThreeP_FourIf it is on the line (S9), as shown in FIG.
Transforms into. That is, first, from the shape shown in FIG.
As shown in FIG. 7B, the shortest side P₁P_TwoEnd points of
P₁, P_TwoAnd the two vertices that form the bottom of the protrusion
P_N, P_ThreeOne of the, for example, vertex P_NRemove and leave
Vertex P _ThreeIs the vertex P_N-1Connect with. However, the vertex P_ThreeOr
The vertex P before and after that_N-1, P _FourLine segment P connecting between_N-1
P_FourThe length of the vertical line when the vertical line is lowered to the reference length L
If b or less, the vertex P_ThreeBecause there is no meaning to leave
Further, as shown in FIG._ThreeAlso delete, vertex P
_N-1, P_FourConnect the spaces directly. In FIG. 7 (c),
The protrusion including the short side is completely deleted.

When the starting point P _{N of the} rear side P _N P ₁ is not substantially on the line of the front front side P ₃ P ₄ (S9), it is transformed as shown in FIG. That is, from the shape shown in FIG.
As shown in (b), both end points P ₁ , P of the shortest side P ₁ P ₂
Remove the ₂ rear from the end point _{P 3} of the front side _P 2 _{P 3} sides _P N _{P 1}
The vertical line is dropped to and the apex P ₃ is moved to the foot P _3a .
As a result, the protrusion is deleted by the height of the rear side P ₂ P ₃ .

By repeating the above, it is possible to remove the substantially rectangular protrusion whose top edge is the shortest edge.

The processing when the front side and the rear side of the shortest side are not substantially parallel, or parallel but not in the opposite direction (S4) will be described. In this case, as shown in FIG. 9, there is a single side shorter than the reference length Lb, and FIG.
Also, as shown in FIG. 11, it is considered that the sides shorter than the reference length Lb are continuous.

As shown in FIG. 9A, the length is shorter than the reference length Lb.
Side P₁P_Two9 is present independently (S12), FIG.
As shown in (b), the front side P_TwoP_ThreeAnd after
Side P _NP₁Inverse ratio with the length of the side P₁P_TwoSplit the
The division point of P_1aAnd That is, side P₁P_1aThe length of
Side P_1aP_TwoThe ratio of the lengths of the sides P_TwoP_ThreeLength and side P_N
P₁Division point P so that it becomes equal to the ratio of the lengths of_1aSet up
Set. Then, the division point P_1aPass through P_NP₁And flat
The line drawn on the line and the back side P_N-1P_NLine (including extension line)
Mu. ) P_NaAnd Similarly, the division point P_1a
Pass P_TwoP _ThreeAnd a line drawn in parallel with the front side P_ThreeP
_FourP is the intersection with the line (including the extension line)_{Three a}And Minute
Split point P_1aIs the vertex P₁As an alternative point, and point P_NaIs the vertex P
_NAs an alternative point, and point P_3aIs the vertex P_ThreeAs an alternative to
Point P_1aAnd point P_NaConnect to point P _1aAnd point P_3aContact
Continue to point P_TwoTo delete.

Further, a perpendicular is drawn from the point P _1a to the line connecting the points P _Na and P _3a before and after the point P _1a, and when the length of the perpendicular is less than the reference length Lb, it is shown in FIG. 9C. Thus, the point P _1a is deleted and the side connecting the point P _Na and the point P _3a is formed.

When the sides having the reference length Lb or less are continuous (S1
2) Check whether the number of consecutive edges is even or odd (S
14). If the number is even (S14), for example, FIG.
When all the line segments between the points P _{1 to} P ₇ are equal to or less than the reference length Lb, as shown in FIG. 10, as shown in FIG.
₂ , P ₄ , P ₆ are all deleted, and lines P ₁ P ₃ , P ₃ P ₅ ,
Newly set the P ₅ P ₇ (S15).

[0054] When the number of consecutive reference length Lb or less sides is odd (S14), for example, 11 points as shown in (a) _{P 1}
When all the line segments between P _{6 and} P ₆ are equal to or less than the reference length Lb,
As shown in (b), a new point P is added in the middle between the even-numbered points P ₂ and P ₄ and the next (or previous) points P ₃ and P _5.
2a and P _4a are set, vertices P _{2 to} P ₅ located in the middle of continuous sides having a reference length Lb or less are deleted, and a start point P ₁ and an end point P ₆ and intermediate points P _2a and P ₂ set here are deleted.
_4a are sequentially connected (S16).

The steps S3 to S16 are repeated until the shortest side of the house data exceeds the reference length Lb (S2).
When the shortest side of the house data exceeds the reference length Lb (S2),
The above deformation processing result is output and the deformation processing ends (S17).

As shown in FIGS. 5 to 8, when the top side of a small rectangular protrusion is the shortest side, the start point P ₁ and the end point P ₂ of the top side are deleted, and the vertex forming the bottom of the protrusion is deleted. P _N , P
₃ may be directly connected. Even if the length of the side P _N P ₃ becomes equal to or less than the reference length Lb, the deformation process # 5 (S13) causes
Similar or similar results to the above case are obtained.

The functions of the removal determining device 12, the deforming device 18, the reducing device 20, and the control device 22 are realized by software on a computer, but can of course be realized by hardware. The reduction function of the reduction device 20
It may be divided into a reduction to a desired scale and a reduction corresponding to half the resolution for improving the appearance. In that case, it is also clear that the former reduction function may be arranged in front of the removal determination device 12, for example.

Although the embodiment applied to a house has been described, the present invention can be applied to the case of reducing a general graphic not limited to a house.

[0059]

As can be easily understood from the above description, according to the present invention, it is possible to reduce the size of house data to a size that matches a desired scale while maintaining the basic shape. Moreover, since the shape is transformed into a shape that is easy to see on the target scale, it is possible to obtain a map that is easy to see.

[Brief description of drawings]

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

FIG. 2 is an example of the shape of house data for explaining the operation of the circumscribing rectangle setting device 14.

FIG. 3 is an operation flowchart of the deforming device 18.

FIG. 4 is a house shape model for explaining a difference in direction angle between a front side and a rear side.

FIG. 5 is a processing example of modification processing # 1 (step S7).

FIG. 6 is a processing example of modification processing # 2 (step S8).

FIG. 7 is a processing example of modification processing # 3 (step S10).

FIG. 8 is a processing example of modification processing # 4 (step S11).

FIG. 9 is a processing example of modification processing # 5 (step S13).

FIG. 10 is a processing example of modification processing # 6 (step S15).

FIG. 11 is a processing example of modification processing # 7 (step S16).

[Explanation of symbols] 10: Input house data 12: Removal determination device 14: circumscribed rectangle setting device 16: Comparator 18: Deformation device 20: Reduction device 22: Control device

Continuation of front page (51) Int.Cl. ⁷ Identification code FI theme code (reference) G09G 5/36 G09G 5/36 520G F term (reference) 2C032 HC24 5B050 BA17 CA07 EA12 EA13 EA21 FA02 5B057 CA12 CA17 CB12 CB17 CC04 CD05 CF05 5C082 AA01 BA12 CA34 MM10 5E501 AA30 AC15 BA03 FA14 FA44 FB21 FB25 FB45

Claims (26)

[Claims] 1. A graphic reduction and compilation method for reducing and compiling graphic data, which comprises a plurality of vertices and connecting lines between vertices which connect these vertices in order, and determines whether or not the size of input graphic data is a predetermined size or more. A removal determination step of determining and removing if the size is less than a predetermined size, and a deformation step of transforming the shape of the graphic data not removed by the removal determination step so that the line length of each vertex connecting line exceeds a predetermined reference length. And a reduction step of reducing the shape of the graphic data transformed in the transformation step to a size smaller by a predetermined amount according to the output resolution. 2. The deforming step includes any one of a shortest side searching step for searching the shortest side among the connecting lines between vertices, and a top side of a convex portion and a bottom side of a concave portion of which the shortest side is substantially rectangular. If the shortest side is either the top side of the convex portion or the bottom side of the concave portion of the rectangle, the vertexes that are the start and end points of the shortest side are determined. The method for reducing and compiling a figure according to claim 1, further comprising a step of deleting and deleting the shortest side connecting the vertices on both sides thereof. 3. The transformation step further comprises a continuation determination step of determining whether or not the connection lines between vertices having a length equal to or shorter than the predetermined reference length are continuous, and when the connection lines between vertices having a length shorter than the predetermined reference length are not continuous, The connection line between vertices with the predetermined reference length or less is divided by the line length ratio of the connection line between vertices on both sides, and the connection line between vertices on both sides is translated so that the division point is an end point, and the division point And a line deletion step in which the opposite end point of the connecting line between the vertices after the parallel movement is substituted for the end point of the connecting line between the vertices having the predetermined reference length or less and the vertex of the connecting line between the vertices on both sides before the parallel movement. The graphic reduction and knitting method according to claim 2, further comprising: 4. The step of transforming further comprises a step of thinning out every other intermediate vertex of the continuous connecting lines between the vertices having the predetermined reference length or less, and a continuous connecting line between the vertices having the predetermined reference length or less. The middle one of
In the case where the vertex substitution step of substituting every other vertex with an intermediate point between the adjacent vertices and the connection line between vertices having the predetermined reference length or less are continuous,
The selection step of calculating the number of continuous connecting lines between vertices having a length equal to or shorter than the predetermined reference length, and selecting one of the decimating step for vertices and the alternate step for vertices according to the calculation result. Figure reduction method. 5. The deforming step draws a perpendicular from the target vertex to a line connecting two vertices on both sides of the target vertex.
4. The figure reducing and knitting method according to claim 1, 2 or 3, further comprising: a target vertex deleting step of deleting the target vertex when the length of the perpendicular is equal to or shorter than the predetermined reference length. 6. The graphic according to claim 1, wherein the reducing step reduces the shape of the graphic data transformed in the transforming step to a size smaller than a target scale size by a predetermined amount according to the output resolution. Reduction compilation method. 7. The removal determining step includes a circumscribing rectangle setting step of setting a circumscribing rectangle to the input graphic data, and a comparing step of comparing the short side of the rectangle set in the circumscribing rectangle setting step with a predetermined length. The graphic reduction and knitting method according to claim 1, further comprising: 8. The graphic reduction and compilation method according to claim 1, wherein the graphic data is house data representing a house on a map. 9. A graphic reduction / compilation device for reducing and compiling graphic data consisting of a plurality of vertices and connecting lines between vertices connecting these vertices in order, and checking whether the size of the inputted graphic data is a predetermined size or more. Removal determining means for determining and removing if the size is less than a predetermined size, and deforming means for transforming the shape of the graphic data not removed by the removal determining means so that the line length of each vertex connecting line exceeds a predetermined reference length. A graphic reduction and knitting apparatus comprising: a reduction means for reducing the shape of the graphic data transformed by the transformation means to a size smaller by a predetermined amount according to the output resolution. 10. The deforming means is any one of a shortest side searching means for searching the shortest side among the connecting lines between vertices, and a top side of a convex portion and a bottom side of a concave portion of which the shortest side is substantially rectangular. If the shortest side is substantially either the top side of the convex portion or the bottom side of the concave portion of the rectangle, the vertices serving as the start point and the end point of the shortest side are determined. The figure reducing and knitting apparatus according to claim 9, further comprising: a shortest side deleting unit that deletes and connects vertices on both sides thereof. 11. The continuation determining means for determining whether or not the connecting lines between vertices having the predetermined reference length or less are continuous, and the deforming means further comprising: The connection line between vertices with the predetermined reference length or less is divided by the line length ratio of the connection line between vertices on both sides, and the connection line between vertices on both sides is translated so that the division point is an end point, and the division point And a line deleting means that substitutes the end point on the opposite side of the connecting line between the vertices after the parallel movement for the end point of the connecting line between the vertices having the predetermined reference length or less and the apex of the connecting line between the vertices on both sides before the parallel movement. The figure reduction knitting apparatus according to claim 10, further comprising: 12. The deforming means further comprises apex thinning means for thinning out every other middle vertex of the continuous connecting points between the vertices having the predetermined reference length or less, and continuous connecting lines between the vertices having the predetermined reference length or less. The middle one of
When the alternate vertex that substitutes every other vertex at an intermediate point between the adjacent vertices and the connecting line between the vertices having the predetermined reference length or less are continuous,
The selection means for calculating the number of continuous connecting lines between vertices having a length equal to or shorter than the predetermined reference length, and selecting means for selecting one of the decimating means for vertices and the alternative means for vertices according to the calculation result. Figure reduction device. 13. The deforming means is provided on both sides of the target vertex.
10. A target vertex deleting means for dropping a perpendicular line from the target vertex on a line connecting the two vertices and deleting the target vertex when the length of the perpendicular line is equal to or shorter than the predetermined reference length.
The graphic reduction method according to 10 or 11. 14. The graphic according to claim 9, wherein the reducing means reduces the shape of the graphic data deformed by the deforming means to a size smaller than a target scale size by a predetermined amount according to the output resolution. Reduction knitting device. 15. The removal determining means includes a circumscribing rectangle setting means for setting a rectangle circumscribing the input graphic data, and a comparing means for comparing a short side of the rectangle set by the circumscribing rectangle setting means with a predetermined length. The method for reducing and compiling a graphic according to claim 9, further comprising: 16. The graphic reduction and compilation apparatus according to claim 8, wherein the graphic data is house data representing a house on a map. 17. A graphic transformation method for transforming and simplifying graphic data, which comprises a plurality of vertices and connecting lines between vertices connecting these in order, and searching for the shortest side of each connecting line between vertices. And a rectangle determination step of determining whether the shortest side is substantially one of the top side of the convex portion and the bottom side of the concave portion of the rectangular shape, and the shortest side is a substantially rectangular convex shape. A top edge of the part and a bottom edge of the recess, a vertex that serves as a start point and an end point of the shortest edge is deleted, and a shortest edge deleting step that connects the vertices on both sides of the shortest edge is included. Shape transformation method. 18. A continuity determining step of determining whether or not the connecting lines between vertices having a length equal to or shorter than the predetermined reference length are continuous, and the predetermined reference length if the connecting lines between vertices having a length not longer than the predetermined reference length are not continuous. The following connecting line between vertices is divided by the line length ratio of the connecting line between vertices on both sides, and the connecting line between vertices on both sides is translated so that the dividing point is the end point, and after the dividing point and parallel translation And a line deleting step of substituting an end point on the opposite side of the connection line between the vertices for the end point of the connection line between the vertices having the predetermined reference length or less and a vertex of the connection line between the vertices on both sides before translation. Item 17. The graphic transformation method according to Item 17. 19. Further, a vertex thinning step of thinning out every other intermediate vertices of the continuous connecting vertices having the predetermined reference length or less, and 1 in the middle of the continuous connecting vertices having the predetermined reference length or less.
In the case where the vertex substitution step of substituting every other vertex with an intermediate point between the adjacent vertices and the connection line between vertices having the predetermined reference length or less are continuous,
The selection step of calculating the number of continuous connecting lines between vertices having the predetermined reference length or less and selecting one of the decimating step of vertices and the alternate step of vertices according to the calculation result. Shape transformation method. 20. Further, a perpendicular line is drawn from the target vertex to a line connecting two vertices on both sides of the target vertex, and when the length of the perpendicular line is equal to or shorter than the predetermined reference length, the target vertex is deleted. 19. The method according to claim 17, further comprising a deleting step.
Alternatively, the graphic transformation method according to Item 19. 21. The graphic transformation method according to claim 17, wherein the graphic data is house data representing a house on a map. 22. A graphic transformation device for transforming and simplifying graphic data comprising a plurality of vertices and connecting lines for connecting the vertices in order, wherein the shortest side among the connecting lines for each vertex is searched. Means for searching the shortest side, a rectangle determining means for determining whether the shortest side is either the top side of the convex portion or the bottom side of the concave portion of the rectangular shape, and the shortest side is a substantially rectangular convex shape. When any one of the top side of the part and the bottom side of the concave portion is provided, the shortest side deleting means is provided for deleting the apexes which are the start point and the end point of the shortest side and connecting the apexes on both sides thereof. Graphic transformation device. 23. Further, a continuity determination means for determining whether or not the connecting lines between vertices having the predetermined reference length or less are continuous, and the predetermined reference length when the connecting lines between the vertices having the predetermined reference length or less are not continuous. The following connecting line between vertices is divided by the line length ratio of the connecting line between vertices on both sides, and the connecting line between vertices on both sides is translated so that the dividing point is the end point, and after the dividing point and parallel translation And line deleting means for substituting the opposite end point of the connection line between the vertices for the connection point between the connection lines between the vertices having the predetermined reference length or less and the vertices of the connection line between the vertices on both sides before translation. Item 23. The graphic transformation device according to Item 22. 24. An apex thinning-out means for thinning out every other middle vertex of the continuous connecting lines between the vertices having the predetermined reference length or less, and a middle one between the connecting lines connecting the vertices having the predetermined reference length or less.
When the alternate vertex that substitutes every other vertex at an intermediate point between the adjacent vertices and the connecting line between the vertices having the predetermined reference length or less are continuous,
24. The selection means for calculating the number of continuous connecting lines between vertices having a length equal to or shorter than the predetermined reference length, and selecting means for selecting one of the vertices thinning means and the vertices substituting means according to the calculation result. Graphic transformation device. 25. Further, a vertical line is drawn from the target vertex to a line connecting two vertices on both sides of the target vertex, and when the length of the vertical line is equal to or shorter than the predetermined reference length, the target vertex is deleted. 24. The method according to claim 22, comprising a deleting step.
Alternatively, the graphic transformation device according to Item 24. 26. The graphic transformation device according to claim 22, wherein the graphic data is house data representing a house on a map.