【摘要】：如今，地理信息系統(tǒng)地發(fā)展日益成熟，機(jī)載激光雷達(dá)技術(shù)的發(fā)展一日千里，人們對(duì)于三維數(shù)字城市地圖的需求越來(lái)越迫切，如何從海量數(shù)據(jù)中快速獲取到高分辨率的數(shù)字表面模型成為眾多學(xué)者關(guān)注的問(wèn)題。數(shù)字表面模型常規(guī)的表示方法有兩種：格網(wǎng)法和不規(guī)則三角網(wǎng)模型。格網(wǎng)法效率高但失真較大，不規(guī)則三角網(wǎng)模型可以較好地描述真實(shí)地形但算法復(fù)雜度較高。針對(duì)如何使用不規(guī)則三角網(wǎng)快速生成數(shù)字表面模型的問(wèn)題，本文進(jìn)行了一系列的探討和實(shí)驗(yàn)。首先總結(jié)了經(jīng)典的不規(guī)則三角網(wǎng)構(gòu)網(wǎng)方法——分而治之算法、逐點(diǎn)插入算法和三角網(wǎng)生長(zhǎng)算法的優(yōu)缺點(diǎn)，然后針對(duì)這三種算法構(gòu)網(wǎng)效率低的問(wèn)題，面向快速處理大量數(shù)據(jù)生成DSM的應(yīng)用，提出了一種新的不規(guī)則三角網(wǎng)構(gòu)網(wǎng)流程。 本文算法主要包括建立虛擬網(wǎng)格、網(wǎng)格插值、生成初始三角網(wǎng)、冗余數(shù)據(jù)處理和密集數(shù)據(jù)處理五個(gè)步驟。通過(guò)建立虛擬網(wǎng)格可以對(duì)三維離散數(shù)據(jù)點(diǎn)進(jìn)行快速定位，有效的網(wǎng)格插值有助于生成高分辨率的DSM，構(gòu)造初始三角網(wǎng)的時(shí)間復(fù)雜度為O (N)，大大提高了不規(guī)則三角網(wǎng)的構(gòu)網(wǎng)效率，，冗余數(shù)據(jù)處理和密集數(shù)據(jù)處理是對(duì)初始三角網(wǎng)的優(yōu)化，可以一定程度上解決網(wǎng)格插值帶來(lái)的信息冗余和網(wǎng)格定位帶來(lái)的信息損失，因此能夠有效提高不規(guī)則三角網(wǎng)的質(zhì)量。同時(shí)，本文采用OpenGL作為三維顯示工具，使用VC++編寫(xiě)軟件，對(duì)所提出的算法進(jìn)行了實(shí)驗(yàn)和分析，經(jīng)驗(yàn)證，該算法時(shí)間效率較高，具有一定的實(shí)用性。
[Abstract]:Nowadays, with the development of geographic information system (GIS) and the rapid development of airborne lidar technology, the demand for 3D digital city map is becoming more and more urgent. How to quickly obtain high resolution digital surface models from massive data has become a problem that many scholars pay attention to. There are two kinds of conventional representation methods of digital surface model: grid method and irregular triangular mesh model. The grid method has high efficiency and high distortion. The irregular triangular network model can describe the real terrain well but the complexity of the algorithm is high. In order to solve the problem of how to use irregular triangulation to quickly generate digital surface model, a series of experiments are carried out in this paper. This paper first summarizes the advantages and disadvantages of the classical irregular triangulation network-divide-and-conquer algorithm, point-by-point insertion algorithm and triangulation algorithm, and then aims at the low efficiency of these three algorithms. In this paper, a new irregular triangulation network flow is proposed for fast processing of large amount of data to generate DSM. The algorithm consists of five steps: creating virtual grid, grid interpolation, generating initial triangulation, redundant data processing and dense data processing. By establishing virtual mesh, 3D discrete data points can be located quickly. Effective mesh interpolation is helpful to generate high-resolution DSM, to construct the initial triangulation. The time complexity of constructing the initial triangulation network is O (N),. The efficiency of irregular triangulation is greatly improved. Redundant data processing and dense data processing are the optimization of initial triangulation, which can solve the information redundancy caused by grid interpolation and the information loss caused by grid location to some extent. Therefore, the quality of irregular triangulation can be improved effectively. At the same time, OpenGL is used as a 3D display tool, and the software is written by VC. The proposed algorithm is tested and analyzed. It is proved that the algorithm is efficient in time and practical.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類(lèi)號(hào)】：P208;TP391.41

【參考文獻(xiàn)】

相關(guān)期刊論文 前10條

1 李玉廣;朱福祥;;獲取艦船液艙數(shù)字表面模型的數(shù)字立體攝影測(cè)量方法[J];船舶設(shè)計(jì)通訊;2009年01期

2 彭儀普,劉文熙;Delaunay三角網(wǎng)與Voronoi圖在GIS中的應(yīng)用研究[J];測(cè)繪工程;2002年03期

3 劉廣忠;黃琳娜;;基于二叉樹(shù)的散亂點(diǎn)集快速凸包算法[J];測(cè)繪科學(xué);2008年04期

4 胡金星,馬照亭,吳煥萍,潘懋;基于格網(wǎng)劃分的海量數(shù)據(jù)Delaunay三角剖分[J];測(cè)繪學(xué)報(bào);2004年02期

5 代莉;陳春華;聶焱;;在AutoCAD環(huán)境下不規(guī)則三角網(wǎng)構(gòu)建及等高線生成[J];地理空間信息;2011年02期

6 徐巍;孫志鵬;徐朋;宗婷婷;胡金剛;;基于LIDAR點(diǎn)云數(shù)據(jù)插值方法研究[J];工程地球物理學(xué)報(bào);2012年03期

7 胡金虎;;基于不規(guī)則三角網(wǎng)的高精度等值線生成方法[J];工程勘察;2011年02期

8 吳宇曉,張登榮;生成Delaunay三角網(wǎng)的快速合成算法[J];浙江大學(xué)學(xué)報(bào)(理學(xué)版);2004年03期

9 馬彩虹;戴芹;王建民;劉士彬;;基于分塊優(yōu)化的不規(guī)則三角網(wǎng)的快速構(gòu)成方法[J];計(jì)算機(jī)工程與應(yīng)用;2012年03期

10 石松,朱泉鋒,唐麗玉;四叉樹(shù)高效Delaunay三角網(wǎng)生成算法[J];計(jì)算機(jī)工程;2005年18期

相關(guān)博士學(xué)位論文 前1條

1 高剛毅;分布式地理信息系統(tǒng)研究[D];浙江大學(xué);2004年

相關(guān)碩士學(xué)位論文 前5條

1 宗大偉;Voronoi圖及其應(yīng)用研究[D];南京航空航天大學(xué);2006年

2 宋秋艷;不規(guī)則三角網(wǎng)及其可視化實(shí)現(xiàn)[D];中南大學(xué);2008年

3 杜丹蕾;帶約束條件的離散點(diǎn)不規(guī)則三角網(wǎng)生成[D];中南大學(xué);2008年

4 張熠斌;機(jī)載LiDAR點(diǎn)云數(shù)據(jù)處理理論及技術(shù)研究[D];長(zhǎng)安大學(xué);2010年

5 王琦;Lidar點(diǎn)云生成格網(wǎng)DEM模型的內(nèi)插算法研究[D];中國(guó)地質(zhì)大學(xué);2010年

本文編號(hào)：2408830