201001356 九、發明說明： 【發明所屬之技術領域】 本發明係關於一種拖曳搜尋店家資訊於電子地圖之方法，特別是指利 用延伸前味拖曳之軌跡的方法，預先載入店家資訊，以減少搜尋過程中的 平均等待時間。 【先前技術】 近來應用AJAX (Asynchronous JavaScript and XML)技術之電子地圖已 Γ'廣為使用者所接受，如Go〇gleMaP與國内的UrMap，此類電子地圖除了查 詢地址地標之外，最重要的應用之一即為搜尋地域性之店家資訊，如餐廳、 加油站與旅遊景點資訊等等。 AJAX電子_㈣起，與近條視冑制程式的個介面有很大的關 係，使用者能自由的拖拉移動地圖，幾乎不需任何的等待時間。 然而，現有的電子地圖在店㈣訊的搜尋上，通f會有以下問題_· 1·旦拖¥即重新搜尋，不管幅度的大小，滑鼠放開後就必須等待資 料重新搜尋的時間，造成地圖操作被中斷的情形 2.拖髮前後時間差大於某個值才重新搜尋，由於使用者無法準確預期 店家的地點，此時間差同樣有地圖操作被中斷的情形。 3·拖矣地®後皆需要等待資料查詢與回傳的時間，即使用者拖矣地圖 後，無法即時看到所需的店家資訊，造成操作上的不流暢感，並留 下不佳的使用經驗。 由此可見’上述習用方式仍有諸多不足，實非-良善之設計，而亟待 加以改良。 201001356 乃亟思加以改良創 拖曳搜尋店家資訊 本案發明人鑑於上述習用方式所衍生的各項缺點， 新，並經苦心孤詣潛心研究後，終於成功研發完成本件 於電子地圖之方法。 【發明内容】 本發明之目的即在於提供-種拖$搜尋店家資訊於電子地圖之方法， 其利用延伸前次賊之軌跡，預先載人店家資訊，㈣少搜尋過程中的平 均等待時間。 ( 本發明之次-目的即在於提供—種拖$搜尋錄資訊於電子地圖之方 法’使用者在拖姚_同時，可同時觀地__的絲資訊，不但 強化使用者與電子地圖之間的互動性，也留下良好的使用經驗。 本發明之另-目的即在於提供-種拖戈搜尋店家資訊於電子地圖之方 法，首先加大資料的回傳範圍，使得微幅拖，地圖之動作不會引發重新查 詢，接著細傳資料時，避免重複傳_部分，最後延伸前次拖戈的軌跡， 預先載入店家資訊，減少整個拖曳搜尋過程的平均等待時間。 (i 達成上述發明目的之拖曳搜尋店家資訊於電子地圖之方法，首先加大 資料的回傳範圍，使得微幅拖曳地圖之動作不會引發重新查詢；接著在回 ' 傳雜時，避免重複傳輸的部分；最後延伸前次拖$的軌跡，預先載入店 - 家資訊，減少整個拖曳搜尋過程的平均等待時間。其中包含： 1. 資料伺服器傳回範圍内之店家資訊並顯示於地圖上。 2. 拖曳地圖後，資料伺服器傳回新範圍減去新舊範圍重複部分的店家 資訊。 3.從電子地圖刪除目前範圍外的店家資訊。 6 201001356 範圍的店家資訊。 4·根據使时前次拖_被、，在電子地咖先載入延伸㈣中心點 L固内，則電子地圖不需進 並再次根據使用者拖曳的 5·再次拖@關，若區域落在預先載人的範圍内 行查珣，可直接顯示店家資訊於地圖上，並 執跡，預先載入延伸拖曳範圍之店家資訊。 其中資料伺服器傳回店家資訊的範圍，是以地圖中心點4比例延伸201001356 IX. Description of the invention: [Technical field of the invention] The present invention relates to a method for dragging and searching for information on an electronic map, in particular, a method of pre-loading store information by using a method of extending a trail of towed to reduce search Average wait time in the process. [Prior Art] Recently, electronic maps using AJAX (Asynchronous JavaScript and XML) technology have been widely accepted by users, such as Go〇gleMaP and domestic UrMap. Such electronic maps are the most important in addition to querying address landmarks. One of the applications is to search for regional store information such as restaurants, gas stations and tourist attractions. AJAX Electronics _ (four), has a great relationship with the interface of the near-view program, users can freely drag and drop the mobile map, almost no waiting time. However, the existing electronic maps in the shop (four) search, the following problems will occur _· 1 · once dragged to re-search, regardless of the size, the mouse must wait for the time to re-search after the mouse is released, The situation that caused the map operation to be interrupted 2. The time difference before and after the delay is greater than a certain value before re-searching. Since the user cannot accurately predict the location of the store, the time difference also has the situation that the map operation is interrupted. 3. After dragging the ground®, you need to wait for the data query and return time. After the user drags the map, you can't instantly see the required store information, which makes the operation unsmooth and leaves poor. Experience. It can be seen that there are still many shortcomings in the above-mentioned methods of use, which are not the design of goodness, but need to be improved. 201001356 Nai Sisi improved and created Tow search shop information The inventor of this case, in view of the shortcomings derived from the above-mentioned conventional methods, and after painstaking research, finally successfully developed the method of this electronic map. SUMMARY OF THE INVENTION The object of the present invention is to provide a method for dragging and searching for store information on an electronic map, which utilizes the trajectory of the previous thief to pre-load the store information, and (4) the average waiting time during the less search process. (The second aspect of the present invention is to provide a method for dragging and searching for information on an electronic map. The user can simultaneously view the information of the __ at the same time, and not only strengthen the user and the electronic map. The interactive nature of the invention also leaves a good use experience. The other purpose of the present invention is to provide a method for searching for the information of the store in the electronic map, first increasing the return range of the data, so that the micro-drag, the map The action does not trigger a re-query. When the data is fine-tuned, it avoids repeating the _ part, and finally extends the trajectory of the previous drag, preloading the store information, reducing the average waiting time of the entire drag search process. The method of dragging and searching the store information in the electronic map first increases the return range of the data, so that the action of slightly dragging the map does not cause re-inquiry; then, when returning to the 'mixing, avoiding the part of repeated transmission; Drag the $ track twice, preloading the store-home information, reducing the average waiting time for the entire drag search process. It includes: 1. Data server returns The store information in the store is displayed on the map. 2. After dragging the map, the data server returns the new range minus the store information of the new and old range. 3. Delete the store information outside the current range from the electronic map. 6 201001356 Scope The store information. 4· According to the previous time dragging the _, the electronic map first loaded into the extension (4) center point L solid, the electronic map does not need to enter and again dragged according to the user's 5· If the area falls within the pre-loaded range, you can directly display the store information on the map and perform the pre-loading of the store information that extends the tow range. The scope of the data server to return the store information is Map center point 4 proportional extension
Λ5添角 【實施方式】 請參晒-所示，係為本發赚綴尋絲f訊於電子地圖之方法之 流程圖’其中該步驟流程包括： 步驟1:使用者查詢開始，輸入關鍵字或點選分類後，資料伺服器將傳 回一定範圍的店家資訊並顯示於地圖上101’此處的一定範圍是 指以地圖中心一定比例延伸之區域 步驟2:再判斷使用者是否開始拖曳電子地圖及判斷資料是否超過栽入 範圍102，如果沒有拖曳電子地圖，則查詢結束1〇3，如果有拖 曳電子地圖，則資料伺服器將傳回新範圍減去新舊範圍重複部 分的店家資訊並顯示於地圖上104 ; 步驟3:然後從電子地圖刪除目前範圍外的店家資訊105 ; 步驟4:根據使用者前次拖曳的軌跡，在電子地圖預先栽入延伸拖良中 心點範圍的店家資訊106 ; 步驟5:再判斷是否有再次拖良電子地圖使得資料超過栽入範圍1〇7，沒 7 201001356 有則查詢結束103’如果有則判斷拖曳的地圖是否落在預載範圍 内 108 ; 步驟6:如果沒有落在預載範圍内則重新回到步驟2，如果有落在預載範 圍内則顯示店家資訊於地圖1〇9上，並且回到步驟3。 請參閱圖二所示，係為本發明拖曳搜尋店家資訊於電子地圖之方法之 資料伺服器傳回的店家資訊範圍示意圖，其中該資料伺服器傳回的店家資 訊範圍之地圖的中心點座標為(x，y)201，矩形206為地圖的可視範圍，其左 ( 下頂點座標為(X2，y2)202 ’其右上頂點座標為(x3，y3)2〇3 ;矩形2〇7為店家資 訊的傳回範圍，其左下頂點座標為(x4，y4)2〇4，其右上頂點座標為 (x5，y5)205 ;當座標點(x，y)2(n、矩形206為已知的情形下，可求出矩形2〇7 之左下座標點為x4=X2-a(x-x2)、y4=y2-b(y-y2)，右上座標點為 x5=x3+a(x3-x)、y5=y3+b(y3_y)，其中a為延伸寬度的比例，b為延伸長度的 比例；如資職人制大於賴可視職，使用者觀拖__時，電子 地圖不必對資料飼服器發出重新搜尋的請求。 、： 請參閱圖三所示，為本發明拖域尋店家資訊於電子地圖之方法之資 料伺服ϋ傳削目交兩(1域不重複的店家資料示意圖，其巾該資料伺服器傳 回相交兩區域不重複的店家資料，係說明一但拖良後的區域超過資料載入 範圍，電子地圖必須進行重新查詢的動作，並只需傳回不重複區域之店家 資§地圖中〜座標由307拖良至308時’矩形309已無法涵蓋矩形312， 因此電子地圖彻座標點3G3、3G4之矩形3G9與座標點3〇5、3()6之矩形 310可求出兩矩形之間座標點3〇卜3〇2之重複區域，此時只需傳回不含座 8 201001356 標點301、302之區域313的店家資訊，避免資料重複傳輸的情形，接著將 座標點305、306之區域310以外的店家資訊刪除，釋放記憶體。 請參考圖四所示，為本發明拖曳搜尋店家資訊於電子地圖之方法之延 伸前次的拖髮軌跡與預先載入的資料範圍示意圖，依拖戈地圖的慣性而 言，同方向的拖曳動作通常比反方向拖曳來的多，因此利用拖良前後的地 圖中心點進行資料的預先載入；其中該地圖中心點由401移動至4〇2造成 線段412，可利用此兩點之座標求出延伸地圖中心點403 ,而且線段412與 \ 413的斜率與長度皆相同，並只傳回不重複區域4U之店家資訊；當使用者 再次拖曳地圖，若地圖所見範圍落在矩形41〇内，則不需進行查詢的動作， 直接顯示店家資訊，繼續預先載入店家資訊；若不在預先栽入的範圍内， 則傳回不足區域的店家資訊。 歸納上述，本方法首先加大資料的回傳範圍，使得微幅拖曳地圖之動 作不會引發麵查詢；接著在回傳資㈣，避免重複傳輸的部分；最後延 …伸則次拖曳的軌跡，預先載入店家資訊，減少整個拖曳搜尋過程的平均等 待時間。 本發明所提供之拖$搜尋絲資訊於電子關之方法，與其他習用技 銜相互比較時，更具有下列之優點： L本發_用延伸前次拖_跡之方法，預先載人縣資訊，減少搜 尋過程中的平均等待時間。 2·本發明之使騎拖_的同時即可看見地酿圍_店家資訊，找店 更容易。 9 201001356 3. 本發明之拖紐圍即搜尋範圍，不需地址地標的雜輔助。 4. 本發明之電子地_操作更驗暢，訂良好的使用經驗。 上列詳細說日聽針縣發社—可行實施之㈣體細，惟該實 並非用以_本發明之專利顧，凡未脫離本發藝精神所為之等^ 施或變更，均應包含於本案之專利範圍中。 述多項功效，本案不但在技術思想上確屬創新，並能較習用物品增進 上述多項功效，應以充分符合新穎性及進步性之法定發明專利要件，爰依 法提出帽，麟貴局絲本件發明專利申請案，以勵發明，至感德便。 【圖式簡單說明】 圖一為本發明拖曳搜尋店家資訊於電子地圖之方法之流程圖； 圖二為本發明拖曳搜尋店家資訊於電子地圖之方法之資料伺服器傳回 的店家資訊範圍示意圖； 圖三為本發明拖曳搜尋店家資訊於電子地圖之方法之資料伺服器傳回 相交兩區域不重複的店家資料示意圖；以及 圖四為本發明拖曳搜尋店家資訊於電子地圖之方法之延伸前次的拖曳 軌跡與預先載入的資料範圍示意圖。 【主要元件符號說明】 201〜205座標點 301〜308座標點 401〜407座標點 206 矩形範圍 207 矩形範圍 309〜312矩形範圍 201001356 408〜410 矩形範圍 208 店家資訊代表圖 312 有向線段 412 有向線段 413 有向線段Λ5添角 [Implementation] Please refer to the sun-show, this is a flow chart of the method of earning the e-mail map in the electronic map. The step process includes: Step 1: User query starts, input keyword Or after sorting the category, the data server will return a certain range of store information and display it on the map. 101' A certain range here refers to an area extending at a certain proportion of the center of the map. Step 2: Determine whether the user starts to drag the electronic Whether the map and the judgment data exceed the planting range 102. If the electronic map is not towed, the query ends 1〇3. If there is a dragged electronic map, the data server will return the new range minus the store information of the new and old range. Displayed on the map 104; Step 3: Then delete the store information 105 outside the current range from the electronic map; Step 4: According to the trajectory of the user's previous drag, pre-planted the store information 106 in the extended drag center point range on the electronic map. Step 5: Re-judge whether there is another good electronic map so that the data exceeds the planting range of 1〇7, no 7 201001356, then the query ends 103' if it is Whether the broken tow map falls within the preload range 108; Step 6: If it does not fall within the preload range, return to step 2, if there is a preload range, display the store information on the map 1〇9, And go back to step 3. Please refer to FIG. 2 , which is a schematic diagram of the scope of the store information returned by the data server for dragging and searching the store information on the electronic map. The center point of the map of the store information range returned by the data server is (x, y) 201, rectangle 206 is the visible range of the map, the left (lower vertex coordinates are (X2, y2) 202 ', the upper right vertex coordinates are (x3, y3) 2 〇 3; rectangle 2 〇 7 is the store information The return range of the lower left vertex is (x4, y4) 2〇4, and the upper right vertex coordinates are (x5, y5) 205; when the coordinate point (x, y) 2 (n, rectangle 206 is known) Next, the left lower coordinate point of the rectangle 2〇7 can be found as x4=X2-a(x-x2), y4=y2-b(y-y2), and the upper right coordinate point is x5=x3+a(x3-x) , y5=y3+b(y3_y), where a is the ratio of the extended width, and b is the ratio of the extended length; if the employee system is greater than the visual position, the user does not have to use the data feeding device when the user views __ Request for re-searching., : Please refer to Figure 3 for the information of the method of finding the store information in the electronic domain map of the invention. The data diagram, the data server returns the information of the store that does not overlap in the two areas. It means that once the area after the drag is over the data loading range, the electronic map must be re-queried and only need to be returned. Repetitive area of the store family § map ~ coordinates from 307 dragged to 308 ' rectangle 309 can not cover the rectangle 312, so the electronic map full punctuation 3G3, 3G4 rectangle 3G9 and coordinates point 3 〇 5, 3 () 6 The rectangle 310 can find the repeated area of the coordinate point 3〇3〇2 between the two rectangles. At this time, it is only necessary to return the store information of the area 313 which does not include the seat 8 201001356 punctuation points 301, 302, to avoid repeated transmission of data. Then, the store information other than the area 310 of the coordinate points 305 and 306 is deleted, and the memory is released. Please refer to FIG. 4, which is an extension of the method of dragging and searching for the information of the store on the electronic map. According to the inertia of the drag map, the dragging action in the same direction is usually more than that in the opposite direction. Therefore, the data center is pre-predicted by using the map center point before and after dragging. Loading; wherein the map center point is moved from 401 to 4〇2 to create a line segment 412, and the extended map center point 403 can be obtained by using the coordinates of the two points, and the slopes and lengths of the line segments 412 and \413 are the same, and only the Back to the store information of the area 4U; when the user drags the map again, if the map sees the range within the rectangle 41〇, the action of the inquiry is not required, the store information is directly displayed, and the store information is pre-loaded; if not in advance Within the scope of planting, the store information of the insufficient area is returned. In summary, the method first increases the return range of the data, so that the action of slightly dragging the map does not trigger the face query; then, in the return (4), avoid The part that repeats the transmission; the last delay... stretches the trajectory of the next drag, preloading the store information, reducing the average waiting time of the entire drag search process. The method for dragging and searching the information in the electronic information of the present invention has the following advantages when compared with other conventional technical titles: L. The present invention uses the method of extending the previous dragging and trailing information to pre-load the county information. , reducing the average waiting time during the search process. 2. The invention can be seen while riding the tractor _ while the store is _ store information, it is easier to find a store. 9 201001356 3. The towing range of the present invention is the search range, and does not require the assistance of the address landmark. 4. The electronic operation of the present invention is more convenient and has a good experience in use. The above is a detailed description of the daily auditing of the needles of the county, which is feasible (4), but it is not used for the patents of the present invention. Any changes or modifications not included in the spirit of the present invention shall be included in The patent scope of this case. With regard to a number of functions, this case is not only innovative in terms of technical thinking, but also can enhance the above-mentioned multiple functions compared with the conventional articles. It should be in accordance with the statutory invention patents that fully meet the novelty and progress, and propose the cap according to law. Patent application, in order to invent, to the sense of virtue. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a flow chart of a method for dragging and searching a store information on an electronic map according to the present invention; FIG. 2 is a schematic diagram showing a range of store information returned by a data server for dragging and searching a store information on an electronic map; FIG. 3 is a schematic diagram of the data server of the method for dragging and searching the store information in the electronic map, and the method for dragging and searching the two regions is not repeated; and FIG. 4 is the extension of the method for dragging and searching the store information in the electronic map. Drag track and pre-loaded data range schematic. [Main component symbol description] 201~205 coordinate point 301~308 coordinate point 401~407 coordinate point 206 rectangular range 207 rectangular range 309~312 rectangular range 201001356 408~410 rectangular range 208 store information representative figure 312 directed line segment 412 directed Line segment 413 directed segment