Universal Rendering Sequences for Transparent Vertex Caching of Progressive Meshes

We present methods to generate rendering sequences for triangle meshes which preserve mesh locality as much as possible. This is useful for maximizing vertex reuse when rendering the mesh using a FIFO vertex buffer, such as those available in modern 3D graphics hardware. The sequences are universal in the sense that they perform well for all sizes of vertex buffers, and generalize to progressive meshes. This has been verified experimentally.     

Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem

It is proved that, for any r ∈ { 2n, 2n + 1,…, 3n−2} and only for such r, the polytope of a three-index axial assignment problem of order n, n ≥ 2, contains completely r-noninteger vertices (r-CNVs), i.e., vertices such that all their positive components are fractional and their number equals r. For each r ∈ {2n, 2n + 1,…, 3n −2}, all the types of r-CNVs are characterized and the combinatorial properties of completely r-noninteger vertices of the polytope are studied. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 33–44, January–February 2007.     

旋转固体火箭发动机统一流场计算

为了进一步研究旋转对固体火箭发动机工作的影响,采用RSM湍流模型对内孔燃烧、内孔与端面同时燃烧管状装药旋转固体火箭发动机统一流场进行了仿真。采用UDF编程给出质量入口边界,获得了旋转条件下发动机内流场结构参数特点,并给予理论说明。计算结果表明,内孔燃烧装药发动机切向速度流场类似于典型的Rankine涡,端面和内孔同时燃烧装药发动机切向速度流场呈现出Rankine涡和由端面燃烧引起的强迫涡的复杂组合涡;在发动机前封头和喷管喉部涡核切向速度峰值非常大,使燃烧室前封头和喷管喉部工作环境显著恶化;旋转使发动机燃烧室压力沿径向逐渐增大,强迫涡附近的压力梯度远大于推进剂表面的压力梯度。     

Depth-based complexity traces of graphs

In this paper we aim to characterize graphs in terms of a structural measure of complexity. Our idea is to decompose a graph into layered substructures of increasing size, and then to measure the information content of these substructures. To locate dominant substructures within a graph, we commence by identifying a centroid vertex which has the minimum shortest path length variance to the remaining vertices. For each graph a family of centroid expansion subgraphs is derived from the centroid vertex in order to capture dominant structural characteristics of the graph. Since the centroid vertex is identified through a global analysis of the shortest path length distribution, the expansion subgraphs provide a fine representation of a graph structure. We then show how to characterize graphs using depth-based complexity traces. Here we explore two different strategies. The first strategy is to measure how the entropies on the centroid expansion subgraphs vary with the increasing size of the subgraphs. The second strategy is to measure how the entropy differences vary with the increasing size of the subgraphs. We perform graph classification in the principal component space of the complexity trace vectors. Experiments on graph datasets abstracted from some bioinformatics and computer vision databases demonstrate the effectiveness and efficiency of the proposed graph complexity traces. Our methods are competitive to state of the art methods.     

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

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

与李代数A2相关的顶点算子代数N（k,0）及不可约模

介绍了仿射李代数A2的构造,并研究和构造了A2上Z＋-分次的顶点算子代数N（k,0）。再由A（V）理论算出了顶点算子代数L（1,0）不可约模L（1,μ）的分类情况。     

双向通信无人机集群领航顶点选取方法

领航顶点选取是关系到领航-跟随模式无人机集群等多智能体系统可控性的重要问题。以具有几十架个体的无人机集群为研究对象,针对领航顶点选取问题,基于Laplace矩阵的特征向量,提出关键集概念。从理论上证明2关键集、3关键集以及独立关键集的图特征。在此基础上,给出求无向网络最小关键集的CSA算法,通过数值仿真实验获得了不同规模、不同通信半径条件下无人机集群最小领航集的数值特征。     

异形坯连铸结晶器内三维流场的数值模拟

根据湍流理论及异形坯连铸的特点, 建立了异形坯结晶器三维流场数学模型, 对不同条件下的流场进行了数值模拟, 分析了水口结构和工艺参数变化时异形坯结晶器内涡心深度的变化规律及液面湍动能的分布状态. 结果表明 采用上倾式水口, 水口夹角为120°, 拉速为0.9m/s时, 结晶器内流场分布较为合理, 液面较稳定. 模拟结果与水模实验结果吻合较好. 该模型可对连铸过程进行离线分析, 确定最佳参数, 并可作为在线控制模型的基础.     

基于随机游走的大规模图中节点对采样算法

社会网络中的节点对采样可用于大规模社会网络的好友预测和用户兴趣识别.当整个网络的拓扑结构不完全或者随机选择用户的代价很高时,传统的均匀顶点采样方法的性能迅速下降.为此,提出了一种基于随机游走的大规模图中节点对采样算法.首先对社会网络的节点对采样进行了系统分析,对不同跳数下的节点对进行了定义;然后将社会网络转换成等价的网络图.新图中的顶点是原图中的边,新图中边的两个顶点是原图中含有相同顶点的两条边.最后,在新图上应用随机游走模型对节点对进行采样.实验结果表明,提出的方法统计误差小、执行效率高,性能明显优于均匀节点采样的相关算法.