CN112214565B - Map visual display method, terminal equipment and storage medium - Google Patents
Map visual display method, terminal equipment and storage medium Download PDFInfo
- Publication number
- CN112214565B CN112214565B CN202011103477.4A CN202011103477A CN112214565B CN 112214565 B CN112214565 B CN 112214565B CN 202011103477 A CN202011103477 A CN 202011103477A CN 112214565 B CN112214565 B CN 112214565B
- Authority
- CN
- China
- Prior art keywords
- point
- rectangular range
- track data
- range
- displayed
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/248—Presentation of query results
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Remote Sensing (AREA)
- Computational Linguistics (AREA)
- Instructional Devices (AREA)
Abstract
The invention relates to a map visual display method, terminal equipment and a storage medium, wherein the method comprises the following steps: collecting track data sequenced according to time; acquiring initial track data and forward and direction track data thereof; taking a rectangular range formed by coordinate points of all acquired track data as a pre-display rectangular range, and calculating a rectangular range to be displayed after the nominal multiple of the rectangular range is reduced according to the pre-display rectangular range; judging whether the current rectangular range of the map control is empty, and if so, directly positioning the current rectangular range to the rectangular range to be displayed; otherwise, after the map control is zoomed and moved from the current rectangular range to the rectangular range to be displayed, the current rectangular range of the map control is updated to be the rectangular range to be displayed. The invention enters into a continuous space position clustering algorithm, and the change of the size of the window is determined according to the change of the cluster, so that the change of the window is reduced; and the sudden change of the window is effectively reduced by combining with synchronous zooming.
Description
Technical Field
The invention relates to the technical field of information, in particular to a visual map display method, terminal equipment and a storage medium.
Background
With the development of information technology, data display is no longer limited to the display mode of tables, and more data are displayed with a more cool effect by means of various graphs. The map is used for displaying the spatiotemporal information and analyzing and studying and judging the spatiotemporal information, and the map is widely applied to various analysis and studying and judging platforms and becomes a necessary visual display mode for various systems. How to realize the dynamic and stable transformation of the spatial position becomes the key of visual display.
The traditional display modes comprise the following three modes: globally, map hierarchy is fixed, window size is fixed, the maximum map range is displayed, all points are displayed in the window, and the points are moved point by point; the navigation type map is fixed in level, the window size is fixed, and contents in a certain range before and after the current position are displayed; fixed type, variable map level, variable window size, and centered enlarged display of two continuous points. The three traditional modes are independent, each mode only focuses on one point, and the whole mode and the local mode cannot be considered. Global, geomap display, because without zooming, cannot describe the clear local points, the longer the time, the more points on the map follow the line, the greater the interference generated. In the navigation mode, when the span of two points is large, only local attention can be paid, global information cannot be mastered, and even a starting point and a finishing point cannot be known. Fixed type, the association of the front and back tracks cannot be known, and the visual effect is poor due to the fact that the change of the window is large and the whole scene is relatively jumped.
Disclosure of Invention
In order to solve the above problems, the present invention provides a map visualization display method, a terminal device, and a storage medium.
The specific scheme is as follows:
a map visualization display method comprises the following steps:
s1: collecting track data sequenced according to time;
s2: acquiring track data as initial track data;
s3: sequentially and positively acquiring track data from the initial track data until any one of the following three positive conditions is met, and entering S4; the three forward conditions were: the ratio of the slope of a cluster range formed by all track data except the last track data in the obtained forward track data to the slope of a cluster range formed by all track data is larger than a ratio threshold, the number of the obtained forward track data is larger than a forward number threshold, and all forward track data are obtained completely;
s4: sequentially reversing the acquired track data from the initial track data until any one of the following three reversing conditions is met, and entering S5; the three reverse conditions were: the ratio of the slope of a cluster range formed by all track data except the last track data in the obtained reverse track data to the slope of a cluster range formed by all track data is larger than a ratio threshold, the number of the obtained reverse track data is larger than a reverse number threshold, and all the reverse track data are obtained;
s5: taking a rectangular range formed by coordinate points of the initial trajectory data and all the trajectory data obtained in the forward direction and the reverse direction as a pre-display rectangular range, and calculating a rectangular range to be displayed after the nominal multiple of the pre-display rectangular range is reduced according to the pre-display rectangular range;
s6: judging whether the current rectangular range of the map control is empty, and if so, directly positioning the current rectangular range to the rectangular range to be displayed; otherwise, after the map control is zoomed and moved from the current rectangular range to the rectangular range to be displayed, the current rectangular range of the map control is updated to be the rectangular range to be displayed.
Further, setting a track data cache queue, dividing the acquired track data into a plurality of batches, and storing the first batch of track data into the track data cache queue; and when the acquired track data is the last track data in the track data cache queue, updating the data in the track data cache queue to be the next batch of track data.
Further, if the trajectory data is represented by the coordinate points corresponding to the trajectory data, the step S3 is implemented as follows:
s31: setting the initialization setting I to 1, and setting the starting point to I0；
S32: acquisition Point Ii-1Next point of (I)iAnd calculating a starting point I0To point IiCluster range of all points in between U (I)0,…,Ii)；
S33: acquisition Point IiNext point of (I)i+1Judgment point Ii+1Whether it can fall in the clustering range U (I)0,…,Ii) If yes, setting the starting point to the point Ii+1Cluster range of all points in between U (I)0,…,Ii+1) Is from a starting point to a point IiCluster range of all points in between U (I)0,…,Ii) (ii) a Otherwise, recalculating the starting point I0To point Ii+1Cluster range of all points in between U (I)0,…,Ii+1)；
S34: judgment point Ii+1Whether the point is the last point of acquisition, if so, entering S4; otherwise, go to S35;
s35: judgment of U (I)0,…,Ii) Slope of (d) and U (I)0,…,Ii+1) If the ratio of the slopes is larger than the ratio threshold, if yes, go to S4; otherwise, go to S36;
s36: judging whether i is larger than a forward number threshold, if so, entering S4; otherwise, let i equal to i +1, return to S32.
Further, starting point I0To point IiCluster range of all points in between U (I)0,…,Ii) The calculation method comprises the following steps: taking the minimum rectangle containing all the points as a starting point I0To point IiRectangular range T (I) of all points in between0,…,Ii) A rectangular range T (I)0,…,Ii) Enlarging the clustering range U (I) according to the rated proportion0,…,Ii)。
Further, the step S4 is specifically implemented as follows:
s41: initializing and setting j to 1;
s42: acquisition Point I-j+1Last point I of-jJudgment point I-jWhether it can fall in the clustering range U (I)-j+1,…,I i+1) Inner, if yes, set point I-jTo point Ii+1Cluster range of all points in between U (I)-j,…,Ii+1) Is point I-j+1To point Ii+1Cluster range of all points in between U (I)-j+1,…,Ii+1) (ii) a Otherwise, point I is recalculated-jTo point Ii+1Cluster range of all points in between U (I)-j,…,Ii+1)；
S43: judgment point I-jWhether the first point is collected or not, if so, entering S5; otherwise, go to S44;
s44: judgment of U (I)-j+1,…,Ii+1) And U (I)-j,…,Ii+1) If the ratio of the slopes is larger than the ratio threshold, if yes, the process goes to S5; otherwise, go to S45;
s45: judging whether j is larger than a reverse number threshold value, if so, entering S5; otherwise, let j equal to j +1, return to S42.
Further, the method for zooming and moving the map control from the current rectangular range to the rectangular range to be displayed comprises the following steps:
calculating the zooming times V for converting the current rectangular range into the rectangular range to be displayed according to the rectangular range to be displayed and the current rectangular range of the map control;
judging whether the length or the width of the rectangular range to be displayed is larger than the length or the width of the current rectangular range of the map control, if so, moving the map control from the current rectangular range to the rectangular range to be displayed along a straight line formed by connecting the current rectangular range and a central point of the rectangular range to be displayed, and reducing the map control for V times in the moving process; otherwise, the map control is moved to the rectangular range to be displayed from the current rectangular range along a straight line formed by the connection of the current rectangular range and the central point of the rectangular range to be displayed, and the map control is amplified for V times in the moving process.
Further, the scaling times V are calculated as:
V＝round(La*R0/Lb)
where round () represents the rounding function, LaIndicating the length of the rectangular area to be displayed, LbRepresenting the length of the map control and R0 representing the resolution of the map control when it is within the current rectangular range.
A map visualization terminal device, comprising a processor, a memory and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the method of the embodiment of the present invention.
A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the method as described above for an embodiment of the invention.
The invention adopts the technical scheme, introduces a continuous spatial position clustering algorithm, determines the change of the size of the window according to the change of the clustering and reduces the change of the window; and the sudden change of the window is effectively reduced by combining with synchronous zooming.
Drawings
Fig. 1 is a flowchart illustrating a first embodiment of the present invention.
Detailed Description
To further illustrate the various embodiments, the invention provides the accompanying drawings. The accompanying drawings, which are incorporated in and constitute a part of this disclosure, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the embodiments. Those skilled in the art will appreciate still other possible embodiments and advantages of the present invention with reference to these figures.
The invention will now be further described with reference to the accompanying drawings and detailed description.
The first embodiment is as follows:
the embodiment of the invention provides a map visualization display method, as shown in fig. 1, the method comprises the following steps:
s1: and collecting track data sequenced according to time.
In this embodiment, in order to increase the operation speed, it is preferable to set a track data cache queue, divide the acquired track data into a plurality of batches, initially store the first batch of track data in the track data cache queue, and reload the next batch of track data after the first batch of track data is acquired.
S2: one track data is acquired as the start track data.
The coordinate point corresponding to the initial track data adopts I0As indicated, subscript 0 indicates a serial number.
The starting trace data may be any one of the trace data stored in the trace data buffer queue.
S3: sequentially and positively acquiring track data from the initial track data until any one of the following three positive conditions is met, and entering S4; the three forward conditions were: and the ratio of the slope of the cluster range formed by all the track data except the last track data in the obtained forward track data to the slope of the cluster range formed by all the track data is larger than a ratio threshold, the number of the obtained forward track data is larger than a forward number threshold, and all the forward track data are obtained.
If the trajectory data is represented by the coordinate points corresponding to the trajectory data, the step S3 is implemented as follows:
s31: setting the initialization setting I to 1, and setting the starting point to I0。
S32: acquisition Point Ii-1Next point of (I)iAnd calculating a starting point I0To point IiCluster range of all points in between U (I)0,…,Ii)。
In this embodiment, in order to avoid repeated calculation of the trajectory data of the same continuous coordinate, it is preferable to set the next point obtaining method to obtain the point I from the trajectory data buffer queuei-1The next track data of the corresponding track data is judged to be the point Ii-1If so, continuing to acquire next track data until the coordinates of the acquired track data are the same as the point Ii-1Is different, the acquired trajectory data is taken as a point Ii-1Next point of (I)i。
S33: acquisition Point IiNext point of (I)i+1Judgment point Ii+1Whether it can fall in the clustering range U (I)0,…,Ii) If yes, setting the starting point to the point Ii+1Cluster range of all points in between U (I)0,…,Ii+1) Is from a starting point to a point IiCluster range of all points in between U (I)0,…,Ii) (ii) a Otherwise, recalculating the starting point I0To point Ii+1Cluster range of all points in between U (I)0,…,Ii+1)。
S34: judgment point Ii+1Whether the point is the last point of acquisition, if so, entering S4; otherwise, the process proceeds to S35.
S35: judgment of U (I)0,…,Ii) Slope of (d) and U (I)0,…,Ii+1) If the ratio of the slopes is larger than the ratio threshold, if yes, go to S4; otherwise, the process proceeds to S36.
The slope of the cluster region is the ratio of the length of the side of the rectangle formed by the cluster region in the Y-axis direction to the length of the side in the X-axis direction.
S36: judging whether i is larger than a forward number threshold, if so, entering S4; otherwise, let i equal to i +1, return to S32.
In this embodiment, the threshold ratio is set to 5 times.
Starting point I0To point IiCluster range of all points in between U (I)0,…,Ii) The calculation method comprises the following steps: taking the minimum rectangle containing all points as a starting point I0To point IiRectangular range T (I) of all points in between0,…,Ii) A rectangular range T (I)0,…,Ii) Enlarging the clustering range U (I) according to the rated proportion0,…,Ii)。
S4: sequentially reversing the acquired track data from the initial track data until any one of the following three reversing conditions is met, and entering S5; the three reverse conditions were: and the ratio of the slope of the cluster range formed by all the track data except the last track data in the obtained reverse track data to the slope of the cluster range formed by all the track data is larger than a ratio threshold, the number of the obtained reverse track data is larger than a reverse number threshold, and all the reverse track data are obtained.
The step S4 is specifically implemented as follows:
s41: initializing and setting j to 1;
s42: acquisition Point I-j+1Last point I of-jJudgment point I-jWhether it can fall in the clustering range U (I)-j+1,…,Ii+1) Inner, if yes, set point I-jTo point Ii+1Cluster range of all points in between U (I)-j,…,Ii+1) Is point I-j+1To point Ii+1Cluster range of all points in between U (I)-j+1,…,Ii+1) (ii) a Otherwise, point I is recalculated-jTo point Ii+1Cluster range of all points in between U (I)-j,…,Ii+1)；
S43: judgment point I-jWhether it is the first point of acquisition, if it isGo to S5; otherwise, go to S44;
s44: judgment of U (I)-j+1,…,Ii+1) And U (I)-j,…,Ii+1) If the ratio of the slopes is larger than the ratio threshold, if yes, go to S5; otherwise, go to S45;
s45: judging whether j is larger than a reverse number threshold value, if so, entering S5; otherwise, let j equal to j +1, return to S42.
In this embodiment, the reverse dotting manner is set to avoid that the forward dotting reaches the forward number threshold, and if there is no reverse dot, the base map will be changed too much in the end.
S5: and taking a rectangular range formed by coordinate points of the initial track data and all the track data obtained in the forward direction and the reverse direction as a pre-display rectangular range, and calculating the rectangular range to be displayed after the nominal multiple of the pre-display rectangular range is reduced according to the pre-display rectangular range.
The range of the rated multiple in this embodiment is set to [0.2,0.5 ].
S6: judging whether the current rectangular range of the map control is empty, and if so, directly positioning the current rectangular range to the rectangular range to be displayed; otherwise, after the map control is zoomed and moved from the current rectangular range to the rectangular range to be displayed, the current rectangular range of the map control is updated to be the rectangular range to be displayed.
The method for zooming and moving the map control from the current rectangular range to the rectangular range to be displayed comprises the following steps: calculating the zooming times V for converting the current rectangular range into the rectangular range to be displayed according to the rectangular range to be displayed and the current rectangular range of the map control; judging whether the length or the width of the rectangular range to be displayed is larger than that of the current rectangular range of the map control, if so, moving the map control from the current rectangular range to the rectangular range to be displayed along a straight line formed by the connection of the current rectangular range and the central point of the rectangular range to be displayed, and reducing the map control for V times in the moving process; otherwise, the map control is moved to the rectangular range to be displayed from the current rectangular range along a straight line formed by the connection of the current rectangular range and the central point of the rectangular range to be displayed, and the map control is amplified for V times in the moving process.
The scaling times V are calculated as:
V＝round(La*R0/Lb)
where round () represents the rounding function, LaIndicating the length of the rectangular area to be displayed, LbRepresenting the length of the map control and R0 representing the resolution of the map control when it is within the current rectangular range.
The time consumed for moving between two continuous points is t, and the moving speed can be calculated according to the length between the two points and the time t. In practical application, the zoom times V are preferably controlled to be 2-4 times, so that the situation of map jitter caused by too large change is avoided.
Although the existing space-time visual display on the market can move point by point on a map, the limitation is large, and when track points are more, the whole and the part cannot be considered. The method can meet the requirement of both integral and local visual focus tracking during space-time visual display, and can support infinite track quantity theoretically by introducing a cache mechanism. Meanwhile, the display range can be automatically calculated according to the size of the map control, the map control can be automatically adapted to the map controls with different sizes, and the map level limitation is avoided. The experience of the map track data during display is greatly improved, a good effect can be achieved when the method is used for demonstration, and a better analysis idea can be provided for a user when analysis and research are carried out.
The method is realized by only using front-end JavaScript, and can be provided for all platforms developed by using JavaScript language in a plug-in mode for integration after being closed, wherein the JavaScript is the most widely used scripting language for current page display, and the method has the advantages of extremely small adaptation workload and high applicability, and can be widely applied to various space-time visual analysis and display systems and platforms.
Example two:
the invention further provides a terminal device for visualizing a map, which comprises a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the processor executes the computer program to implement the steps of the above method embodiment of the first embodiment of the invention.
Further, as an executable scheme, the map visualization display terminal device may be a desktop computer, a notebook, a palm computer, a cloud server, and other computing devices. The map visualization display terminal device can include, but is not limited to, a processor, a memory. It is understood by those skilled in the art that the above-mentioned constituent structure of the map visualization display terminal device is only an example of the map visualization display terminal device, and does not constitute a limitation on the map visualization display terminal device, and may include more or less components than the above, or combine some components, or different components, for example, the map visualization display terminal device may further include an input/output device, a network access device, a bus, and the like, which is not limited by the embodiment of the present invention.
Further, as an executable solution, the Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, a discrete hardware component, and the like. The general processor can be a microprocessor or the processor can be any conventional processor and the like, the processor is a control center of the map visualization display terminal device, and various interfaces and lines are utilized to connect various parts of the whole map visualization display terminal device.
The memory can be used for storing the computer program and/or the module, and the processor can realize various functions of the map visualization display terminal equipment by running or executing the computer program and/or the module stored in the memory and calling the data stored in the memory. The memory can mainly comprise a program storage area and a data storage area, wherein the program storage area can store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the mobile phone, and the like. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
The invention also provides a computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the steps of the above-mentioned method of an embodiment of the invention.
The map visualization display terminal device integrated module/unit may be stored in a computer readable storage medium if it is implemented in the form of a software functional unit and sold or used as a separate product. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), software distribution medium, and the like.
While the invention has been particularly shown and described with reference to a preferred embodiment, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (9)
1. A map visualization display method is characterized by comprising the following steps:
s1: collecting track data sequenced according to time;
s2: acquiring track data as initial track data;
s3: sequentially and positively acquiring track data from the initial track data until any one of the following three positive conditions is met, and entering S4; the three forward conditions were: the ratio of the slope of a cluster range formed by all track data except the last track data in the obtained forward track data to the slope of a cluster range formed by all track data is larger than a ratio threshold, the number of the obtained forward track data is larger than a forward number threshold, and all forward track data are obtained completely;
s4: sequentially reversing the acquired track data from the initial track data until any one of the following three reversing conditions is met, and entering S5; the three reverse conditions were: the ratio of the slope of the cluster range formed by all track data except the last track data in the obtained reverse track data to the slope of the cluster range formed by all track data is larger than a ratio threshold, the number of the obtained reverse track data is larger than a reverse number threshold, and all the reverse track data are obtained;
s5: taking a rectangular range formed by coordinate points of the initial trajectory data and all the trajectory data obtained in the forward direction and the reverse direction as a pre-display rectangular range, and calculating a rectangular range to be displayed after the nominal multiple of the pre-display rectangular range is reduced according to the pre-display rectangular range;
s6: judging whether the current rectangular range of the map control is empty, and if so, directly positioning the current rectangular range to the rectangular range to be displayed; otherwise, after the map control is zoomed and moved from the current rectangular range to the rectangular range to be displayed, the current rectangular range of the map control is updated to be the rectangular range to be displayed.
2. The map visualization presentation method according to claim 1, characterized in that: setting a track data cache queue, dividing the acquired track data into a plurality of batches, and storing the first batch of track data into the track data cache queue; and when the acquired track data is the last track data in the track data cache queue, updating the data in the track data cache queue to be the next batch of track data.
3. The map visualization display method according to claim 1, wherein: if the trajectory data is represented by the coordinate points corresponding to the trajectory data, the step S3 is implemented as follows:
s31: setting the initialization setting I to 1, and setting the starting point to I0；
S32: acquisition Point Ii-1Next point of (I)iAnd calculating a starting point I0To point IiCluster range of all points in between U (I)0,…,Ii)；
S33: acquisition Point IiNext point of (I)i+1Judgment point Ii+1Whether it can fall in the clustering range U (I)0,…,Ii) If yes, setting the starting point to the point Ii+1Cluster range of all points in between U (I)0,…,I i+1) Is from a starting point to a point IiCluster range of all points in between U (I)0,…,Ii) (ii) a Otherwise, recalculating the starting point I0To point Ii+1Cluster range of all points in between U (I)0,…,Ii+1)；
S34: judgment Point Ii+1Whether the point is the last point of acquisition, if so, entering S4; otherwise, go to S35;
s35: judgment of U (I)0,…,Ii) Slope of (d) and U (I)0,…,Ii+1) If the ratio of the slopes is larger than the ratio threshold, if yes, go to S4; otherwise, go to S36;
s36: judging whether i is larger than a forward number threshold, if so, entering S4; otherwise, let i equal to i +1, return to S32.
4. According to claimThe map visualization display method of claim 3, characterized in that: starting point I0To point IiCluster range of all points in between U (I)0,…,Ii) The calculation method comprises the following steps: taking the minimum rectangle containing all points as a starting point I0To point IiRectangular range T (I) of all points in between0,…,Ii) A rectangular range T (I)0,…,Ii) Enlarging the clustering range U (I) according to the rated proportion0,…,Ii)。
5. The map visualization display method according to claim 3, wherein: the step S4 is specifically implemented as follows:
s41: initializing and setting j to 1;
s42: acquisition Point I-j+1Last point I of-jJudgment point I-jWhether it can fall in the clustering range U (I)-j+1,…,Ii+1) Inner, if yes, set point I-jTo point Ii+1Cluster range of all points in between U (I)-j,…,Ii+1) Is point I-j+1To point Ii+1Cluster range of all points in between U (I)-j+1,…,Ii+1) (ii) a Otherwise, point I is recalculated-jTo point Ii+1Cluster range of all points in between U (I)-j,…,Ii+1)；
S43: judgment Point I-jWhether the first point is acquired or not, and if so, entering S5; otherwise, go to S44;
s44: judgment of U (I)-j+1,…,Ii+1) And U (I)-j,…,Ii+1) If the ratio of the slopes is larger than the ratio threshold, if yes, go to S5; otherwise, go to S45;
s45: judging whether j is larger than a reverse number threshold value, if so, entering S5; otherwise, let j equal to j +1, return to S42.
6. The map visualization display method according to claim 1, wherein: the method for zooming and moving the map control from the current rectangular range to the rectangular range to be displayed comprises the following steps:
calculating the zooming times V for converting the current rectangular range into the rectangular range to be displayed according to the rectangular range to be displayed and the current rectangular range of the map control;
judging whether the length or the width of the rectangular range to be displayed is larger than that of the current rectangular range of the map control, if so, moving the map control from the current rectangular range to the rectangular range to be displayed along a straight line formed by the connection of the current rectangular range and the central point of the rectangular range to be displayed, and reducing the map control for V times in the moving process; otherwise, the map control is moved to the rectangular range to be displayed from the current rectangular range along a straight line formed by the connection of the current rectangular range and the central point of the rectangular range to be displayed, and the map control is amplified for V times in the moving process.
7. The map visualization display method according to claim 6, wherein: the scaling times V are calculated as:
V＝round(La*R0/Lb)
where round () represents the rounding function, LaIndicating the length of the rectangular area to be displayed, LbRepresenting the length of the map control and R0 representing the resolution of the map control when it is within the current rectangular range.
8. The map visual display terminal equipment is characterized in that: comprising a processor, a memory and a computer program stored in said memory and running on said processor, said processor implementing the steps of the method according to any one of claims 1 to 7 when executing said computer program.
9. A computer-readable storage medium storing a computer program, the computer program characterized in that: the computer program when executed by a processor implementing the steps of the method as claimed in any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011103477.4A CN112214565B (en) | 2020-10-15 | 2020-10-15 | Map visual display method, terminal equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011103477.4A CN112214565B (en) | 2020-10-15 | 2020-10-15 | Map visual display method, terminal equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112214565A CN112214565A (en) | 2021-01-12 |
| CN112214565B true CN112214565B (en) | 2022-06-21 |
Family
ID=74054635
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011103477.4A Active CN112214565B (en) | 2020-10-15 | 2020-10-15 | Map visual display method, terminal equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112214565B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622198A (en) * | 2012-02-29 | 2012-08-01 | 中山大学 | Method and system for visualizing data |
| CN103475729A (en) * | 2013-09-18 | 2013-12-25 | 南京载玄信息科技有限公司 | Locus characteristic point extracting method applied to internet of things |
| CN104915088A (en) * | 2014-03-10 | 2015-09-16 | 联想(北京)有限公司 | Information processing method and electronic equipment |
| CN111008260A (en) * | 2019-12-20 | 2020-04-14 | 山东省国土测绘院 | Trajectory visualization method, apparatus, device and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150095843A1 (en) * | 2013-09-27 | 2015-04-02 | Microsoft Corporation | Single-hand Interaction for Pan and Zoom |
-
2020
- 2020-10-15 CN CN202011103477.4A patent/CN112214565B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102622198A (en) * | 2012-02-29 | 2012-08-01 | 中山大学 | Method and system for visualizing data |
| CN103475729A (en) * | 2013-09-18 | 2013-12-25 | 南京载玄信息科技有限公司 | Locus characteristic point extracting method applied to internet of things |
| CN104915088A (en) * | 2014-03-10 | 2015-09-16 | 联想(北京)有限公司 | Information processing method and electronic equipment |
| CN111008260A (en) * | 2019-12-20 | 2020-04-14 | 山东省国土测绘院 | Trajectory visualization method, apparatus, device and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 轨迹数据可视分析研究;王祖超，袁晓如;《计算机辅助设计与图形学学报》;20150131;第27卷(第1期);第9-22页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112214565A (en) | 2021-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020220968A1 (en) | Video data processing method and related device | |
| RU2613038C2 (en) | Method for controlling terminal device with use of gesture, and device | |
| DE112013002803B4 (en) | Method, system and device for providing a three-dimensional transition animation for a change in a map view | |
| US11481908B2 (en) | Data processing method and computing device | |
| CN109583509B (en) | Data generation method and device and electronic equipment | |
| MX2012012420A (en) | Temporary formatting and charting of selected data. | |
| US20180046351A1 (en) | Controlling display object on display screen | |
| US20140152702A1 (en) | Image display device, image display method, image display program, and computer-readable recording medium whereon program is recorded | |
| US20240046025A1 (en) | Table displaying method, device and medium | |
| CN113741753A (en) | Revocation method, electronic device, storage medium, and computer program product | |
| US8630490B2 (en) | Selecting representative images for display | |
| CN110779515A (en) | Display method and device of electronic navigation map, electronic equipment and storage medium | |
| CN112214565B (en) | Map visual display method, terminal equipment and storage medium | |
| CN115878935B (en) | Method, system, device, equipment and medium for partial refreshing of chart | |
| CN109800039B (en) | User interface display method and device, electronic equipment and storage medium | |
| KR101820657B1 (en) | System and Method for Auto-Scrolling Webtoon Screen Image | |
| CN107977923A (en) | Image processing method, device, electronic equipment and computer-readable recording medium | |
| CN109739403B (en) | Method and apparatus for processing information | |
| CN114491309A (en) | Picture processing method and device | |
| JP2000148126A (en) | Image display device and method | |
| CN111753113A (en) | Picture browsing method and device | |
| US20220358624A1 (en) | Writing Trajectory Processing Method, Touch Control Device, Writing System and Storage Medium | |
| CN112672197B (en) | Animation display method and device and terminal equipment | |
| CN114327208B (en) | Legend display method and device, storage medium and terminal | |
| CN117152252A (en) | Distance measurement method, device, equipment and medium for medical image |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |