English  |  正體中文  |  简体中文  |  Items with full text/Total items : 75533/75533 (100%)
Visitors : 27437841      Online Users : 362
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9321

    Title: 不規則三角網格之視域計算與應用;Visibility Computation and Applications on Triangulated Irregular Networks
    Authors: 鄭松賓;Sung-Pin Cheng
    Contributors: 資訊工程研究所
    Keywords: 視域分析;視域計算;visibility computation;viewshed
    Date: 2006-06-16
    Issue Date: 2009-09-22 11:45:22 (UTC+8)
    Publisher: 國立中央大學圖書館
    Abstract: 由於地理資訊系統的廣泛與普及化運用,各種不同的計算與分析需求亦不斷地產生。對於地理資訊系統使用者而言,可以依照本身的需求,選擇適合的計算與分析方法以取得所需資訊是很重要的;例如,許多地理資訊系統相關的應用需要視域計算,諸如手機基地台之最大涵蓋範圍地點分析、瞭望台之最佳視野範圍地點分析、軍隊行軍撤退之最隱蔽路線等。 本研究是針對視域計算技術進行研究與實作。我們提出一個以不規格三角網格地形為基礎的視域計算演算法;這個演算法使用了特定的範圍角度來縮小處理範圍並使用射線測試函式減少投影計算量以提高執行效率。此演算法讓使用者可以更方便、更有效率的對地形執行視域計算;並提供視域計算做地理資訊系統的相關應用。 Several important applications of geographic information systems (GIS) require visibility computation, such as, the line-of-sight communication, the optimal placement of a radial tower or a watchtower, finding the path with certain visibility properties (scenic or hidden paths) and so on. Thus, a better visibility computation algorithm makes the applications more efficient. The goal of our research is to study the visibility computation technique and implement the algorithm for several related applications. In this study, we proposed an improved visibility computation algorithm which is based on the triangulated irregular networks. We use intersection test module instead of the general projection method to achieve the same results; moreover, we use specific angles to narrow the test range to improve performance. By the proposed methods, we can reduce the computation of the algorithm to obtain better performance. The proposed algorithm is roughly divided into three parts: the spatial analyst, radial sort, and visibility computation. First, the spatial analyst performs the neighborhood and zone analysis for visibility computation. Second, the radial sort step decides the processing sequence. Finally, the visibility computation step calculates the visibility information. The visibility information obtained form our visibility computation algorithm can conform to the properties of line-of-sight. Therefore, the visibility information can solve the line-of-sight computation problems on TINs for lots of applications.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明