薄透镜成象快速调节技术

本文结合象差理论,分析了薄透镜成象的几个先路图,介绍了相应的快速调节技术．     

Transformation of a thin-walled solid model into a surface model via solid deflation

A simplified geometric model with lower dimensionality, such as a mid-surface model, is often preferred over a detailed solid model for the analysis process, if the analysis results are not seriously impacted. In order to derive a mid-surface model from a thin-walled solid model, in this paper, we propose a novel approach called the solid deflation method. In this method, a solid model is assumed to be created by using air to inflate a shell that comprises the surface of the solid model. First, the model is simplified by the removal of any detailed features whose absence would not alter its overall shape. Next, the solid model itself can be converted into a degenerate solid model with zero thickness. Finally, a surface model is generated by splitting large faces paired in the thinned solid model, selecting one face per pair for creating a sheet model, and sewing the selected faces. Using this method, a more practical and usable mid-surface model can be very efficiently generated from a solid model because it can circumvent not only the tedious trimming and extension processes of the medial axis transformation method but also the time-consuming patch joining process of the mid-surface abstraction approach.     

光纤陀螺输入轴失准角温度补偿研究

提高温度特性是光纤陀螺仪工程化的一个难题,温度补偿是解决该问题的一种有效方法。光纤陀螺与温度相关误差项主要为零漂和标度因数,输入轴失准角也是影响光纤陀螺应用的一个重要误差项。在大量试验的基础上,分析了光纤陀螺输入轴失准角误差产生机理,采用多项式拟合方法建立了输入轴失准角误差全温模型,对多套光纤陀螺进行了全温补偿。试验结果表明,输入轴失准角补偿前全温变化在2?10^-3rad数量级,补偿后全温变化小于3?10^-4rad,精度提高了近一个数量级,大大提高了光纤陀螺仪的全温性能。     

球面上的K最近邻查询算法

针对球面上数据对象点集的特征和K最近邻查询的需求,提出2种处理球面上K最近邻查询的算法:基于查询轴的K最近邻查询算法(PAM方法)和基于查询圆面的K最近邻查询算法(PCM方法).对2种算法进行实验比较,结果表明,PAM方法和PCM方法都适合处理球面上的最近邻查询问题,PAM方法在存储量和查询复杂度方面相对于PCM方法具...     

Distance functions and skeletal representations of rigid and non-rigid planar shapes

Shape skeletons are fundamental concepts for describing the shape of geometric objects, and have found a variety of applications in a number of areas where geometry plays an important role. Two types of skeletons commonly used in geometric computations are the straight skeleton of a (linear) polygon, and the medial axis of a bounded set of points in the k-dimensional Euclidean space. However, exact computation of these skeletons of even fairly simple planar shapes remains an open problem.In this paper we propose a novel approach to construct exact or approximate (continuous) distance functions and the associated skeletal representations (a skeleton and the corresponding radius function) for solid 2D semi-analytic sets that can be either rigid or undergoing topological deformations. Our approach relies on computing constructive representations of shapes with R-functions that operate on real-valued halfspaces as logic operations. We use our approximate distance functions to define a new type of skeleton, i.e, the C-skeleton, which is piecewise linear for polygonal domains, generalizes naturally to planar and spatial domains with curved boundaries, and has attractive properties. We also show that the exact distance functions allow us to compute the medial axis of any closed, bounded and regular planar domain. Importantly, our approach can generate the medial axis, the straight skeleton, and the C-skeleton of possibly deformable shapes within the same formulation, extends naturally to 3D, and can be used in a variety of applications such as skeleton-based shape editing and adaptive motion planning.     

Medial axis computation for planar free-form shapes

We present a simple, efficient, and stable method for computing—with any desired precision—the medial axis of simply connected planar domains. The domain boundaries are assumed to be given as polynomial spline curves. Our approach combines known results from the field of geometric approximation theory with a new algorithm from the field of computational geometry. Challenging steps are (1) the approximation of the boundary spline such that the medial axis is geometrically stable, and (2) the efficient decomposition of the domain into base cases where the medial axis can be computed directly and exactly. We solve these problems via spiral biarc approximation and a randomized divide & conquer algorithm.     

改进的形态学骨架提取算法

针对由传统最大圆盘骨架提取算法提取出的骨架连通性差且无法保持一致的单像素宽度问题,提出一种改进的形态学骨架提取算法。将连通性保持与形态学运算相结合,在收缩目标提取骨架的过程中通过引入虚拟骨架点实现骨架曲线连通性保持,而单像素宽度细化及伪分支剔除等后处理过程的引入则进一步提高骨架描述目标形状及拓扑特征的能力。相关仿真研究证明了该算法的有效性。     

关联规则的快速更新算法

针对基于支持度变化的最大频繁项集维护问题、频繁项集与最大频繁项集互转换时的维护问题,提出3种相应算法。在挖掘最大频繁项集的过程中不断调节支持度大小,以实现其快速更新。基于最大频繁项集子集的支持计数,将现有最大频繁项集转换为频繁项集。     

贯流式机组主轴密封水流量中断原因分析及处理

随着低水头径流式水电站的开发,灯泡贯流式机组凭借其投资低、安装工期短、检修方便等优势越来越被广泛应用。广西长洲水利枢纽贯流式水轮机主轴密封水流量中断成为了机组停机的主要原因。对事故的原因进行了分析,并从设计、制造和运行方面,对防止主轴密封水流量中断提出了几种防范措施,解决了主轴密封水流量中断造成机组停机的问题。     

Robust skeletonization using the discrete λ-medial axis

Medial axes and skeletons are notoriously sensitive to contour irregularities. This lack of stability is a serious problem for applications in e.g. shape analysis and recognition. In 2005, Chazal and Lieutier introduced the λ-medial axis as a new concept for computing the medial axis of a shape subject to single parameter filtering. The λ-medial axis is stable under small shape perturbations, as proved by these authors. In this article, a discrete λ-medial axis (DLMA) is introduced and compared with the recently introduced integer medial axis (GIMA). We show that DLMA provides measurably better results than GIMA, with regard to stability and sensibility to rotations. We give efficient algorithms to compute the DLMA, and we also introduce a variant of the DLMA which may be computed in linear-time.