三角旋转活塞发动机缸体型线研究

根据三角旋转活塞发动机运动几何原理 ,详细分析了缸体型线。缸体的实际型线是双弧外摆线的等距曲线 ,并由此导出其数学表达式。本文进一步说明了两种几何运动实现方式 ,分析了参数的几何意义 ,并给出其表达式。     

网格曲面中孔洞的光滑填充算法研究

三角网格模型是几何描述的一种重要形式，有着广泛的应用。但三角网络模型常常会存在孔洞缺陷。这些孔洞的存在一方面影响视觉效果，另一方面会影响许多后续的操作，如快速原型制造、有限元分析等，因此有必要对这些孔洞进行修补。目前绝大多数孔洞填充算法是将网格模型中的孔洞提取成空间多边形，并对孔洞多边形进行三角化。这种处理方法的主要缺陷是没有考虑网格曲面在孔洞附近的几何形态，因而填充部分不能与整个曲面光滑地融为一体。笔者提出了一种三角网格曲面中孔洞的光滑填充算法。该算法根据孔洞周围网格曲面的几何信息来增加孔洞内部的采样点，然后再对增加的采样点进行三角化，较好地解决了填充部分与整体曲面光滑连接的问题。     

基于地震道时频分析的地层结构解析原理和方法

 地震时频分析是通过对地震信号采用多种数学变换，实现从时频域角度对信号的局部特征进行分解，剖析信号细微特征所对应的地层结构。在应用地震时频分析技术过程中，人们对于这项技术能否真正有效地解决实际地质问题存在许多争论。本文从时频原理综合分析的角度出发，对地震道时频谱中各种频率特性参数和时频旋回直接转化成对地层结构逐级、分步的解析方法进行了较深入的探讨。研究认为时频分析原理不仅是对地震数据进行特殊数学变换，实现对信号的分解，而且充分利用了地层厚度的调谐效应及岩性调谐效应；时频谱与地质结构特征之间的良好响应关系为地震地质精细解释提供了直观的依据。     

How disorder can diminish avalanche risks: effect of size distribution

We study the behavior of disk assemblies with a variable disorder distribution. The packing is first consolidated and then continuously tilted very slowly. The amount of displaced disks for each tilted angle is recorded. Large displacements of the disks can occur due to some local or global mechanical instabilities. The definition of neighboring disks is based on radical (extension of Voronoï) tessellation rules to decompose, in a unique and perfectly defined manner, the two-dimensional space for polydisperse disks. In this way, by comparing the characteristics of stability for one disk to the neighboring ones for local ordered cluster, we can predict the global amount of displaced disks. Some tilting cycles have been performed to check the correlation between the instability of the packing structure (collective displacements) with micro and macro order parameters.     

VB与VC优化配合在安全监察软件系统中的应用

安全监察是矿山安全中很重要的环节。利用VC的强大计算功能和VB的编程简单性采用VB与VC优化配合使用的方法开发安全监察软件系统是快速、简单、高效的设计方法。文章对系统的整体结构和信息流程作了简要的介绍，并对系统的每个部分各以一个例子进行简单的阐述。     

Feature-Adaptive Rendering of Loop Subdivision Surfaces on Modern GPUs

We present a novel approach for real-time rendering Loop subdivision surfaces on modern graphics hardware. Our algorithm evaluates both positions and normals accurately, thus providing the true Loop subdivision surface. The core idea is to recursively refine irregular patches using a GPU compute kernel. All generated regular patches are then directly evaluated and rendered using tile hardware tessellation unit. Our approach handles triangular control meshes of arbitrary topologies and incorporates common subdivision surface features such as semi-sharp creases and hierarchical edits. While surface rendering is accurate up to machine precision, we also enforce a consistent bitwise evaluation of positions and normals at patch boundaries. This is particularly useful in the context of displacement mapping which strictly requires inatching surface normals. Furthermore, we incorporate efficient level-of-detail rendering where subdivision depth and tessellation density can be adjusted on-the-fly. Overall, our algorithm provides high-quality results at real-time frame rates, thus being ideally suited to interactive rendering applications such as video games or authoring tools.     

Triangle strings: Structures for augmentation of vertex-disjoint triangle sets

Vertex-disjoint triangle sets (triangle sets for short) have been studied extensively. Many theoretical and computational results have been obtained. While the maximum triangle set problem can be viewed as the generalization of the maximum matching problem, there seems to be no parallel result to Berge's augmenting path characterization on maximum matching (C. Berge, 1957 [1]). In this paper, we describe a class of structures called triangle string, which turns out to be equivalent to the class of union of two triangle sets in a graph. Based on the concept of triangle string, a sufficient and necessary condition that a triangle set can be augmented is given. Furthermore, we provide an algorithm to determine whether a graph G with maximum degree 4 is a triangle string, and if G is a triangle string, we compute a maximum triangle set of it. Finally, we give a sufficient and necessary condition for a triangle string to have a triangle factor.     

基于STL文件的Laplacian网格优化算法

针对直接重构得到且以STL文件格式存储的网格模型质量不高的问题, 提出了一种基于Laplacian坐标的网格模型全局优化算法。该算法在提高三角面片质量的同时可以很好地保持原网格模型的局部几何特征, 其核心思想是通过在最小二乘意义下求解由权重控制的包含顶点位置和拉普拉斯坐标双重约束的线性系统来对网格顶点进行重新定位。从实验结果可以看出, 该算法较以往的Lapacian优化算法在对网格细节特征的保持上有一定优势。     

改进Delaunay三角剖分算法

针对传统Delaunay算法对非凸三维曲面剖分结果不理想,提出了基于凸划分的改进Delaunay三角剖分算法．研究了复杂曲面剖分的特性,定义了非凸集合凸划分定理,对任意曲面相对投影平面进行划分．利用一组正交平面对任意复杂曲面的划分,通过变换域对曲面进行了Delaunay三角剖分．实验结果表明,改进算法能够在正交平面对头面数据集合进行正确凸划分,在投影平面改进Delaunay三角剖分结果正确,鲁棒性明显增强,并与理论分析一致,验证了改进算法的正确性和有效性．     

一种基于Voronoi图求解车辆路径问题的混合启发式算法

针对由多个配送中心和多个客户点组成的物流网络中的车辆路径问题,提出了一种基于“集群第一,路线第二”的路径优化策略,即首先使用Voronoi分割对配送区域进行划分,然后引入综合插入算法和变邻域搜索算法的混合启发式算法求解配送区域内车辆路径问题。通过算例和应用系统的分析与验证表明,该混合算法既能获取质量较优解,同时也具有较好的实时性,能较好地满足实际应用需求。