資源描述:
《三維激光掃描點(diǎn)云數(shù)據(jù)處理及應(yīng)用技術(shù)》由會(huì)員上傳分享,免費(fèi)在線閱讀,更多相關(guān)內(nèi)容在行業(yè)資料-天天文庫(kù)。
1、南京理工大學(xué)碩士學(xué)位論文三維激光掃描點(diǎn)云數(shù)據(jù)處理及應(yīng)用技術(shù)姓名:袁夏申請(qǐng)學(xué)位級(jí)別:碩士專(zhuān)業(yè):系統(tǒng)工程指導(dǎo)教師:王建宇20060601南京理工大學(xué)碩士學(xué)位論文三維激光掃描點(diǎn)云數(shù)據(jù)處理及應(yīng)用技術(shù)摘要采用三維激光掃描技術(shù)可以直接得到真實(shí)物體表面的空間采樣點(diǎn),即點(diǎn)云數(shù)據(jù),利用點(diǎn)云數(shù)據(jù)即可以重構(gòu)三維物體表面。這種建模方法采用非接觸測(cè)量,速度快,精度高,真實(shí)感強(qiáng),不受表面復(fù)雜度影響。三維掃描及相關(guān)數(shù)據(jù)建模技術(shù)近十幾年來(lái)發(fā)展迅速,在很多領(lǐng)域已經(jīng)投入工程應(yīng)用。本論文根據(jù)點(diǎn)云數(shù)據(jù)重建過(guò)程中的建模流程總結(jié)點(diǎn)云數(shù)據(jù)處理中的關(guān)鍵技術(shù),包括多視點(diǎn)云
2、拼接算法、點(diǎn)云網(wǎng)格化算法、模型簡(jiǎn)化算法及多分辨率表示等,并對(duì)平面剖分算法進(jìn)行仿真實(shí)驗(yàn)。點(diǎn)云簡(jiǎn)化和網(wǎng)格化算法中常常需要得到散亂點(diǎn)云的局部拓?fù)湫畔?,其中置近鄰是最常用的。以往的置近鄰搜索算法面向點(diǎn)云數(shù)據(jù)的比較少,搜索效率不能適應(yīng)海量點(diǎn)云數(shù)據(jù),針對(duì)這個(gè)問(wèn)題,本論文研究了點(diǎn)云數(shù)據(jù)置近鄰搜索算法,提出兩種針對(duì)點(diǎn)云數(shù)據(jù)的快速置近鄰搜索算法:可變參數(shù)單坐標(biāo)軸搜索算法和基于Morton碼的置近鄰搜索算法。論文結(jié)合實(shí)驗(yàn)數(shù)據(jù)分析算法效率。將這兩種足近鄰搜索算法應(yīng)用于點(diǎn)云數(shù)據(jù)簡(jiǎn)化,取得較好效果。:工程應(yīng)用方面,本論文較全面的總結(jié)了目前三維信息獲
3、取技術(shù)軟硬件發(fā)展現(xiàn)狀。使用奧地利Riegl公司出品的LMS.Z210i型地面三維激光掃描儀完成空間數(shù)據(jù)獲取,并針對(duì)不同應(yīng)用進(jìn)行點(diǎn)云數(shù)據(jù)后期建模。通過(guò)實(shí)例分析三維激光掃描技術(shù)在雕塑、單體建筑和大規(guī)模復(fù)雜結(jié)構(gòu)古代建筑群應(yīng)用領(lǐng)域的優(yōu)點(diǎn)及局限性,總結(jié)使用三維激光掃描儀建模的經(jīng)驗(yàn)。關(guān)鍵訶,三維激光掃描散亂點(diǎn)云三維表面重建置近鄰第1頁(yè)碩士論文AbstractWeCallgetsampfingpointsofrealobjects’surfacebyusing3Dlaserscannel'.Thedataofthesesamplingp
4、ointsafecalledunorganizedcloudpointsandweCallrcconsll"uctiontherealsurfaceofobjectsfromthiskindofdata.ComparewitIltraditionalmodelingwaysthismethordusingno-touchingineaslll-etechnology.With3Dlaserscantechnologywecangetfastermodelingspeed,higherprecisionandbetterth
5、irddimensioilthantraditionalways.3Dlaserscanandmodelingtechnologyisdevelopingfastsince1980softhelastcentury.Todayithasbeenputinapplicationinmanyfields.Thispapersummarizeskeyteclmologyofcloudpointsprocessingwhichincludregistrationofmultiplerangecloudpoints,triangul
6、ation,simplificationandmultiresolutionanalysisofmodels.ThearithmeticsofsimplificationandtriangulationarealwaysneedinformationofK-nearestnel‘ghborsofcloudpointsbuttraditionalK-nearestneighborssearchingarithmetics’efficiencyalenothigllenoughtOdealwithdatatypeofcloud
7、points.ThispaperproposestWOfastK—nearestneighborssearchingarithmetics:parameteradjustablesingleaxessrarchingarithmeticand耐thrnedcbasedonMorton-codeofcloudpoints.WeUSethesetwOarithmeticstOsimplifycloudpointsandgetgoodresults.Wesummarizethede,Jelopmentofsoftwareandh
8、ardwarewhichaIeusedtOsample3Dsurfaceinformadonofrealobjects.ByusingtypeRieglLMS—Z210ilaserscannerwegetcloudpointsdataandthenwe.maketexturedpolygonmodelf