CN1266582C - Large-view blocking and buffering display method - Google Patents

Large-view blocking and buffering display method Download PDF

Info

Publication number
CN1266582C
CN1266582C CN 01112850 CN01112850A CN1266582C CN 1266582 C CN1266582 C CN 1266582C CN 01112850 CN01112850 CN 01112850 CN 01112850 A CN01112850 A CN 01112850A CN 1266582 C CN1266582 C CN 1266582C
Authority
CN
China
Prior art keywords
row
viewing area
view
buf
buffer zone
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.)
Expired - Fee Related
Application number
CN 01112850
Other languages
Chinese (zh)
Other versions
CN1384427A (en
Inventor
李伽
黄晓军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Haimen science and Technology Development General Corporation
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CN 01112850 priority Critical patent/CN1266582C/en
Publication of CN1384427A publication Critical patent/CN1384427A/en
Application granted granted Critical
Publication of CN1266582C publication Critical patent/CN1266582C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Controls And Circuits For Display Device (AREA)

Abstract

The present invention relates to a large-viewgraph buffering display method in blocks. A large viewgraph is divided into blocks; in a memory, a buffer zone matrix with a definite size is used for mapping each block of the viewgraph; one viewgraph block to be displayed next is predicted in the display and dragging process by a background thread, and the viewgraph block is submitted to an appropriate buffering chunk. Because two threads are submitted by foreground display and background predication simultaneously, the time slice of a task in a CPU is rationally allocated; the refreshing speed at the time of display and dragging is improved; the time waste of the system memory and the CPU is reduced. In the design of a network plan proposal, the method is widely applied, for example, the speed of displaying and loading is quick for a provincial map with 9714*11854 pixel, a screen does not flicker and shake when the provincial map is towed, and the transition is smooth.

Description

Large-view blocking and buffering display method
The present invention relates to computer image processing technology, particularly electronic chart class large-view blocking prediction buffering display method.
In planning of city planning, communication network and geomorphological remote sensing mapping, usually need to show that the numerical map of current planning region or relevant background image are as analyzing reference.When planning that compares big or super large planning region and optimization analysis, the image that show can be very big, and the size of image can reach 100M byte even bigger.If image is all read in internal memory, nature can show or drag very easily, but can cause so big system resource waste, plans that necessary a large amount of evaluation work carries out very slowly and make, even can't carry out.Particularly when the network planning and optimization, often to a plurality of designs of a plurality of engineerings or same engineering be analyzed, and open a plurality of views simultaneously, like this, just the hardware resource to system has proposed more harsh requirement, and it is unpractical doing like this, also is impossible at all.
At present, not seeing any disclosed technology as yet can head it off, through patent retrieval, also not have the patent documentation of discovery at this problem.
The object of the present invention is to provide a kind of in the network planning and optimization system, the employing computing machine is to large-view blocking and utilize buffer zone matrix prediction display packing, to reduce to greatest extent, improve the efficient of Computer Processing and demonstration as much as possible to the taking of system's precious resources.
The large-view blocking and buffering display method that the present invention proposes mainly may further comprise the steps:
A, will need the image Pic that shows from left to right, be divided into equal-sized view piece by ranks from top to bottom, to described view block number, height of view piece (BlockHeight) and width (BlockWidth) are greater than the height and the width of display viewing area in order;
B, create one 3 * 3 view buffer zone matrix in calculator memory, its height (BufferHeight) is consistent with width (BlockWidth) with the height (BlockHeight) of width (BufferWidht) and described view piece, and it is numbered;
C, establishment are used to show and refresh the main thread of view; Create with the main thread parallel running from thread, this thread carries out initialization according to the information of current buffer zone matrix and view piecemeal;
D, when all or part of of viewing area also in the visible display buffer at the buffer zone matrix, then show it;
If cross the border in arbitrary border in any of four borders of viewing area and 3 * 3 buffer zones, from the prediction of thread at the enterprising row buffer of timeslice of CPU free time, the piece of attempting that will show among the image Pic is filled in the prediction buffering (promptly submitting process to), and judge whether to carry out the buffer zone switching, adjust the position relation of buffer zone matrix;
Under e, certain state after move the viewing area, the view piece of having predicted according to the front that is equipped with a buffer zone correspondence, the image of the intersection of each buffer blocks of calculating the viewing area and intersecting with it, it is taken out amalgamation becomes the image that should show in the viewing area, is presented on the screen then.
The present invention proposes a kind of new method that large-view blocking and buffering shows, it is with the whole graftabls of whole big view, but view is carried out piecemeal, in internal memory with the buffer zone of a prescribed level tabulate (or matrix) come each piece in the map view.And utilize background thread, next step view piece that will show of prediction and it is submitted in the suitable buffer blocks in the process that shows and drag.Like this, in the process that shows, as long as the display buffer of appointment is shown, and display buffer in the view piece mapping and the switching between the display buffer all in background thread, finish.Because the foreground shows and the prediction on backstage submits to two threads to carry out simultaneously, has reasonably distributed the timeslice of task in CPU, the speed that has improved demonstration and refreshed when dragging has also reduced the waste to Installed System Memory and CPU time.
In network planning conceptual design, adopted this method.Very fast as its demonstration rate of loading ratio of provincial map for 9714 * 11854 pixels, screen flicker and shake do not appear when dragging yet, and transition is very level and smooth.As seen this method has broken through demonstration substantially and has refreshed the bottleneck that is subjected to the serious restriction of view size.
Description of drawings of the present invention is as follows:
Fig. 1 is big view display frame figure of the present invention;
Fig. 2 is the Pic image synoptic diagram after handling through piecemeal and numbering;
Fig. 3 is the buffer zone matrix synoptic diagram behind the piecemeal;
Fig. 4 looks piece piecemeal, buffer zone and screen display graph of a relation during for initialization;
Fig. 5 is the position view of buffer zone matrix in the view piecemeal;
Fig. 6 is the position view of buffer zone matrix in the view piecemeal after moving;
Fig. 7 is the class graph of a relation of view display part;
Fig. 8 is the location diagram of display window in view buffer zone matrix;
Fig. 9 is view buffer zone matrix and the location diagram of display window in big view;
Graph of a relation when Figure 10 is display window and the switching of buffer zone matrix occurrence positions;
Figure 11 example-initial position;
Switch Figure 12 example-move to left, position, the buffer zone prediction;
Switch Figure 13 example-move to left, position;
Switch Figure 14 example-move to left, position, the buffer zone prediction.
Further specify with the Application Example of this method in the network planning and Optimization Software below.
View background major part is a dot matrix, if disposable in program the dot matrix background is all packed into, then the size of dot array data has determined the size in program committed memory space, if the dot matrix background is 10,000 * 10,000 point, each is put with 1 byte representation, then need the memory headroom of 100M to deposit these dot array datas at least, obviously this is the huge waste to memory headroom.The size of the particular geographic area of the size of the handled view background of computer system and engineering design is relevant in practice.Map size as a regional engineering can be 1074 * 1046, and is not very too big.The electronic chart of a provincial engineering then is 9714 * 11854, and this map is very big, and it is unpractical all reading in the internal memory processing.Therefore the method that adopts the blocking and buffering prediction to show in the present embodiment realizes the demonstration to big view.
As shown in Figure 1, this method is divided into the background data of big view by row, column ordering numerous little attempts piece, and each is attempted block size and equates (except the borderline region), in order to described view block number.It mainly is to be convenient to location, loading that viewdata is divided into numerous lab scale segments.Height of view piece (BlockHeight) and width (BlockWidth) are greater than the height and the width of display viewing area, the height of view piece is 1~2 times of height of display viewing area among the embodiment, and the width of view piece is 1~2 times of width of display viewing area.
Height and the width of supposing the display viewing area are 768 * 1024,768 * 2>BlockHeight>768,1024 * 2>BlockWidth>1024 then, and the image behind the piecemeal is as shown in Figure 2.
In internal memory, create one 3 * 3 view buffer zone matrix.Its height (BufferHeight) is consistent with width (BlockWidth) with the height (BlockHeight) of width (BufferWidht) and described view piece.Equally it is numbered.Buffer zone matrix behind the piecemeal as shown in Figure 3.
View buffer zone matrix is divided into visible display buffer and prediction buffering to be shown, the former be used to cushion current visibility region with and near the zone that will show, the latter is used to store the zone that shows possibly of being predicted according to current visibility region position.In the process of user's browse view, the display buffer that program is used according to the current needs of current visibility region position judgment on the one hand, therefrom obtain the data presentation view, on the other hand then will the viewing area according to current visibility region position prediction, and by background thread dot array data is loaded in the prediction display buffer.Can significantly reduce the demand of display background dot matrix by this when needed just with the mode of dot array data graftabl, the demand of internal memory is depended on the display buffer size internal memory.
In the implementation process, need master and slave two thread parallels operation.Main thread is used for showing and refresh view that main thread can not created and replaced by the master routine thread.And be when the image the viewing area is not in the current effective buffer blocks from thread, carry out the buffer zone prediction and switch.From the prediction and calculation of thread, and piece corresponding among the image Pic is filled in the invalid buffer zone goes (promptly submitting process to) at the enterprising row buffer of timeslice of CPU free time.According to the information of view piecemeal and the information of buffer zone, 3 * 3 pieces in the upper left corner in the view piecemeal are filled the buffer zone object.The viewing area is dropped among the Buf1 at this moment, so the image of intersection takes out among viewing area and the Buf1, and is presented on the screen.Auspiciously see shown in Figure 4ly, its left side is the buffer zone situation, and its medium and small black patch is the display viewing area, and the right is a view piecemeal situation.
Buffer zone prediction and submission are the important ingredients of this method.State when crossing over buffer zone border when mobile according to on-screen display (osd) area in buffer zone and position concern effective status and the corresponding image of predicting and judging each piece in the buffer zone matrix.The prediction of buffer zone matrix, switching principle and demonstration principle are as follows:
Show principle: in buffer zone prediction and the process submitted to, as long as all or part of of viewing area also in the Buf1 of buffer zone matrix piece, just can show.When if the viewing area all falls into except that other pieces of Buf1 piece, just must predict by advanced row buffer, and switch buffer zone.When waiting this viewing area to be arranged in the Buf1 of buffer zone matrix of new adjustment, just can show.As shown in Figure 5 and Figure 6.
This demonstration principle not only solved when initial the demonstration, and the viewing area generally all is the problem that drops among the Buf1, and when viewing area left or when moving up, had reduced the number of times of judgement.This principle is a condition precedent of this method, must satisfy.
Under situation shown in Figure 5, the viewing area can show in the Buf1 of buffer zone piece this moment, the position of black surround region representation buffer zone matrix in the view piecemeal, Fig. 5 the right.If the viewing area moves to the position of Buf2 in the original buffer zone matrix, can not show the content at intersection location place this moment, and the buffer zone matrix will be moved in the view piecemeal of correspondence.As shown in Figure 6, on this reposition, make the viewing area fall into the Buf1 piece of buffer zone matrix, the position of buffer zone matrix in the view piecemeal after Fig. 6 the right black surround region representation moves, buffer location is represented on the left side.
Buffer zone matrix prediction and switching principle:, will predict to corresponding buffer blocks as long as cross the border in arbitrary border in any of four borders of viewing area and 3 * 3 buffer zones.So that new content is filled into buffer zone.And judge whether to carry out the buffer zone switching, adjust the position relation of buffer zone matrix.
Suppose to represent the row of view piece in the view partitioned matrix number of Buf n correspondence and be listed as number with row [Buf n] and row [Buf n].And under the initial situation, the viewing area is arranged in Buf1.When moving according to the viewing area, the situation of crossing the border on its four borders and each border of buffer zone matrix divides following several types to describe the prediction and the switching of buffer zone in detail.
(1) viewing area moves to right, and according to judging, gives from the thread photos and sending messages, predicts respectively and switches:
1.1 the right margin of viewing area crosses the border
The row [Buf 1], the row [Buf 2], the row [Buf 3], the row [Buf 4], the row [Buf 5],
The row [Buf 6], the row [Buf 7], the row [Buf 8], the row [Buf 9] all constant
Row [Buf 1], row [Buf 2], row [Buf 4], row [Buf 5], row [Buf 7],
Row [Buf 8] are constant,
Row [Buf 3]=row [Buf 2]+1
Row [Buf 6]=row [Buf 5]+1
Row [Buf 9]=row [Buf 8]+1;
1.2 the left margin of viewing area crosses the border, one unit will move right buffer zone this moment.And Far Left in the original buffer zone matrix one row are put into rightmost one row of new buffer zone matrix.Thereby make current display area be arranged in the Buf1 piece of new buffer zone matrix,
The row [Buf 1], the row [Buf 2], the row [Buf 3], the row [Buf 4], the row [Buf 5],
The row [Buf 6], the row [Buf 7], the row [Buf 8], the row [Buf 9] all constant,
Row [Buf 1]=row [Buf 2], row [Buf 2]=row [Buf 3], row [Buf 3]=row [Buf 1],
Row [Buf 4]=row [Buf 5], row [Buf 5]=row [Buf 6], row [Buf 6]=row [Buf 3],
Row [Buf 7]=row [Buf 8], row [Buf 8]=row [Buf 9], row [Buf 9]=
Row [Buf 7];
1.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant.If the viewing area moves right always, then above-mentioned deterministic process is carried out in circulation, until till the right margin of view piecemeal.
(2) viewing area moves down, and according to judging, gives from the thread photos and sending messages, predicts respectively and switches:
2.1 the lower boundary of viewing area crosses the border
Row [Buf 1], row [Buf 2], row [Buf 3], row [Buf 4], row [Buf 5],
Row [Buf 6], row [Buf 7], row [Buf 8], row [Buf 9] all constant,
The row [Buf 1], the row [Buf 2], the row [Buf 3], the row [Buf 4], the row [Buf 5], the row [Buf 6] constant,
Row [Buf 7]=row [Buf 4]+1
Row [Buf 8]=row [Buf 5]+1
Row [Buf 9]=row [Buf 6]+1;
2.2 cross the border in the coboundary of viewing area, will move down buffer zone one unit this moment, and with in the original buffer zone matrix topmost delegation be put into the delegation bottom of new buffer zone matrix, thereby make current display area be arranged in the Buf1 piece of new buffer zone matrix
Row [Buf 1], row [Buf 2], row [Buf 3], row [Buf 4], row [Buf 5],
Row [Buf 6], row [Buf 7], row [Buf 8], row [Buf 9] all constant,
Row [Buf 1]=row [Buf 4], row [Buf 2]=row [Buf 5], row [Buf 3]=row [Buf 6],
Row [Buf4]=row [Buf 7], row [Buf 5]=row [Buf 8], row [Buf 6]=row [Buf 9],
Row [Buf 7]=row [Buf 1], row [Buf 8]=row [Buf 2], row [Buf9]=row [Buf 3];
2.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant, if the viewing area moves down always, then above-mentioned deterministic process is carried out in circulation, till the lower boundary of view segmented areas.
(3) viewing area moves to left, and according to judging, gives from the thread photos and sending messages, predicts respectively and switches:
3.1 the left margin of viewing area crosses the border
The row [Buf 1], the row [Buf 2], the row [Buf 3], the row [Buf 4], the row [Buf 5],
The row [Buf 6], the row [Buf 7], the row [Buf 8], the row [Buf 9] all constant,
Row [Buf 1]=row [Buf 1]-1, row [Buf 2]=row [Buf 1],
Row [Buf 3]=row [Buf 2], row [Buf 4]=row [Buf 4]-1,
Row [Buf 5]=row [Buf 4], row [Buf 6]=row [Buf 5],
Row [Buf 7]=row [Buf 7]-1, row [Buf 8]=row [Buf 7],
Row [Buf 9]=row [Buf 8];
3.2 the right margin of viewing area crosses the border
Ranks number do not change;
3.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant.If the viewing area is moved to the left always, then above-mentioned deterministic process is carried out in circulation, until till the left margin of view piecemeal.
(4) move on the viewing area,, give, predict respectively and switch from the thread photos and sending messages according to judging:
4.1 cross the border in the coboundary of viewing area
Row [Buf 1], row [Buf 2], row [Buf 3], row [Buf 4], row [Buf 5],
Row [Buf 6], row [Buf 7], row [Buf 8], row [Buf 9] all constant,
Row [Buf 1]=row [Buf 1]-1, row [Buf 2]=row [Buf 2]-1,
Row [Buf 3]=row [Buf 3]-1,
Row [Buf 4]=row [Buf 1], row [Buf 5]=row [Buf 2], row [Buf 6]=row [Buf 3],
Row [Buf 7]=row [Buf 4], row [Buf 8]=row [Buf 5], row [Buf 9]=row [Buf 6];
4.2 the lower boundary of viewing area crosses the border
Ranks number do not change;
4.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant, if the viewing area is moved to the left always, then above-mentioned deterministic process is carried out in circulation, till the left margin of view piecemeal.
(5), moving on other directions of viewing area all can be decomposed into above level and the mobile component on the vertical direction, calculate respectively and predict according to above-mentioned corresponding step.
According to soft project and object-oriented programming principle, can take out the class of following coordinated work in image shows.They are:
TBackground Background From Layer class
The TView view
TfrmView view window class
TDspBkgound shows the public base class of view
TDspLatticeData is used to calculate the class of viewing area
The class that TSmallBkground shows little view
The class that TBigBkgound shows big view in this case, does not produce
The view buffer zone
TDspBuffer display buffer class
For the principle of blocking and buffering prediction Display Realization is described.In conjunction with Fig. 7 some classes that relate in the view procedure for displaying and the mutual relationship between them are described.
In Fig. 7, TBackground background classes correspondence be the viewdata source that will show.According to the kind difference of data, such has derived from the electronic chart class again, three kinds of scintigram class and planning region classes.These three classes are respectively from different data source reading of data.Wherein scintigram is a dot array data, and corresponding background dot array data is all arranged in electronic chart and the planning region.Mainly being to dot array data, also is that raster data image shows.Vector graphical element in electronic chart and the planning region, as the street, the display management in river etc. is all finished by other classes.
The TView class is mainly finished management between data in the view and the display window and co-ordination.
TBackground, TView, three classes of TfrmView have constituted a division on the view Presentation Function logical level.
For independent on the function to the demonstration of view, improve the robustness between the module, reduce coupling, be convenient to code debugging, maintenance and upgrading.According to OO method, function has been divided in several classes such as TDspBkgound, TDspLatticeData, TSmallBkground, TBigBkgound, TDspBuffer and has realized.
TDspBkgound is the base class that is used to show view, and it provides some public function interfaces, and concrete function is left derived class for and realized.TSmallBkground, TBigBkgound are exactly the subclass from such derivation, and they are corresponding respectively to little view and the demonstration of view greatly.The TDspLatticeData class then is used in the part that each piecemeal calculates and current display area intersects of big view and the judgement of some necessity.It frequently uses in the process that shows big view.TDspBuffer is a view buffering class.It has defined the buffer blocks of using in big view procedure for displaying.
When showing big view, defined the tabulation of 9 buffer zones.And the viewing area is all the time in the view piece of these nine buffer zone correspondences, when the viewing area is mobile on view,, then differentiate rule according to certain if satisfied certain condition, carry out the buffer zone prediction, the original not view piece in buffer zone is covered buffer blocks.And calculate the viewing area and cushion the part that intersects between the block.At last with the intersecting area amalgamation together, constituting the viewing area shows then.
In the TDspLatticeData class:
GetLatticeDataRegion () is used to obtain the view of zone behind piecemeal that will show (promptly
Whole background dot matrix images are if this background dot matrix image too
Greatly, then to be divided into equal-sized, except the border) in
Corresponding piece number.
GetBlockArea () is used to obtain intersecting of the zone that will show and some piecemeals
Part is with respect to the upper left corner of this piecemeal and want the viewing area
The relative position in the upper left corner, thus be convenient to from piecemeal, " scratch "
Publish picture picture and the image that " scratching " goes out is stitched to wants the viewing area
The position of correspondence in the territory.
DrawAreaTo () passes through function G etLatticeDataRegion () to all pieces
Judge, obtain the piecemeal that intersects with the viewing area
Ranks number are handled these piecemeals then, respectively
Obtain the part that will show in each piecemeal on view
Accurate location, the respective area of then they being signed in painting canvas
Get in the territory.
In the TDspBkgound class:
OnDspLatticeDataChange () calls when background dot matrix data variation, again transfer point
The battle array data also refresh buffering.
GetDspLatticeData () obtains from the member variable of TView type about showing
Some information of the image that shows.Come with these information then
Fill an example of TDspLatticeData object
fDspLatticeData。
This function of DisplayAt () is according to drawing the district on the painting canvas that imports into, the painting canvas
Territory, the parameters such as scope that will show are got from buffer zone
Go out a blocks of data, sign on the painting canvas.
In the TDspBuffer class:
Initialize () is according to parameter initializations such as the row, column of importing into, palettes
A TBitmap object is as buffering, and creates one
TEvent event class object is so that in that to carry out buffer zone pre-
Use during survey.
The starting point in this function setup display buffer zone of SetBufferOrigin (), and and it is former
The starting point of coming judges whether to change (as being dragged
Cross), if, then will be again to current buffer area
Operate, and current display buffer object is put into
Waiting list, the backstage invokes thread is with corresponding in the view
Buffer object is called in the zone
This function of Render () is used for drawing image, at first uses PatBlt () function
With video data buffer zone bitmap painted white, then will
The part that viewing area and each piecemeal intersect is plotted to this and shows
Registration gets on according to the buffer zone bitmap.
This function of DisplayAt () obtains a viewing area and a specific demonstration
The zone that buffering (being object itself) intersects is cushioned at this
Position in the district, and this piece " scratched ", show
In this zone.Diagram Fig. 8 of this function is described as follows:
Drawing area abcd and 1~No. 9 buffer intersect as Fig. 8.Will be from buffer5, with intersecting area AIJO, IBKO, JOCL, OKLD take out and are combined into ABCD, so that show in 6,7,8.With AIJO is example, and its upper left corner and lower right corner coordinate are respectively (1500,1500) and (2000,2000).And be (500,500) with respect to the absolute coordinates of buffer5.So its coordinate will deduct the upper left corner coordinate of buffer5.The AIJO that takes out is shown on the ABCD that represents with respect to (0,0) point again.
In the TBigBkgound class:
Initialize () carries out initial work.At first read background data (also
Promptly by calling the function of base class TDspBkground
Obtain behind the GetDspLatticeData () function
The fDspLatticeData object).Create background thread then,
And 9 buffer zones and their Origin boundary coordinate be set.
DisplayAt () according to the definite display buffer that will use of indication range, waits for earlier
They become effective status (by function G etBufferReady ()
Realize, wait for promptly that also each buffer zone all comprises correct looking
The figure piecemeal), at last 9 buffer zones are all called separately
DisplayAt () function is drawn the portion that each and buffer zone intersect
Divide.
What MoveTo) this function calculation will show after move the viewing area is which
Content in several buffer zones is in the current buffer zone
Hold not in internal memory, whether need to submit to new content to change
Existing buffer zone.Also promptly carry out buffer zone prediction and analysis.
Its thinking is as follows:
If the very big view pic of a width of cloth is arranged, create the buffering in 9 zones, constitute clathrate shown in Figure 9.At first determine a principle: have only when the upper left corner coordinate of the view area that will show is positioned at 1,2,4, No. 5 grid of 9 grid, could show.If not in this zone, mobile grid, the corresponding view piecemeal is installed to grid, make this condition satisfy just demonstration.After view window moves once, judge (shadow region among following Fig. 9) to the view area state after moving with function.Can finish this function with GetViewportState () function.This function returns the state of current view window.View window has following four kinds of state: RightE (two buffer zones are striden on the right side), DownE (striding two buffer zones up and down), RightDownE (stride the right side, down, three buffer zones in bottom right) and CenterE (in a buffer zone).This in four situation correspond respectively to state among B, C among Figure 10, D, the A four.
Then according to the relative position that moves back and mobile front view window, the upper left corner of promptly mobile rear view window distance relation in the original view window upper left corner apart on directions X and Y direction.For example, in Fig. 9, view area has moved to the position at shade place, and its upper left angle point is arranged in the 5th buffer zone, and original view area summit is in the 1st buffer zone.At this moment, buffer zone prediction and the thinking of submitting to are as follows: the numbering of establishing 9 buffer zones from left to right is respectively 1,2,3,4,5,6,7,8,9 from top to bottom.Be completely contained in viewing area in the buffer zone 1 when this buffer level moves to buffer zone 2 when one, following step arranged:
(1) when also in first buffer zone, the member variable BoundState.top of viewing area (record be whether the upper left corner strides across two buffer zones after moving)=0.BoundState.left=0, BoundState.right and BoundState.top and BoundState.bottom are 0.See Figure 11.
(2) when just having exceeded first buffer zone by the border, except BoundState.right=1, boundState.top, BoundState.left, BoundState.bottom is 0.At this moment, can predict buffer zone by call function PredictBuffer ().See Figure 12.
(3) prediction can calculate No. 2 during buffer zone, and the view piecemeal of the buffer zone correspondence on No. 5 the right number should be 3 and 6.But following delegation then with filling when the capable previous row of front view piecemeal, if do not have, does not then fill, and is x1 herein, x2 and x3 (because might be to move forward) next time.See Figure 13
When (4) continuing to move to right, when also crossing in the buffer zone 1 arrival buffer zone 2 to the upper left corner of viewing area, this moment, BoundState.left=1 can predict buffer zone by call function PredictBuffer (), the result moves on to low order end with the first row level, because might can move to left the viewing area.If the viewing area continues to be shifted to the right to and when buffer zone took place to cross over, originally that row buffer zone that moves past from Far Left was incorrect (being in order to prevent that the viewing area from moving to left), now just should fill it with correct view piecemeal.See Figure 14.
(5) move to right so always, then can circulate always.Downwards or on other directions move and this is similar.
GetRenderBuffer () obtains current from wait for the buffer zone formation of submitting to
Display buffer object to be submitted to.
BufferReady () buffer object is set to effective status.
EndBuffer () finishes a thread of submitting to.
BufferWaitForRender () is put into a display buffer object and wait for submits to
In the formation, if the display buffer of current submission is right
Resemble and be then to finish carrying by this object this object
Hand over, and put it in the waiting list, wait for
Submit to.If this object is in waiting list,
Then return.
State before and after GetViewportStatae () moves according to the viewing area is shown
Show the state that the zone is current.Thereby whether decision
Carry out the buffer zone prediction.
PredictBuffer () carries out the buffer zone prediction and submits to.
LoadBuffer () is true according to current display area state upper left corner coordinate
Decide the display buffer, and be submitted to.
SwitchViewtoBuffer () carries out level (moving to left) to 9 buffer zones with vertical
The switching of (on move).
SwitchBuffertoView () carries out level (moving to right) to 9 buffer zones with vertical
The switching of (moving down).
After SkipAllRenderBuffer () ignores all threads current to be submitted to and wait
The platform thread suspension.
The present invention proposes and solve the effective way that big view shows, in the design of the network planning and prioritization scheme, implement in this method obtained using widely.Ultimate principle and technology that the present invention proposes, according to top class relation and model, and relevant call relation, can on the different platforms that can realize and support multitask and Message Processing, realize.

Claims (2)

1, a kind of large-view blocking and buffering display method is characterized in that may further comprise the steps:
A, will need the image Pic that shows from left to right, be divided into equal-sized view piece by ranks from top to bottom, in order to described view block number, the height of view piece and width are greater than the height and the width of display viewing area;
B, create one 3 * 3 view buffer zone matrix in calculator memory, its height is consistent with width with the height of width and described view piece, and it is numbered;
C, establishment are used to show and refresh the main thread of view; Create with the main thread parallel running from thread, this thread carries out initialization according to the information of current buffer zone matrix and view piecemeal;
D, when all or part of of viewing area also in the visible display buffer at the buffer zone matrix, then show it;
If cross the border in arbitrary border in any of four borders of viewing area and 3 * 3 buffer zones, from the prediction of thread at the enterprising row buffer of timeslice of CPU free time, the piece of attempting that will show in the image is filled in the prediction buffering, and judge whether to carry out the buffer zone switching, adjust the position of buffer zone matrix;
Under e, certain state after move the viewing area, the view piece of each buffer zone correspondence of having predicted according to the front, the image of the intersection of each buffer blocks of calculating the viewing area and intersecting with it, it is taken out amalgamation becomes the image that should show in the viewing area, is presented on the screen then.2, according to the described large-view blocking and buffering display method of claim 1, it is characterized in that: the height of the view piece of described image is 1~2 times of height of display viewing area, and the width of view piece is 1~2 times of width of display viewing area.
3,, it is characterized in that the prediction of buffer zone and the step of switching comprise according to the described large-view blocking and buffering display method of claim 1:
(1), the viewing area moves to right, according to following situation classified calculating prediction,
1.1 when the viewing area right margin crossed the border, all row number, row Buf1, row Buf2, row Buf4, row Buf5, row Buf7 and row Buf8 were all constant, row Buf3, row Buf6 and row Buf9 are respectively former row number row Buf2, row Buf5 and row Buf8 adds 1;
1.2 when the left margin of viewing area crosses the border,, and one row of Far Left in the former buffer zone matrix are put into rightmost one row of new buffer zone matrix, make current display area be arranged in the Bufl piece of new buffer zone matrix with move right one unit of buffer zone; All row are number all constant, and row Buf1~row Buf9 is respectively former row number row Buf2, row Buf3, row Buf1, row Buf5, row Buf6, row Buf3, row Buf8, row Buf9 and is listed as Buf7;
1.3 when do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant, if the viewing area moves right always, then above-mentioned deterministic process is carried out in circulation, till the right margin of view piecemeal;
(2), the viewing area moves down, according to following situation classified calculating prediction,
2.1 when the lower boundary of viewing area crossed the border, row Buf1~row Buf6 and all row were number all constant, row Buf7, row Buf8 and row Buf9 are that former row number row Buf4, row Buf5 and the Buf6 that goes add 1 respectively;
2.2 when cross the border in the coboundary of viewing area, buffer zone is moved down one unit, and, makes current display area be arranged in the Bufl piece of new buffer zone matrix with the delegation bottom that the top delegation in the former buffer zone matrix is put into new buffer zone matrix; Row are number all constant, and row number row Buf1~row Buf9 is respectively former row number row Buf4~row Buf9, the Buf1~row Buf3 that goes;
2.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant, if the viewing area moves down always, then above-mentioned deterministic process is carried out in circulation, till the lower boundary of view segmented areas;
(3), the viewing area moves to left, according to following situation classified calculating prediction,
When 3.1 the left margin of viewing area crosses the border, capable number all constant, row Buf1, row Buf4 and row Buf7 are respectively corresponding former row and number subtract 1, and row Buf2, row Buf3, row Buf5, row Buf6, row Buf8, row Buf9 are respectively former row number row Buf1, row Buf2, row Buf4, row Buf5, row Buf7 and row Buf8;
3.2 when the right margin of viewing area crossed the border, ranks number did not change;
3.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant, if the viewing area is moved to the left always, then above-mentioned deterministic process is carried out in circulation, till the left margin of view piecemeal;
(4), move on the viewing area, according to following situation classified calculating prediction,
4.1 when cross the border in the coboundary of viewing area, all row are number constant, row Buf1~row Buf3 is respectively corresponding former row and number subtracts 1, and row Buf4~row Buf9 is respectively former row and number goes Buf1~row Buf6;
4.2 when the lower boundary of viewing area crossed the border, ranks were number constant;
4.3 do not cross the border in the border, viewing area, the ranks of each Buf piece are number constant, if the viewing area is moved to the left always, then above-mentioned deterministic process is carried out in circulation, till the left margin of view piecemeal;
(5), the mobile mobile component that is decomposed on above-mentioned level and the vertical direction on other direction of viewing area, calculate respectively and predict according to above-mentioned corresponding steps.
CN 01112850 2001-05-06 2001-05-06 Large-view blocking and buffering display method Expired - Fee Related CN1266582C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 01112850 CN1266582C (en) 2001-05-06 2001-05-06 Large-view blocking and buffering display method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 01112850 CN1266582C (en) 2001-05-06 2001-05-06 Large-view blocking and buffering display method

Publications (2)

Publication Number Publication Date
CN1384427A CN1384427A (en) 2002-12-11
CN1266582C true CN1266582C (en) 2006-07-26

Family

ID=4659597

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 01112850 Expired - Fee Related CN1266582C (en) 2001-05-06 2001-05-06 Large-view blocking and buffering display method

Country Status (1)

Country Link
CN (1) CN1266582C (en)

Families Citing this family (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7346856B2 (en) * 2003-08-21 2008-03-18 International Business Machines Corporation Apparatus and method for distributing portions of large web images to fit smaller constrained viewing areas
CN100411009C (en) * 2005-08-26 2008-08-13 致伸科技股份有限公司 Image displaying system and method
US7595805B2 (en) * 2006-04-11 2009-09-29 Qualcomm Incorporated Techniques to facilitate use of small line buffers for processing of small or large images
CN101059949B (en) * 2007-04-03 2010-05-26 广东威创视讯科技股份有限公司 Mass image data compression, storage and display method
JP4329837B2 (en) * 2007-04-09 2009-09-09 ソニー株式会社 Video signal processing device, video signal processing method, program, and image display device
CN101668192B (en) * 2008-09-04 2013-05-01 新奥特(北京)视频技术有限公司 Method for transmitting images with large data volume in real time based on C/S mode
CN102103478B (en) * 2009-12-22 2013-02-13 联想(北京)有限公司 Method, device and system for intercepting display data
US8823719B2 (en) * 2010-05-13 2014-09-02 Mediatek Inc. Graphics processing method applied to a plurality of buffers and graphics processing apparatus thereof
CN102376291B (en) * 2010-08-19 2014-07-30 深圳芯邦科技股份有限公司 Method and device for controlling image display
CN102520897B (en) * 2011-11-14 2015-01-28 中兴通讯股份有限公司 Mobile terminal and method for increasing drawing speed of screen interface
CN103455973B (en) * 2012-05-28 2017-02-08 方正国际软件(北京)有限公司 Method and device for drawing screen images
CN103035219B (en) * 2012-12-25 2015-10-28 广东威创视讯科技股份有限公司 The reading/writing method of dot matrix type liquid crystal display and device
CN103105131B (en) * 2013-01-24 2015-08-19 东莞市嘉腾仪器仪表有限公司 A kind of method of image measurer display image
CN103677710A (en) * 2013-11-11 2014-03-26 广东鼎燊科技有限公司 Interactive display method for display screens
CN108133094B (en) * 2017-12-14 2021-08-24 中国电子科技集团公司第四十七研究所 Layout and wiring display method for field programmable gate array of anti-fuse
CN108876712B (en) * 2018-06-21 2022-09-02 东南大学 Spherical closed cabin panoramic display method based on double projection transformation

Also Published As

Publication number Publication date
CN1384427A (en) 2002-12-11

Similar Documents

Publication Publication Date Title
CN1266582C (en) Large-view blocking and buffering display method
CN1534476A (en) Mark language and object model of vector graps
CN1534511A (en) Viewing window and background graph interface
CN1313910C (en) Image display method and program
CN1183778C (en) Picture decoding device and recording medium
CN1288603C (en) Image processing device and its assembly and rendering method
CN1284073C (en) Information display system and its information processing apparauts, indicator and mark displaying method
CN1252648C (en) Three-D graphics rendering apparatus and method
CN1305009C (en) Image processing device and image processing method and processing program
CN1083595C (en) Electronic montage greation device
CN1653488A (en) Display driver IC, display module and electrical device incorporating a graphics engine
CN101080698A (en) Real-time display post-processing using programmable hardware
CN1026928C (en) System and method for color image enhancement
CN1904827A (en) Method of displaying wallpaper and apparatus for displaying wallpaper
CN1119046A (en) Object-oriented constructive area system
CN1560797A (en) 3-D image processing mechanism for reducing Z buffer zone flow rate
CN1627359A (en) Frame rate conversion device, overtaking prediction method for use in the same, display control device and video receiving display device
CN1601369A (en) Image processing system, projector and image processing method
CN1152748A (en) Image expansion device for computer system
CN1729937A (en) Image processing apparatus and method using evacuated reference images
CN1893617A (en) Motion compensation display
CN1476718A (en) Image processing system, projector, information storage medium, and white-black expansion method
CN1729427A (en) Projection device, projection system, and image obtainment method
CN1178165C (en) Image processing device, image processing method, iamge-processing program recording medium
CN101038676A (en) Image processing apparatus and image processing method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C53 Correction of patent for invention or patent application
COR Change of bibliographic data

Free format text: CORRECT: APPLICANT; FROM: SHENZHENG CITY ZTE CO., LTD. SHANGHAI SECOND INSTITUTE TO: ZTE CO., LTD.

CP02 Change in the address of a patent holder

Address after: Law ZTE building 518057 Guangdong city of Shenzhen province Nanshan District high tech Industrial Park, Cozi Road

Applicant after: ZTE Corporation

Address before: 200233 No. 396, Shanghai, Guilin Road

Applicant before: Shanghai Inst. of No.2, Zhongxing Communication Co., Ltd., Shenzhen City

C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Owner name: HAIMEN TECHNOLOGY DEVELOPMENT CORP.

Free format text: FORMER OWNER: ZTE CORPORATION

Effective date: 20130410

C41 Transfer of patent application or patent right or utility model
COR Change of bibliographic data

Free format text: CORRECT: ADDRESS; FROM: 518057 SHENZHEN, GUANGDONG PROVINCE TO: 226144 NANTONG, JIANGSU PROVINCE

TR01 Transfer of patent right

Effective date of registration: 20130410

Address after: 226144, 600 Beijing Road, Haimen, Jiangsu province (administrative center, room 0212)

Patentee after: Haimen science and Technology Development General Corporation

Address before: 518057 Nanshan District science and Technology Industrial Park, Guangdong high tech Industrial Park, ZTE building

Patentee before: ZTE Corporation

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20060726

Termination date: 20160506

CF01 Termination of patent right due to non-payment of annual fee