基于k-邻域密度的离散点云简化算法与实现

提出一种基于k-邻域密度(即k-邻域中的点云密度)的离散点云简化算法, 并给出了在三角网格重构中的实现. 该方法不仅可以保证实物模型重建后的整体轮廓, 而且在细节部分也较好地保持了局部形状特征. 三角网格重构的实验结果表明, 所给方法简单、 高效, 同时, 在实物模型平滑处与曲率变化较大处均取得了理想效果.     

点云三角化处理技术研究

点云的三角化处理是点云三维重构中必不可少的处理步骤,其处理效果直接决定了点云三维重构结果的好坏,而点云进行三角化时搜索半径r的参数设置决定了点云三角化的处理效果.针对该参数的取值及其对点云三角化结果的影响做了研究.首先对点云数据进行预处理,然后利用最小二乘法原理对点云进行平滑处理,最后将平滑处理后的点云利用贪婪三角化算法实现点云数据的三角网格化.结果表明,点云三角化处理技术在搜索半径r大于等于5倍采样间距(平均间距)时,能够快速准确地生成质量较好的点云三角模型.     

基于激光测量点云数据的五坐标加工刀轨生成

针对以往由点云构造曲面或三角网格，再根据曲面或网格生成刀轨的方法复杂、工作量大的问题，研究了直接从激光测量点云数据生成五坐标数控加工刀轨及干涉处理的方法．通过计算点云模型的曲率，确定切削步长和行距，采用基于点云的干涉检查模型，推导出干涉处理的解析式，得到了无干涉加工刀轨．实例表明，算法运行速度快，稳定可靠．     

一种三维重建技术中基于点云粗配准方法

伴随着计算机技术应用与三维扫描应用的发展,点云三维重建技术被普遍的应用到计算机辅助设计、虚拟现实、测量学、医学等各种领域.选取了斯坦福大学提供的点云数据作为研究对象,提出了从点云配准,点云降采样,点云滤波到重建三角面的实现方案.通过粗配准算法处理点云,使用精配准ICP算法;经过配准得到的点云降采样;采用双边滤波平滑点云;重建点云模型.通过对比斯坦福大学提供的重建后的模型,结果表明,本文的方法在点云三维重建方面有较好的表现.     

逆向工程三角网格优化研究

逆向工程中为了更好的进行曲面重构,提出了一种三角网格模型的优化方法.运用逆向工程软件Geomagic Studio能够很好的将测得的海量点云数据进行数据封装,并针对封装后的三角网格模型进行网格修复及优化为后续的NURBS曲面重构奠定基础.     

基于空间无序点云的层次构造三角化方法

描述了一种新的利用空间无序点云重构三维模型的算法,利用分层扫描的原理将无序的三维点云进行平面投影,使用矢量外边界扫描算法将点信息提取为线段信息,由于分层的有序性使得线段之间存在着良好的拓扑关系,经过在有序线段中提取拐点矢量,连接上下两层相关点,点模型就完成了三角化。该方法计算速度快,拓扑清晰,且不会出现失真(泊松表面重建)和空洞现象(区域增长法)。     

反求工程中散乱点云的数据预处理技术

提出了一种基于散乱点云的数据预处理方法.该方法包括四个部分:对散乱点云进行Dirichlet域分割并在此基础上进行三角剖分;在各个三角域中寻找中心点,以其为原点建立局部坐标系并采用正态分布模型进行噪声点删除;利用在三角网格上构建B-B曲面进行数据平滑处理;对漏测的数据点进行补全处理.数据点经过上述处理后能基本满足后续的曲面曲线的重构要求.     

装配式建筑平面激光点云数据线性特征提取方法

提取建筑物线性特征时，由于未对采集到的建筑物点云数据预处理，导致最终提取的建筑物线性特征存在完整度差、提取正确率低的问题，对此，提出装配式建筑平面激光点云数据线性特征提取方法。通过内设激光测距系统获取建筑物在三维向量的有效数据，采用非接触式几何支撑系统建立基于有效数据的空间向量模型，将该模型输入三维激光扫描仪的目标物体表面校正系统中，获取到建筑物的整体点云数据。利用Otsu目标检测法对获取的整体点云数据进行优化处理，采用改进IFFT算法建立基于优化数据的物像空间位姿表征模型，利用连续投影算法提取网格内部特征点并连接成线，完成建筑物点云数据线性特征的提取。实验结果表明，所提方法的装配式建筑平面激光点云数据线性特征提取清晰度高、完整度好，且建筑物线性特征的提取正确率最高可达100%，说明该方法具有实用性。     

基于线性八叉树的点云简化与特征提取研究

三维激光扫描技术以其数据的高精度与采集的高效率为空间信息的获取提供了一种全新的技术手段。而对点云数据的研究也成为近年的热点。本文尝试在线性八叉树建立点云数据空间索引的基础上,运用聚类法对点云进行数据简化。根据空间单元曲面变化量对点云进行分类,利用曲率分析的方法提取特征点,进而采用最小生成树算法进行特征边的连接,实现特征线的提取。     

基于线性八叉树的点云简化与特征提取研究

三维激光扫描技术以其数据的高精度与采集的高效率为空间信息的获取提供了一种全新的技术手段。而对点云数据的研究也成为近年的热点。尝试在线性八叉树建立点云数据空间索引的基础上,运用聚类法对点云进行数据简化。根据空间单元曲面变化量对点云进行分类,利用曲率分析的方法提取特征点,进而采用最小生成树算法进行特征边的连接,实现特征线的提取。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.