CN104599295A - Method of constructing adjusting scale and north arrow in electronic map through computer - Google Patents
Method of constructing adjusting scale and north arrow in electronic map through computer Download PDFInfo
- Publication number
- CN104599295A CN104599295A CN201510090546.5A CN201510090546A CN104599295A CN 104599295 A CN104599295 A CN 104599295A CN 201510090546 A CN201510090546 A CN 201510090546A CN 104599295 A CN104599295 A CN 104599295A
- Authority
- CN
- China
- Prior art keywords
- rectangle
- dotted line
- line limit
- optimum position
- stage
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/60—Analysis of geometric attributes
Abstract
A method of constructing an adjusting scale and a north arrow in an electronic map through a computer includes the steps of preprocessing, importing, setting of a first rectangle of dotted edges, setting of an additional rectangle, solving of an intersection, calculating of width and height, calculating of an optimal position of a legend, calculating an optimal position of the north arrow, and storing. The method has the advantages that the prior manual constructing method is low in efficiency and the optimal position is difficult to calculate are effectively solved.
Description
Technical field
The invention belongs to the technical field of electronic chart, be specifically related to a kind of method by the adjustment legend in computer construction electronic chart and north arrow.
Background technology
Often need in the manufacturing process of existing electronic chart map, legend and north arrow to be put together often; avoid overlap and realize putting of optimum position; but usually still use manual form to realize now, such implementation often inefficiency and be difficult to realize putting of optimum position.
Summary of the invention
Object of the present invention provides a kind of method by the adjustment legend in computer construction electronic chart and north arrow, successively through pretreatment stage, lead-in stage, the first rectangle of being made up of dotted line limit set the stage, setting stage of additional rectangular, stage of obtaining of common factor, molded breadth and the stage of height, the optimum position stage calculating legend, the optimum position stage calculating north arrow and the first rectangle Q0 position determine the stage again.The mode often inefficiency and be difficult to realize the defect of putting of optimum position that such method can effectively avoid the manual form of use of the prior art to realize.
In order to overcome deficiency of the prior art, the invention provides a kind of solution of the method by the adjustment legend in computer construction electronic chart and north arrow, specific as follows:
By a method for the adjustment legend in computer construction electronic chart and north arrow, step is as follows:
Step 1: pretreatment stage, described pretreatment stage is the module be provided with first in a computer for adjustment legend and north arrow;
Step 2: lead-in stage, described lead-in stage is polygonal profile P0, the profile of legend, the profile of north arrow that the module being used for adjusting legend and north arrow by computer starting inputs the map four corner that will show for electronic chart;
Step 3: the first rectangle setting stage be made up of dotted line limit, the rectangle setting stage be made up of dotted line limit is the first rectangle Q0 doing to be made up of dotted line limit, the dotted line limit of the first rectangle Q0 that dotted line limit is formed is tangential on the polygonal profile P0 of map four corner, and the first rectangle Q0 that dotted line limit is formed comprises the polygonal profile P0 of map four corner, and the first each limit of rectangle Q0 that dotted line limit is formed is parallel or perpendicular to the coordinate axis of the plane right-angle coordinate of setting;
Step 4: the setting stage of additional rectangular, the setting stage of described additional rectangular is in the upper right corner of the first rectangle Q0 be made up of dotted line limit, the upper left corner, the the second rectangle Q1 be made up of dotted line limit is placed in the lower left corner and the lower right corner respectively, the 3rd rectangle Q2 be made up of dotted line limit, the 4th rectangle Q3 be made up of dotted line limit and the 5th rectangle Q4 be made up of dotted line limit, the 3rd rectangle Q2 that the second rectangle Q1 be made up of dotted line limit is formed with by dotted line limit is consistent with the rectangle size of the profile being external in north arrow, and the 5th rectangle Q4 that the 4th rectangle Q3 be made up of dotted line limit is formed with by dotted line limit is consistent with the rectangle size of the profile being external in legend,
The X-coordinate minimum value of the second rectangle Q1 be made up of dotted line limit and Y-coordinate minimum value are designated as Q1.Xmin and Q1.Ymin respectively;
The X-coordinate maximal value of the 3rd rectangle Q2 be made up of dotted line limit and Y-coordinate minimum value are designated as Q2.Xmax and Q2.Ymin respectively;
The X-coordinate maximal value of the 4th rectangle Q3 be made up of dotted line limit and Y-coordinate maximal value are designated as Q3.Xmax and Q3.Ymax respectively;
The X-coordinate minimum value of the 5th rectangle Q4 be made up of dotted line limit and Y-coordinate maximal value are designated as Q4.Xmin and Q4.Ymax respectively;
Step 5: common factor obtain the stage, the stage of obtaining of described common factor be ask the first rectangle P0 of being made up of dotted line limit respectively with the second rectangle Q1 be made up of dotted line limit, the 3rd rectangle Q2 be made up of dotted line limit, the 4th rectangle Q3 be made up of dotted line limit and the common factor of the 5th rectangle Q4 under two-dimensional direct angle coordinate system that be made up of dotted line limit, obtain the first polygon R1, the second polygon R2, the 3rd polygon R3 and the 4th polygon R4 respectively;
The X-coordinate maximal value of the first polygon R1 and Y-coordinate maximal value are designated as R1.Xmax and R1.Ymax respectively;
The X-coordinate minimum value of the second polygon R2 and Y-coordinate maximal value are designated as R2.Xmin and R2.Ymax respectively;
The X-coordinate minimum value of the 3rd polygon R3 and Y-coordinate minimum value are designated as R3.Xmin and R3.Ymin respectively;
The X-coordinate maximal value of the 4th polygon R4 and Y-coordinate minimum value are designated as R4.Xmax and R4.Ymin respectively;
Step 6: the stage of molded breadth and height, the stage of described molded breadth and height is calculating first width numerical value w1, the second width numerical value w2, the 3rd width numerical value w3, the 4th width numerical value w4, the first height number h1, the second height number h2, third high number of degrees value h3 and the 4th height number h4, specific as follows:
Calculate the first width numerical value w1 and the first height number h1 when the first polygon R1 exists, make: w1=R1.Xmax-Q1.Xmin, h1=R1.Ymax-Q1.Ymin; When the first polygon R1 does not exist, w1=0, h1=0;
Calculate the second width numerical value w2 and the second height number h2 when the second polygon R2 exists, make: w2=Q2.Xmax-R2.Xmin, h2=R2.Ymax-Q2.Ymin; When the second polygon R2 does not exist, w2=0, h2=0;
Calculate the 3rd width numerical value w3 and third high number of degrees value h3 when the 3rd polygon R3 exists, make: w3=Q3.Xmax-R3.Xmin, h3=Q3.Ymax-R3.Ymin; When the 3rd polygon R3 does not exist, w3=0, h3=0;
Calculate the 4th width numerical value w4 and the 4th height number h4 when the 4th polygon R4 exists, make: w4=R4.Xmax-Q4.Xmin, h4=Q4.Ymax-R4.Ymin; When polygon R4 does not exist, w4=0, h4=0;
Step 7: in the optimum position stage calculating legend, the optimum position stage of described calculating legend is evaluation first optimum position coefficient d the 1, the 3rd optimum position coefficient d 3 and the 4th optimum position coefficient d 4, and determines the optimum position of legend relative to picture frame:
If h3=min (w3, w4, h3, h4), then d1=0, d3=0, d4=h3, legend optimum position is the picture frame lower left corner;
W3=min (w3, w4, h3, h4), then d1=0, d3=w3, d4=0 else if, legend optimum position is the picture frame lower left corner;
H4=min (w3, w4, h3, h4), then d1=0, d3=0, d4=h4 else if, legend optimum position is the picture frame lower right corner;
Otherwise d1=w4, d3=0, d4=0, legend optimum position is the picture frame lower right corner;
Step 8: in the optimum position stage calculating north arrow, the optimum position stage of described calculating north arrow is calculating second optimum position coefficient and determines the optimum position of north arrow relative to picture frame:
If w1>d1 and w2>d3 and h1=min (h1, h2), then d2=h1, north arrow optimum position is the picture frame upper right corner;
W1>d1 and w2>d3 and h2=min (h1, h2), then d2=h2 else if, north arrow optimum position is the picture frame upper left corner;
W1<d1 and w2<d3 and legend optimum position is the picture frame lower left corner, then d2=0 else if, north arrow optimum position is the picture frame upper right corner;
W1<d1 and w2<d3 and legend optimum position is the picture frame lower right corner, then d2=0 else if, north arrow optimum position is the picture frame upper left corner;
W1<d1 else if, then d2=0, north arrow optimum position is the picture frame upper right corner;
Otherwise w2<d2, then d2=0, north arrow optimum position is the picture frame upper left corner;
Step 9: the first rectangle Q0 position determine the stage again, the first described rectangle Q0 position determine that the stage is by the left side of the first rectangle Q0 be made up of dotted line limit, top, the right, below respectively to the distance of rectangle outer translation d1, d2, d3 and d4, obtains the position of new the first rectangle Q0 be made up of dotted line limit again.The north arrow determined relative to the optimum position of picture frame, step 8 of the legend so just can determined by step 7 is relative to the optimum position of picture frame, and the position of new the first rectangle Q0 be made up of dotted line limit that step 9 obtains.
By these technical characteristics, method of adjustment formation efficiency of the present invention is high, can really realize automatic adjustment.
Accompanying drawing explanation
Figure l is the Mass production system flow schematic diagram of a kind of electronic cartography of the present invention.
Fig. 2 is the effect schematic diagram of the step 3 of the embodiment of the present invention.
Fig. 3 is the effect schematic diagram of the step 4 of the embodiment of the present invention.
Fig. 4 is the effect schematic diagram of the step 5 of the embodiment of the present invention.
Embodiment
The object of the invention is a kind of efficiently method by the adjustment legend in computer construction electronic chart and north arrow developing robotization, be further detailed by drawings and Examples:
As shown in Figure 1, by the method for the adjustment legend in computer construction electronic chart and north arrow, step is as follows:
Step 1: pretreatment stage, described pretreatment stage is the module be provided with first in a computer for adjustment legend and north arrow;
Step 2: lead-in stage, described lead-in stage is polygonal profile P0, the profile of legend, the profile of north arrow that the module being used for adjusting legend and north arrow by computer starting inputs the map four corner that will show for electronic chart;
Step 3: the first rectangle setting stage be made up of dotted line limit, as shown in Figure 2, the rectangle setting stage be made up of dotted line limit is the first rectangle Q0 doing to be made up of dotted line limit, the dotted line limit of the first rectangle Q0 that dotted line limit is formed is tangential on the polygonal profile P0 of map four corner, and the first rectangle Q0 that dotted line limit is formed comprises the polygonal profile P0 of map four corner, and the first each limit of rectangle Q0 that dotted line limit is formed is parallel or perpendicular to the coordinate axis of the plane right-angle coordinate of setting;
Step 4: the setting stage of additional rectangular, as shown in Figure 3, the setting stage of described additional rectangular is in the upper right corner of the first rectangle Q0 be made up of dotted line limit, the upper left corner, the the second rectangle Q1 be made up of dotted line limit is placed in the lower left corner and the lower right corner respectively, the 3rd rectangle Q2 be made up of dotted line limit, the 4th rectangle Q3 be made up of dotted line limit and the 5th rectangle Q4 be made up of dotted line limit, the 3rd rectangle Q2 that the second rectangle Q1 be made up of dotted line limit is formed with by dotted line limit is consistent with the rectangle size of the profile being external in north arrow, and the 5th rectangle Q4 that the 4th rectangle Q3 be made up of dotted line limit is formed with by dotted line limit is consistent with the rectangle size of the profile being external in legend,
The X-coordinate minimum value of the second rectangle Q1 be made up of dotted line limit and Y-coordinate minimum value are designated as Q1.Xmin and Q1.Ymin respectively;
The X-coordinate maximal value of the 3rd rectangle Q2 be made up of dotted line limit and Y-coordinate minimum value are designated as Q2.Xmax and Q2.Ymin respectively;
The X-coordinate maximal value of the 4th rectangle Q3 be made up of dotted line limit and Y-coordinate maximal value are designated as Q3.Xmax and Q3.Ymax respectively;
The X-coordinate minimum value of the 5th rectangle Q4 be made up of dotted line limit and Y-coordinate maximal value are designated as Q4.Xmin and Q4.Ymax respectively;
Step 5: common factor obtain the stage, as shown in Figure 4, the stage of obtaining of described common factor be ask the first rectangle P0 of being made up of dotted line limit respectively with the second rectangle Q1 be made up of dotted line limit, the 3rd rectangle Q2 be made up of dotted line limit, the 4th rectangle Q3 be made up of dotted line limit and the common factor of the 5th rectangle Q4 under two-dimensional direct angle coordinate system that be made up of dotted line limit, obtain the first polygon R1, the second polygon R2, the 3rd polygon R3 and the 4th polygon R4 respectively;
The X-coordinate maximal value of the first polygon R1 and Y-coordinate maximal value are designated as R1.Xmax and R1.Ymax respectively;
The X-coordinate minimum value of the second polygon R2 and Y-coordinate maximal value are designated as R2.Xmin and R2.Ymax respectively;
The X-coordinate minimum value of the 3rd polygon R3 and Y-coordinate minimum value are designated as R3.Xmin and R3.Ymin respectively;
The X-coordinate maximal value of the 4th polygon R4 and Y-coordinate minimum value are designated as R4.Xmax and R4.Ymin respectively;
Step 6: the stage of molded breadth and height, the stage of described molded breadth and height is calculating first width numerical value w1, the second width numerical value w2, the 3rd width numerical value w3, the 4th width numerical value w4, the first height number h1, the second height number h2, third high number of degrees value h3 and the 4th height number h4, specific as follows:
Calculate the first width numerical value w1 and the first height number h1 when the first polygon R1 exists, make: w1=R1.Xmax-Q1.Xmin, h1=R1.Ymax-Q1.Ymin; When the first polygon R1 does not exist, w1=0, h1=0;
Calculate the second width numerical value w2 and the second height number h2 when the second polygon R2 exists, make: w2=Q2.Xmax-R2.Xmin, h2=R2.Ymax-Q2.Ymin; When the second polygon R2 does not exist, w2=0, h2=0;
Calculate the 3rd width numerical value w3 and third high number of degrees value h3 when the 3rd polygon R3 exists, make: w3=Q3.Xmax-R3.Xmin, h3=Q3.Ymax-R3.Ymin; When the 3rd polygon R3 does not exist, w3=0, h3=0;
Calculate the 4th width numerical value w4 and the 4th height number h4 when the 4th polygon R4 exists, make: w4=R4.Xmax-Q4.Xmin, h4=Q4.Ymax-R4.Ymin; When polygon R4 does not exist, w4=0, h4=0;
Step 7: the optimum position stage calculating legend, the optimum position stage of described calculating legend is evaluation first optimum position coefficient d the 1, the 3rd optimum position coefficient d 3 and the 4th optimum position coefficient d 4, and determines the optimum position (be positioned at the lower left corner or the lower right corner of drawing) of legend relative to picture frame:
If h3=min (w3, w4, h3, h4), then d1=0, d3=0, d4=h3, legend optimum position is the picture frame lower left corner;
W3=min (w3, w4, h3, h4), then d1=0, d3=w3, d4=0 else if, legend optimum position is the picture frame lower left corner;
H4=min (w3, w4, h3, h4), then d1=0, d3=0, d4=h4 else if, legend optimum position is the picture frame lower right corner;
Otherwise d1=w4, d3=0, d4=0, legend optimum position is the picture frame lower right corner;
Step 8: in the optimum position stage calculating north arrow, the optimum position stage of described calculating north arrow is calculating second optimum position coefficient and determines the optimum position (be positioned at the upper right corner or the upper left corner of drawing) of north arrow relative to picture frame:
If w1>d1 and w2>d3 and h1=min (h1, h2), then d2=h1, north arrow optimum position is the picture frame upper right corner;
W1>d1 and w2>d3 and h2=min (h1, h2), then d2=h2 else if, north arrow optimum position is the picture frame upper left corner;
W1<d1 and w2<d3 and legend optimum position is the picture frame lower left corner, then d2=0 else if, north arrow optimum position is the picture frame upper right corner;
W1<d1 and w2<d3 and legend optimum position is the picture frame lower right corner, then d2=0 else if, north arrow optimum position is the picture frame upper left corner;
W1<d1 else if, then d2=0, north arrow optimum position is the picture frame upper right corner;
Otherwise w2<d2, then d2=0, north arrow optimum position is the picture frame upper left corner;
Step 9: the first rectangle Q0 position determine the stage again, the first described rectangle Q0 position determine that the stage is by the left side of the first rectangle Q0 be made up of dotted line limit, top, the right, below respectively to the distance of outer translation d1, d2, d3 and d4 size of rectangle, obtains the position of new the first rectangle Q0 be made up of dotted line limit again.
The north arrow determined relative to the optimum position of picture frame, step 8 of the legend so just can determined by step 7 is relative to the optimum position of picture frame, and the position of new the first rectangle Q0 be made up of dotted line limit that step 9 obtains.
The above, it is only preferred embodiment of the present invention, not any pro forma restriction is done to the present invention, although the present invention discloses as above with preferred embodiment, but and be not used to limit the present invention, any those skilled in the art, do not departing within the scope of technical solution of the present invention, make a little change when the technology contents of above-mentioned announcement can be utilized or be modified to the Equivalent embodiments of equivalent variations, in every case be do not depart from technical solution of the present invention content, according to technical spirit of the present invention, within the spirit and principles in the present invention, to any simple amendment that above embodiment is done, equivalent replacement and improvement etc., within the protection domain all still belonging to technical solution of the present invention.
Claims (1)
1., by a method for the adjustment legend in computer construction electronic chart and north arrow, it is characterized in that, step is as follows:
Step 1: pretreatment stage, described pretreatment stage is the module be provided with first in a computer for adjustment legend and north arrow;
Step 2: lead-in stage, described lead-in stage is polygonal profile P0, the profile of legend, the profile of north arrow that the module being used for adjusting legend and north arrow by computer starting inputs the map four corner that will show for electronic chart;
Step 3: the first rectangle setting stage be made up of dotted line limit, the rectangle setting stage be made up of dotted line limit is the first rectangle Q0 doing to be made up of dotted line limit, the dotted line limit of the first rectangle Q0 that dotted line limit is formed is tangential on the polygonal profile P0 of map four corner, and the first rectangle Q0 that dotted line limit is formed comprises the polygonal profile P0 of map four corner, and the first each limit of rectangle Q0 that dotted line limit is formed is parallel or perpendicular to the coordinate axis of the plane right-angle coordinate of setting;
Step 4: the setting stage of additional rectangular, the setting stage of described additional rectangular is in the upper right corner of the first rectangle Q0 be made up of dotted line limit, the upper left corner, the the second rectangle Q1 be made up of dotted line limit is placed in the lower left corner and the lower right corner respectively, the 3rd rectangle Q2 be made up of dotted line limit, the 4th rectangle Q3 be made up of dotted line limit and the 5th rectangle Q4 be made up of dotted line limit, the 3rd rectangle Q2 that the second rectangle Q1 be made up of dotted line limit is formed with by dotted line limit is consistent with the rectangle size of the profile being external in north arrow, and the 5th rectangle Q4 that the 4th rectangle Q3 be made up of dotted line limit is formed with by dotted line limit is consistent with the rectangle size of the profile being external in legend,
The X-coordinate minimum value of the second rectangle Q1 be made up of dotted line limit and Y-coordinate minimum value are designated as Q1.Xmin and Q1.Ymin respectively;
The X-coordinate maximal value of the 3rd rectangle Q2 be made up of dotted line limit and Y-coordinate minimum value are designated as Q2.Xmax and Q2.Ymin respectively;
The X-coordinate maximal value of the 4th rectangle Q3 be made up of dotted line limit and Y-coordinate maximal value are designated as Q3.Xmax and Q3.Ymax respectively;
The X-coordinate minimum value of the 5th rectangle Q4 be made up of dotted line limit and Y-coordinate maximal value are designated as Q4.Xmin and Q4.Ymax respectively;
Step 5: common factor obtain the stage, the stage of obtaining of described common factor be ask the first rectangle P0 of being made up of dotted line limit respectively with the second rectangle Q1 be made up of dotted line limit, the 3rd rectangle Q2 be made up of dotted line limit, the 4th rectangle Q3 be made up of dotted line limit and the common factor of the 5th rectangle Q4 under two-dimensional direct angle coordinate system that be made up of dotted line limit, obtain the first polygon R1, the second polygon R2, the 3rd polygon R3 and the 4th polygon R4 respectively;
The X-coordinate maximal value of the first polygon R1 and Y-coordinate maximal value are designated as R1.Xmax and R1.Ymax respectively;
The X-coordinate minimum value of the second polygon R2 and Y-coordinate maximal value are designated as R2.Xmin and R2.Ymax respectively;
The X-coordinate minimum value of the 3rd polygon R3 and Y-coordinate minimum value are designated as R3.Xmin and R3.Ymin respectively;
The X-coordinate maximal value of the 4th polygon R4 and Y-coordinate minimum value are designated as R4.Xmax and R4.Ymin respectively;
Step 6: the stage of molded breadth and height, the stage of described molded breadth and height is calculating first width numerical value w1, the second width numerical value w2, the 3rd width numerical value w3, the 4th width numerical value w4, the first height number h1, the second height number h2, third high number of degrees value h3 and the 4th height number h4, specific as follows:
Calculate the first width numerical value w1 and the first height number h1 when the first polygon R1 exists, make: w1=R1.Xmax-Q1.Xmin, h1=R1.Ymax-Q1.Ymin; When the first polygon R1 does not exist, w1=0, h1=0;
Calculate the second width numerical value w2 and the second height number h2 when the second polygon R2 exists, make: w2=Q2.Xmax-R2.Xmin, h2=R2.Ymax-Q2.Ymin; When the second polygon R2 does not exist, w2=0, h2=0;
Calculate the 3rd width numerical value w3 and third high number of degrees value h3 when the 3rd polygon R3 exists, make: w3=Q3.Xmax-R3.Xmin, h3=Q3.Ymax-R3.Ymin; When the 3rd polygon R3 does not exist, w3=0, h3=0;
Calculate the 4th width numerical value w4 and the 4th height number h4 when the 4th polygon R4 exists, make: w4=R4.Xmax-Q4.Xmin, h4=Q4.Ymax-R4.Ymin; When polygon R4 does not exist, w4=0, h4=0;
Step 7: in the optimum position stage calculating legend, the optimum position stage of described calculating legend is evaluation first optimum position coefficient d the 1, the 3rd optimum position coefficient d 3 and the 4th optimum position coefficient d 4, and determines the optimum position of legend relative to picture frame:
If h3=min (w3, w4, h3, h4), then d1=0, d3=0, d4=h3, legend optimum position is the picture frame lower left corner;
W3=min (w3, w4, h3, h4), then d1=0, d3=w3, d4=0 else if, legend optimum position is the picture frame lower left corner;
H4=min (w3, w4, h3, h4), then d1=0, d3=0, d4=h4 else if, legend optimum position is the picture frame lower right corner;
Otherwise d1=w4, d3=0, d4=0, legend optimum position is the picture frame lower right corner;
Step 8: in the optimum position stage calculating north arrow, the optimum position stage of described calculating north arrow is calculating second optimum position coefficient and determines the optimum position of north arrow relative to picture frame:
If w1>d1 and w2>d3 and h1=min (h1, h2), then d2=h1, north arrow optimum position is the picture frame upper right corner;
W1>d1 and w2>d3 and h2=min (h1, h2), then d2=h2 else if, north arrow optimum position is the picture frame upper left corner;
W1<d1 and w2<d3 and legend optimum position is the picture frame lower left corner, then d2=0 else if, north arrow optimum position is the picture frame upper right corner;
W1<d1 and w2<d3 and legend optimum position is the picture frame lower right corner, then d2=0 else if, north arrow optimum position is the picture frame upper left corner;
W1<d1 else if, then d2=0, north arrow optimum position is the picture frame upper right corner;
Otherwise w2<d2, then d2=0, north arrow optimum position is the picture frame upper left corner;
Step 9: the first rectangle Q0 position determine the stage again, the first described rectangle Q0 position determine that the stage is by the left side of the first rectangle Q0 be made up of dotted line limit, top, the right, below respectively to the distance of rectangle outer translation d1, d2, d3 and d4, obtains the position of new the first rectangle Q0 be made up of dotted line limit again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510090546.5A CN104599295A (en) | 2015-02-28 | 2015-02-28 | Method of constructing adjusting scale and north arrow in electronic map through computer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510090546.5A CN104599295A (en) | 2015-02-28 | 2015-02-28 | Method of constructing adjusting scale and north arrow in electronic map through computer |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104599295A true CN104599295A (en) | 2015-05-06 |
Family
ID=53125045
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510090546.5A Pending CN104599295A (en) | 2015-02-28 | 2015-02-28 | Method of constructing adjusting scale and north arrow in electronic map through computer |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104599295A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060041375A1 (en) * | 2004-08-19 | 2006-02-23 | Geographic Data Technology, Inc. | Automated georeferencing of digitized map images |
| CN101593456A (en) * | 2009-07-09 | 2009-12-02 | 浙江大学 | A kind of quick self-adaptive layout method of The Key to Maps |
| CN101593454A (en) * | 2009-07-09 | 2009-12-02 | 浙江大学 | A kind of intelligent output method for land parcel maps |
| CN102509510A (en) * | 2011-10-25 | 2012-06-20 | 浙江大学 | Interactive automatically updating method for legend content of electronic map |
| CN103258007A (en) * | 2013-04-16 | 2013-08-21 | 中国科学院地理科学与资源研究所 | Map annotation method and device by means of conflict detection mechanism |
| CN104317567A (en) * | 2014-09-28 | 2015-01-28 | 南京国图信息产业股份有限公司 | Method for batched map drawing by utilizing computer to operate map elements |
-
2015
- 2015-02-28 CN CN201510090546.5A patent/CN104599295A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060041375A1 (en) * | 2004-08-19 | 2006-02-23 | Geographic Data Technology, Inc. | Automated georeferencing of digitized map images |
| CN101593456A (en) * | 2009-07-09 | 2009-12-02 | 浙江大学 | A kind of quick self-adaptive layout method of The Key to Maps |
| CN101593454A (en) * | 2009-07-09 | 2009-12-02 | 浙江大学 | A kind of intelligent output method for land parcel maps |
| CN102509510A (en) * | 2011-10-25 | 2012-06-20 | 浙江大学 | Interactive automatically updating method for legend content of electronic map |
| CN103258007A (en) * | 2013-04-16 | 2013-08-21 | 中国科学院地理科学与资源研究所 | Map annotation method and device by means of conflict detection mechanism |
| CN104317567A (en) * | 2014-09-28 | 2015-01-28 | 南京国图信息产业股份有限公司 | Method for batched map drawing by utilizing computer to operate map elements |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103136767B (en) | A kind of vectorgraph charting method and apparatus | |
| CN104183016A (en) | Method for rapidly constructing 2.5-dimensional building model | |
| CN110750840A (en) | Method and device for automatically generating two-dimensional part view based on three-dimensional model | |
| CN104268237B (en) | The batch parallel generation system and its generation method of electronic cartography | |
| CN113362420B (en) | Road label generation method, device, equipment and storage medium | |
| CN116091526B (en) | Smart city three-dimensional scene tiling acceleration method | |
| CN103473984A (en) | Template-based dynamic map obtaining method in network environment | |
| KR20130051275A (en) | Apparatus and method for tile binning | |
| CN104599295A (en) | Method of constructing adjusting scale and north arrow in electronic map through computer | |
| CN109143773A (en) | A kind of optics closes on the preprocess method before amendment | |
| CN103489221A (en) | Method for parameterizing quadrilateral grid in conformal mode | |
| CN104363390A (en) | Lens vignetting compensation method and system | |
| CN105389783A (en) | Remote sensing image precise processing system and method | |
| CN102831632A (en) | Mirror image texture generating method, device and computer | |
| CN206301119U (en) | A kind of backlight module and display device | |
| US20230196671A1 (en) | Method and System for Rendering Boundary of Map Area Within Game Map, and Computer-Readable Storage Medium | |
| CN107798712A (en) | A kind of algorithm towards IDL polar regions Vector Field Visualization | |
| CN104636491A (en) | Batch generating system and batch generating method for making electronic maps | |
| CN113642281B (en) | Method, device, equipment and medium for detecting PCB design diagram | |
| CN105563446A (en) | Hardware panel lofting cutting assisting device | |
| CN103020356B (en) | A kind of triangulation of non-close figure | |
| CN107909563B (en) | Template-based rapid Hough transformation straight line detection method | |
| CN116168300B (en) | Nuclear line resampling method and device for GSDs (global navigation satellite system) such as high-resolution remote sensing images | |
| CN111009036A (en) | Grid map correction method and device in synchronous positioning and map construction | |
| WO2020206639A1 (en) | Target object fitting method, point cloud sensor and mobile platform |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150506 |
|
| RJ01 | Rejection of invention patent application after publication |