海量三维点云图割构网

针对现有海量点云数据构网占用内存较大、精准度较低等问题,该文基于图割构网与八叉树划分思想,提出一种海量点云数据三维构网算法。首先对点云数据构建八叉树索引,然后利用图割构网算法对叶子节点点云数据进行构网,最后通过网格合并操作实现最终网格生成。该算法能够自适应划分点云数据文件,并可以利用多线程动态调度图割构网和网格合并子线程,降低内存消耗的同时提高了运行效率。利用多组点云数据进行实验,结果表明,该文算法相对于经典的MVE算法在内存消耗、精度和完整度上都具有一定的优势。     

Delaunay三角网生长法的一种改进方法

为了提高Delaunay三角网的构建速度,本文对三角网生长法进行了改进,提出了一种基于生长法的"弧带搜索排除"方法,通过一系列的圆弧将离散点区域划分成几个弧带,构网时,规定只可在当前弧带搜索第三点,该弧带离散点搜索完毕后进入下一弧带,如此循环。采用VC++6.0加以实现。测试表明,该方法能够加快构网速度,生成的三角形形状良好,具有一定的实际效用。     

一种基于三角网扩张法的Delaunay三角网逐块归并算法

本文中提出一种基于三角网扩张法的不规则三角网的逐块归并算法,它采用按横向或纵向对离散点集切割分块,对各子块用三角网扩张法构建Delaunay三角网,最后用三角网扩张法依次将相邻的子网合并。该算法采用的子集分块的做法使构网时的搜索范围减小,在数据量较大时避免了计算时间随点数的指数次增加,同时在构网时也能保证三角形邻接关系的正确维护。     

高铁轨道基准网3维构网测量及其平差方法

针对当前高速铁路轨道基准网存在的不足,提出了一种基于3维自由测站交会构网的轨道基准网测量及其数据处理的新方法。首先采用边角网间接平差的严密精度估算方法,对轨道基准网的点间相对精度进行仿真计算;然后结合西南交通大学轨道基准网实验网实测数据,采用自检校3维网平差方法进行数据处理。通过仿真计算和对实验数据的计算分析,认为构网法可以用于轨道基准网3维网测量及其数据处理。而且该方法严谨、效率更优,可供有关部门参照和借鉴。     

基于搜索范围动态确定TIN的一种构建算法

为了提高不规则三角网的构网效率,提出一种改进算法,该算法执行效率高,构网速度快,实现较简单,并用VC 6.0编程语言对算法进行实现,最后用实验数据对算法进行了测试。     

城市控制点成果管理系统的研究与设计

本文结合目前我国城市控制测量成果管理的现状，论述了建立控制点数据管理系统的必要性和可行性，提出了系统的设计方案和数据结构，对控制网号、控制点号的编码、控制网构网数据的描述、控制点点之记的处理等问题作了详细的探讨，并采用ＦｏｘｐｒｏｆｏｒＷｉｎｄｏｗｓ编程加以实现，该系统全、界面新图文并茂，实现了对控制点成果全面的动态的、科学的管理。     

一种基于动态正方形的TIN的构建算法

为了提高不规则三角网的构网效率,提出了一种改进算法,该算法执行效率高,构网速度快,实现较简单,并用VC 6.0编程语言对算法进行实现,最后用实验数据对算法进行了测试.     

约束Delaunay三角网生成算法研究

对约束Delaunay三角网的构建算法进行研究,并提出一种约束Delaunay 三角网生成算法,它充分利用分治算法与生长算法的优点,对离散点、构网中实时生成的边及三角形采用分块进行网格索引,有效地减少了搜索目标点、边及三角形的时间,从而提高构网速度.     

基于球面投影的单站地面激光扫描点云构网方法

为正确判断点与点之间的邻接关系，结合单站地面激光扫描点云数据的特性，提出了利用球面投影对其构建三角网的方法；讨论了球面Delaunay构网方法的若干细节；采用球面有向搜索和球面LOP局部优化算法，提高了构网时间效率；实验表明本方法能快速、有效的对单站激光扫描点云构网。相似文献   

一种基于GPU Tessellation的地形无缝绘制算法

针对传统多分辨率地形绘制算法构网速度慢、T型裂缝不易处理等问题,提出了一种GPU（graphic processing unit）构网的地形无缝绘制算法。首先,引入实时网格细分（tessellation）技术,将地形构网分为CPU粗粒度Tile网格构建和GPU细粒度Patch网格细分两个阶段;然后,Tile网格采用基于视距的细节层次模型进行LoD层次选择,Patch采用基于屏幕空间投影误差的细节层次模型完成网格细分,兼顾了视距和地形粗糙度对地形绘制的影响,实现了地形细节层次的自适应选择;最后,应用C++语言和DirectX 11工具,设计开发了相应的可视化实验系统。实验结果表明,该方法实现了多分辨率地形的自适应无缝表达,保证了地形网格的连续性;并通过合理平衡CPU-GPU负担,显著提升了地形渲染效率。     

基于小波影像金字塔的影像自动匹配

数字影像高精度快速匹配是遥感影像3维信息提取的关键技术之一，文中对如何实现数字影像自动化匹配进行了研究，提出了一种基于小波影像金字塔的数字影像自动匹配方法。该方法在生成小波影像金字塔的基础上，利用交叉相关算法实现不同影像金字塔同一层影像间的匹配，利用视差控制将同名点从金字塔高层影像向低层影像进行传递。利用该方法对具体的SPOT影像进行了实验，表明基于小波影像金字塔的数字影像自动匹配方法具有较好的效果。     

结合全站式三维扫描与建筑设计坐标的复杂曲面检测

针对赛道复杂双曲面结构的高精度要求,以及无BIM模型加以参照这一现状,本文以北京冬奥会雪车雪橇赛道为例,首先采用全站式三维激光扫描仪对赛道混凝土喷射形成的曲面进行扫描,并结合建筑设计坐标完成夹具剖面特征点检测;然后依据设计三维坐标进行建模;最后将模型与扫描点云数据进行对比检测,生成三维色谱图,以掌握任意点的偏差值。结果表明,该方法既能进行关键特征点位的检测,又能全面掌握整个复杂曲面的偏差情况,满足测量的高精度要求,可为今后此类复杂曲面检测工程提供思路与技术参考。     

Lensphoto系统在3维重建中的应用及若干问题探讨

对多基线数字近景摄影测量理论在3维重建应用中的注意事项及遇到的若干问题进行了初步探讨。文章以青铜塑像为例,对3维重建中外业布设控制点时的注意事项进行了阐述,并针对后期点云处理和纹理粘贴时遇到的问题进行了探讨。事实证明,该方法在3维重建中不仅具有较高的精度,同时还能以更经济的方法迅速得到同3维激光扫描相媲美的点云数量,为保护文物的3维重建提供了有效的方法。     

基于全景图的3维实景制作及其与GIS集成研究

3维实景技术是一种基于图像绘制的虚拟现实技术,使用真实的照片展现场景达到沉浸式虚拟漫游的效果,提供给用户良好的交互性。本文提出了一种利用全景图制作3维实景并将其与GIS集成的方法:首先对拍摄的鱼眼照片进行球面投影,然后配准拼接成球面全景图,利用全景图制作3维场景,实现3维场景的漫游并将3维实景集成于已有的GIS系统。本文以华东师范大学校园3维实景漫游系统及基于Google Maps的3维实景地图开发为例,介绍方法流程。与传统的2维地图相比,3维实景地图更加直观且更具真实性。     

Total 3D‐viewshed Map: Quantifying the Visible Volume in Digital Elevation Models

The 3D perception of the human eye is more impressive in irregular land surfaces than in flat land surfaces. The quantification of this perception would be very useful in many applications. This article presents the first approach to determining the visible volume, which we call the 3D‐viewshed, in each and all the points of a DEM (Digital Elevation Model). Most previous visibility algorithms in GIS (Geographic Information Systems) are based on the concept of a 2D‐viewshed, which determines the number of points that can be seen from an observer in a DEM. Extending such a 2D‐viewshed to 3D space, then to all the DEM‐points, is too expensive computationally since the viewshed computation per se is costly. In this work, we propose the first approach to compute a new visibility metric that quantifies the visible volume from every point of a DEM. In particular, we developed an efficient algorithm with a high data and calculation re‐utilization. This article presents the first total‐3D‐viewshed maps together with validation results and comparative analysis. Using our highly scalable parallel algorithm to compute the total‐3D‐viewshed of a DEM with 4 million points on a Xeon Processor E5‐2698 takes only 1.3 minutes.     

利用激光干涉测距三维网的加权秩亏自由网平差

激光跟踪仪在激光干涉测距模式下,其测距精度要远远高于测角精度,利用极坐标测量的空间点坐标精度主要受测角误差的影响,利用激光跟踪仪的高精度激光干涉测距值构成空间三维激光干涉测边网,消除测角误差对空间点位的影响,采用基于重心基准的加权秩亏网平差模型进行整网平差。定向点坐标近似值采用极坐标方法确定,测站中心坐标近似值采用距离后方交会解算,通过附加约束矩阵精密求解测站点和定向点的三维坐标值。实际计算结果表明,该模型在12m测量范围内将激光跟踪仪的点位精度由87μm(标称值)提高到了27μm。     

Multi-view dense matching supported by triangular meshes

We present a new procedure to compute dense 3D point clouds from a sequential set of images. This procedure is considered as a second step of a three-step algorithm for 3D reconstruction from image sequences, whose first step consists of image orientation and the last step is shape reconstruction. We assume that the camera matrices as well as a sparse set of 3D points are available and we strive for obtaining a dense and reliable 3D point cloud. Three novel ideas are presented: (1) for sparse tracking and triangulation, the search space for correspondences is reduced to a line segment by means of known camera matrices and disparity ranges are provided by triangular meshes from the already available points; (2) triangular meshes from extended sets of points are used for dense matching, because these meshes help to reconstruct points in weakly textured areas and present a natural way to obtain subpixel accuracy; (3) two non-local optimization methods, namely, 1D dynamic programming along horizontal lines and semi-global optimization were employed for refinement of local results obtained from an arbitrary number of images. All methods were extensively tested on a benchmark data set and an infrared video sequence. Both visual and quantitative results demonstrate the effectiveness of our algorithm.     

Precise photorealistic visualization for restoration of historic buildings based on tacheometry data

This paper puts forward a 3D reconstruction methodology applied to the restoration of historic buildings taking advantage of the speed, range and accuracy of a total geodetic station. The measurements representing geo-referenced points produced an interactive and photorealistic geometric mesh of a monument named ‘Neoria.’ ‘Neoria’ is a Venetian building located by the old harbor at Chania, Crete, Greece. The integration of tacheometry acquisition and computer graphics puts forward a novel integrated software framework for the accurate 3D reconstruction of a historical building. The main technical challenge of this work was the production of a precise 3D mesh based on a sufficient number of tacheometry measurements acquired fast and at low cost, employing a combination of surface reconstruction and processing methods. A fully interactive application based on game engine technologies was developed. The user can visualize and walk through the monument and the area around it as well as photorealistically view it at different times of day and night. Advanced interactive functionalities are offered to the user in relation to identifying restoration areas and visualizing the outcome of such works. The user could visualize the coordinates of the points measured, calculate distances and navigate through the complete 3D mesh of the monument. The geographical data are stored in a database connected with the application. Features referencing and associating the database with the monument are developed. The goal was to utilize a small number of acquired data points and present a fully interactive visualization of a geo-referenced 3D model.     

摄影测量系统精度测试新方法

根据经纬仪测量系统点位真实精度的经验值和分别用工业摄影测量系统与经纬仪测量系统测量出的点位进行公共点转换得出的差值,来估计工业摄影测量系统测量的点位精度,从而提供一种检测工业摄影测量系统精度的新方法。分别使用INCA3与Nikon D2H相机试验,发现INCA3相机的精度大约是Nikon D2H精度的2倍。