CN104616332A - Fast display method - Google Patents
Fast display method Download PDFInfo
- Publication number
- CN104616332A CN104616332A CN201510028811.7A CN201510028811A CN104616332A CN 104616332 A CN104616332 A CN 104616332A CN 201510028811 A CN201510028811 A CN 201510028811A CN 104616332 A CN104616332 A CN 104616332A
- Authority
- CN
- China
- Prior art keywords
- coordinate data
- data
- axis pixel
- coordinate
- minimum value
- 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
Abstract
The invention discloses a fast display method; the method comprises the following steps: collecting signal data and converting the signal data into coordinate data; calculating out all coordinate data corresponding to each X-axis pixel, judging the coordinate data in each X-axis pixel is greater than or equal to 6; recording the first coordinate data and the last coordinate data on each X-axis pixel, searching for the maximum value and the minimum value from the rest coordinate data on each X-axis pixel, grouping the first coordinate data, the last coordinate data, the maximum value and the minimum value into a new group of coordinate data; using the new coordinate data for drawing a line which is to be displayed. The data to be drawn of each pixel point is changed into 4 pieces of data by the fast display, thus greatly reducing the data amount, and saving the time for drawing the line.
Description
Technical field
The invention belongs to signal measurement field, specifically, relate to a kind of fast display method.
Background technology
In signal measurement field, figure display is an indispensable part, because for huge data volume, want from simple numeral, find out that signal change procedure and trend are quite difficult, so need being presented on screen after signal-data processing, the mode shown by curve checks process and the trend of signal intensity, very clear.The operating system of WINCE can change into screen coordinate corresponding for each signal data, then the Polyline function of the screen coordinate transformed by VC++ is presented on screen.
If when measurement data is few, screen display speed still can accept, if but during data volume super large, need all data to convert screen coordinate to, then be presented on screen with Polyline function, speed will become slowly, especially be 400Mhz in CPU frequency, internal memory 1G, under the hardware resource condition that hard disk 1G etc. are limited, has seriously dragged slowly the travelling speed of system.
In prior art, data acquisition module can be sampled to current signal, afterwards the data of signal sampling are given to data memory module to store, then calling data processing module, all sampled datas are carried out the screen coordinate that coordinate conversion becomes display module to need, and data disaply moudle is shown to the coordinate data changed on screen afterwards.Due to data volume super large, hardware computing resource is limited, so cause occurring a lot of problem when display data and curves, as cpu busy percentage is too high, system is dragged slowly, low memory program crashing etc.
Summary of the invention
The object of the invention is to overcome above-mentioned deficiency, provide a kind of fast display method, comprise the following steps,
Collection signal data, are converted to coordinate data;
Count the whole coordinate datas corresponding to each X-axis pixel, judge that the coordinate data in each X-axis pixel is more than or equal to 6;
Record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data;
Utilize described new coordinate data setting-out, show.
Preferably, described fast display method also comprises step: count the whole coordinate datas corresponding to each X-axis pixel, judges that the coordinate data in each X-axis pixel is less than 6, directly by this coordinate data setting-out, shows.
Preferably, describedly record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data, be further
Record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described maximal value and minimum value are in the coordinate data in each X-axis pixel further, horizontal ordinate is equal, the coordinate data that the maximum and ordinate of ordinate is minimum, forms one group of new coordinate data by described first coordinate data, last coordinate data, maximal value and minimum value.
Preferably, describedly utilize described new coordinate data setting-out, show, be further,
Adopt Polyline function to utilize described new coordinate data setting-out, show.
Preferably, described Polyline function, be BOOL CDC::Polyline (const POINT*lpPoints, int nCount), wherein lpPoints is coordinate data, and nCount is data amount check.
Compared with prior art, fast display method of the present invention, has following beneficial effect:
Save the time, want the coordinate data of setting-out to be converted into 4 coordinate datas each X-axis pixel by quick display of the present invention, greatly reduce data volume, save the setting-out time.
Accompanying drawing explanation
Accompanying drawing described herein is used to provide further understanding of the present application, and form a application's part, the schematic description and description of the application, for explaining the application, does not form the improper restriction to the application.In the accompanying drawings:
Fig. 1 is the structural drawing showing data in prior art;
Fig. 2 is the process flow diagram of fast display method of the present invention;
Fig. 3 is the display effect figure of embodiment 2.
Embodiment
As employed some vocabulary to censure specific components in the middle of instructions and claim.Those skilled in the art should understand, and hardware manufacturer may call same assembly with different noun.This specification and claims are not used as with the difference of title the mode distinguishing assembly, but are used as the criterion of differentiation with assembly difference functionally." comprising " as mentioned in the middle of instructions and claim is in the whole text an open language, therefore should be construed to " comprise but be not limited to "." roughly " refer to that in receivable error range, those skilled in the art can solve the technical problem within the scope of certain error, reach described technique effect substantially.Instructions subsequent descriptions is implement the better embodiment of the application, and right described description is for the purpose of the rule that the application is described, and is not used to the scope limiting the application.The protection domain of the application is when being as the criterion depending on the claims person of defining.
Embodiment 1
Composition graphs 2, present embodiments provides a kind of fast display method, comprises the following steps:
Step 1) collection signal data, be converted to coordinate data;
Step 2) count whole coordinate datas corresponding to each X-axis pixel, judge that the coordinate data in each X-axis pixel is more than or equal to 6;
Step 3) record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data;
Step 4) utilize described new coordinate data setting-out, show.
Preferably, described fast display method also comprises step: count the whole coordinate datas corresponding to each X-axis pixel, judges that the coordinate data in each X-axis pixel is less than 6, directly by this coordinate data setting-out, shows.
Preferably, describedly record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data, be further
Record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described maximal value and minimum value are in the coordinate data in each X-axis pixel further, horizontal ordinate is equal, the coordinate data that the maximum and ordinate of ordinate is minimum, forms one group of new coordinate data by described first coordinate data, last coordinate data, maximal value and minimum value.
Preferably, describedly utilize described new coordinate data setting-out, show, be further,
Adopt Polyline function to utilize described new coordinate data setting-out, show.Namely setting-out described here is by coordinate data line,
Preferably, described Polyline function, be BOOL CDC::Polyline (const POINT*lpPoints, int nCount), wherein lpPoints is coordinate data, and nCount is data amount check.
It should be noted that the present invention only shows this part to data processing and data and is optimized, and data acquisition and data storage all adopt method of the prior art to realize, and are not specifically limited here.
Embodiment 2
Composition graphs 2, present embodiments provides a kind of fast display method, comprises the following steps:
Step 1) collection signal data, be converted to coordinate data;
Step 2) count whole coordinate datas corresponding to each X-axis pixel, judge that the coordinate data in each X-axis pixel is less than 6, directly by this coordinate data setting-out, show.
Step 3) count whole coordinate datas corresponding to each X-axis pixel, judge that the coordinate data in each X-axis pixel is more than or equal to 6;
Step 4) record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data;
Step 5) utilize described new coordinate data setting-out, show.
Preferably, describedly record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data, be further
Record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described maximal value and minimum value are in the coordinate data in each X-axis pixel further, horizontal ordinate is equal, the coordinate data that the maximum and ordinate of ordinate is minimum, forms one group of new coordinate data by described first coordinate data, last coordinate data, maximal value and minimum value.
Preferably, describedly utilize described new coordinate data setting-out, show, be further,
Adopt Polyline function to utilize described new coordinate data setting-out, show.
Preferably, described Polyline function, be BOOL CDC::Polyline (const POINT*lpPoints, int nCount), wherein lpPoints is coordinate data, and nCount is data amount check.
Embodiment 3:
On the basis of embodiment 1, the Application Example that the present embodiment provides.
Because Polyline function consumes cpu resource and memory source when big data quantity very much, so the suitable data volume handled by minimizing Polyline, to minimizing consume system resources clearly.
Because embedded system screen size is limited, can be also very little for picture curved portion, if the instrument screen size in the present embodiment is 640*480 pixel, picture curved portion size is 500*300 pixel, take X-axis as benchmark, if have 100000 data current, want to be presented at completely in 500 pixels, each pixel needs coincidence 200 data.Because screen curve only shows trend, do not represent real data, so the present invention is handled as follows coordinate data:
1) the data point number each X-axis pixel needing show is calculated;
2) first data and last data of the data shown on this X-axis pixel are found out, to ensure the relevance of this X-axis pixel and previous X-axis pixel and a rear X-axis pixel;
3) between first data and last data, maximal value and minimum value is searched, to ensure the correctness of Y-axis data on this X-axis pixel.Maximal value and minimum value are that in the coordinate data in each X-axis pixel, horizontal ordinate is equal further, the coordinate data that ordinate is maximum and ordinate is minimum.
4) first data, maximal value, minimum value, these four data of last data are reformulated one group of coordinate data,
In X-axis, no matter there are how many data can be processed into 500 × 4=2000 data volume like this.Then call Polyline function to be presented on screen.
Below illustrate:
With 6 groups of data instances
(1，9)，(1，8)，(1，1)，(1，8)，(1，8)，(1，1)
(2，4)，(2，4)，(2，7)，(2，7)，(2，7)，(2，5)
(3，6)，(3，6)，(3，6)，(3，6)，(3，5)，(3，6)
(4，5)，(4，5)，(4，5)，(4，5)，(4，5)，(4，5)
(5，5)，(5，1)，(5，1)，(5，1)，(5，1)，(5，5)
(6，5)，(6，10)，(6，8)，(6，8)，(6，8)，(6，5)
These 6 groups of data trace on screen pixels, after amplification as shown in Figure 3.
Following new coordinate data is processed data into according to method of the present invention:
(1，9)，(1，8)，(1，1)，(1，1)
(2，4)，(2，4)，(2，7)，(2，5)
(3，6)，(3，6)，(3，5)，(3，6)
(4，5)，(4，5)，(4，5)，(4，5)
(5，5)，(5，1)，(5，1)，(5，5)
(6，5)，(6，10)，(6，8)，(6，5)
Setting-out after new coordinate data process, with as Fig. 3.Because first of each pixel data and last data do not become, search a maximal value and a minimum value therebetween, institute's trace is the same completely.Visual effect too, but desired data amount has been lacked.
With 1000000 data instances, the method setting-out required time of prior art is 233ms, if use data processing method of the present invention, because coordinate data is integer data, maximal value is searched in the contrast doing 1000000 times and minimum value needs the less time comparatively speaking, and it is 99ms that the processing time adds the setting-out time.Can see that the data processing method made new advances can save a large amount of time, and data volume is larger, new algorithm more saves time.
Compared with prior art, fast display method of the present invention, has following beneficial effect:
Save time, be 4 data by quick display of the present invention the data transformations that each pixel will be drawn, greatly reduce data volume, save the setting-out time.
Above-mentioned explanation illustrate and describes some preferred embodiments of the application, but as previously mentioned, be to be understood that the application is not limited to the form disclosed by this paper, should not regard the eliminating to other embodiments as, and can be used for other combinations various, amendment and environment, and can in application contemplated scope described herein, changed by the technology of above-mentioned instruction or association area or knowledge.And the change that those skilled in the art carry out and change do not depart from the spirit and scope of the application, then all should in the protection domain of the application's claims.
Claims (5)
1. a fast display method, is characterized in that, comprises the following steps,
Collection signal data, are converted to coordinate data;
Count the whole coordinate datas corresponding to each X-axis pixel, judge that the coordinate data in each X-axis pixel is more than or equal to 6;
Record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data;
Utilize described new coordinate data setting-out, show.
2. fast display method according to claim 1, it is characterized in that, described fast display method also comprises step: count the whole coordinate datas corresponding to each X-axis pixel, judges that the coordinate data in each X-axis pixel is less than 6, directly by this coordinate data setting-out, show.
3. fast display method according to claim 1, it is characterized in that, describedly record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described first coordinate data, last coordinate data, maximal value and minimum value are formed one group of new coordinate data, be further
Record first coordinate data in each X-axis pixel and last coordinate data, search the maximal value in each X-axis pixel in all the other coordinate datas and minimum value, described maximal value and minimum value are in the coordinate data in each X-axis pixel further, horizontal ordinate is equal, the coordinate data that the maximum and ordinate of ordinate is minimum, forms one group of new coordinate data by described first coordinate data, last coordinate data, maximal value and minimum value.
4. fast display method according to claim 3, is characterized in that, describedly utilizes described new coordinate data setting-out, shows, is further,
Adopt Polyline function to utilize described new coordinate data setting-out, show.
5. fast display method according to claim 4, is characterized in that, described Polyline function, for BOOL CDC::Polyline (const POINT*lpPoints, int nCount), wherein lpPoints is coordinate data, and nCount is data amount check.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510028811.7A CN104616332A (en) | 2015-01-20 | 2015-01-20 | Fast display method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510028811.7A CN104616332A (en) | 2015-01-20 | 2015-01-20 | Fast display method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104616332A true CN104616332A (en) | 2015-05-13 |
Family
ID=53150765
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510028811.7A Pending CN104616332A (en) | 2015-01-20 | 2015-01-20 | Fast display method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104616332A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105928551A (en) * | 2016-05-12 | 2016-09-07 | 中国电子科技集团公司第四十研究所 | View refreshing method and system of microwave millimeter wave comprehensive measuring instrument |
| CN110597697A (en) * | 2019-09-24 | 2019-12-20 | 武汉恒力华振科技有限公司 | High-frequency time sequence data real-time sparse display method based on pixel number |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5438655A (en) * | 1993-07-29 | 1995-08-01 | Hewlett-Packard Company | Methods and apparatus for updating and antialiasing waveforms |
| CN101982820A (en) * | 2010-11-22 | 2011-03-02 | 北京航空航天大学 | Curve display and inquiry method for large data quantity |
| CN102200880A (en) * | 2010-03-25 | 2011-09-28 | 卡西欧计算机株式会社 | Graph display apparatus and graph display method |
| CN102360287A (en) * | 2011-09-28 | 2012-02-22 | 中国航天科工集团第四研究院第四总体设计部 | Curve plotting method used for high-speed real-time emulation |
-
2015
- 2015-01-20 CN CN201510028811.7A patent/CN104616332A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5438655A (en) * | 1993-07-29 | 1995-08-01 | Hewlett-Packard Company | Methods and apparatus for updating and antialiasing waveforms |
| CN102200880A (en) * | 2010-03-25 | 2011-09-28 | 卡西欧计算机株式会社 | Graph display apparatus and graph display method |
| CN101982820A (en) * | 2010-11-22 | 2011-03-02 | 北京航空航天大学 | Curve display and inquiry method for large data quantity |
| CN102360287A (en) * | 2011-09-28 | 2012-02-22 | 中国航天科工集团第四研究院第四总体设计部 | Curve plotting method used for high-speed real-time emulation |
Non-Patent Citations (3)
| Title |
|---|
| O303028708: "mfc如何快速的绘制大量的点？例如：大于1000000个点", 《HTTP://BBS.CSDN.NET/TOPICS/390800263》 * |
| RICHARD C.LEINECKER: "《Visual C++开发人员参考手册》", 30 June 1989 * |
| 郭晓冰: "基于VB的数字波形高速显示设计", 《宿州师专学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105928551A (en) * | 2016-05-12 | 2016-09-07 | 中国电子科技集团公司第四十研究所 | View refreshing method and system of microwave millimeter wave comprehensive measuring instrument |
| CN110597697A (en) * | 2019-09-24 | 2019-12-20 | 武汉恒力华振科技有限公司 | High-frequency time sequence data real-time sparse display method based on pixel number |
| CN110597697B (en) * | 2019-09-24 | 2023-06-02 | 武汉恒力华振科技有限公司 | High-frequency time sequence data real-time sparse display method based on pixel number |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108008948B (en) | Multiplexing device, multiplexing method and processing device for instruction generation process | |
| KR101617696B1 (en) | Method and device for mining data regular expression | |
| CN102436438B (en) | Sparse matrix data storage method based on ground power unit (GPU) | |
| CN104965873A (en) | Paging inquiring method and apparatus | |
| CN103559017A (en) | Character string matching method and system based on graphic processing unit (GPU) heterogeneous computing platform | |
| CN115150471B (en) | Data processing method, apparatus, device, storage medium, and program product | |
| CN104574461A (en) | Graph modeling method and device | |
| CN106874394A (en) | A kind of method and apparatus of file packing pretreatment | |
| CN104616332A (en) | Fast display method | |
| CN103678359B (en) | A kind of integrated circuit waveforms image fast display method | |
| CN106354731A (en) | Document inspection method and device | |
| CN114298985A (en) | Defect detection method, device, equipment and storage medium | |
| CN106683033B (en) | Out-of-order OpenGL interface processing method | |
| CN104376578A (en) | Moving object detection processing method and device applied to direct recording and broadcasting system | |
| JP2008152619A (en) | Data processor and data processing program | |
| CN108959237B (en) | Text classification method, device, medium and equipment | |
| CN105512237A (en) | Data introduction system with complex structure | |
| CN105573984A (en) | Socio-economic indicator identification method and device | |
| CN104050079A (en) | Real-time system testing method based on time automata | |
| WO2020232979A1 (en) | Method for quickly extracting outer boundary of triangular network | |
| CN105224697A (en) | Sort method with filtercondition and the device for performing described method | |
| CN111598185B (en) | Training data balancing method, device and system based on deep learning | |
| CN111639658B (en) | Method and device for detecting and eliminating dynamic feature points in image matching | |
| CN113901094B (en) | Data processing method, device, equipment and storage medium | |
| CN115454983B (en) | Massive Hbase data deduplication method based on bloom filter |
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: 20150513 |
|
| RJ01 | Rejection of invention patent application after publication |