Boundary Detection in Particle‐based Fluids

This paper presents a novel method to detect free‐surfaces on particle‐based volume representation. In contrast to most particle‐based free‐surface detection methods, which perform the surface identification based on physical and geometrical properties derived from the underlying fluid flow simulation, the proposed approach only demands the spatial location of the particles to properly recognize surface particles, avoiding even the use of kernels. Boundary particles are identified through a Hidden Point Removal (HPR) operator used for visibility test. Our method is very simple, fast, easy to implement and robust to changes in the distribution of particles, even when facing large deformation of the free‐surface. A set of comparisons against state‐of‐the‐art boundary detection methods show the effectiveness of our approach. The good performance of our method is also attested in the context of fluid flow simulation involving free‐surface, mainly when using level‐sets for rendering purposes.     

Glyphs for Asymmetric Second‐Order 2D Tensors

Tensors model a wide range of physical phenomena. While symmetric tensors are sufficient for some applications (such as diffusion), asymmetric tensors are required, for example, to describe differential properties of fluid flow. Glyphs permit inspecting individual tensor values, but existing tensor glyphs are fully defined only for symmetric tensors. We propose a glyph to visualize asymmetric second‐order two‐dimensional tensors. The glyph includes visual encoding for physically significant attributes of the tensor, including rotation, anisotropic stretching, and isotropic dilation. Our glyph design conserves the symmetry and continuity properties of the underlying tensor, in that transformations of a tensor (such as rotation or negation) correspond to analogous transformations of the glyph. We show results with synthetic data from computational fluid dynamics.     

A Hierarchical Approach for Regular Centroidal Voronoi Tessellations

In this paper, we consider Centroidal Voronoi Tessellations (CVTs) and study their regularity. CVTs are geometric structures that enable regular tessellations of geometric objects and are widely used in shape modelling and analysis. While several efficient iterative schemes, with defined local convergence properties, have been proposed to compute CVTs, little attention has been paid to the evaluation of the resulting cell decompositions. In this paper, we propose a regularity criterion that allows us to evaluate and compare CVTs independently of their sizes and of their cell numbers. This criterion allows us to compare CVTs on a common basis. It builds on earlier theoretical work showing that second moments of cells converge to a lower bound when optimizing CVTs. In addition to proposing a regularity criterion, this paper also considers computational strategies to determine regular CVTs. We introduce a hierarchical framework that propagates regularity over decomposition levels and hence provides CVTs with provably better regularities than existing methods. We illustrate these principles with a wide range of experiments on synthetic and real models.     

Global Structure Optimization of Quadrilateral Meshes

We introduce a fully automatic algorithm which optimizes the high‐level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological optimization is highly desirable, since state‐of‐the‐art quadrangulation techniques lead to meshes which have an appropriate singularity distribution and an anisotropic element alignment, but usually they are still far away from the high‐level structure which is typical for carefully designed meshes manually created by specialists and used e.g. in animation or simulation. In this paper we show that the quality of the high‐level structure is negatively affected by helical configurations within the quadrilateral mesh. Consequently we present an algorithm which detects helices and is able to remove most of them by applying a novel grid preserving simplification operator (GP‐operator) which is guaranteed to maintain an all‐quadrilateral mesh. Additionally it preserves the given singularity distribution and in particular does not introduce new singularities. For each helix we construct a directed graph in which cycles through the start vertex encode operations to remove the corresponding helix. Therefore a simple graph search algorithm can be performed iteratively to remove as many helices as possible and thus improve the high‐level structure in a greedy fashion. We demonstrate the usefulness of our automatic structure optimization technique by showing several examples with varying complexity.     

Contouring Discrete Indicator Functions

We present a method for calculating the boundary of objects from Discrete Indicator Functions that store 2‐material volume fractions with a high degree of accuracy. Although Marching Cubes and its derivatives are effective methods for calculating contours of functions sampled over discrete grids, these methods perform poorly when contouring non‐smooth functions such as Discrete Indicator Functions. In particular, Marching Cubes will generate surfaces that exhibit aliasing and oscillations around the exact surface. We derive a simple solution to remove these problems by using a new function to calculate the positions of vertices along cell edges that is efficient, easy to implement, and does not require any optimization or iteration. Finally, we provide empirical evidence that the error introduced by our contouring method is significantly less than is introduced by Marching Cubes.     

SSD: Smooth Signed Distance Surface Reconstruction

We introduce a new variational formulation for the problem of reconstructing a watertight surface defined by an implicit equation, from a finite set of oriented points; a problem which has attracted a lot of attention for more than two decades. As in the Poisson Surface Reconstruction approach, discretizations of the continuous formulation reduce to the solution of sparse linear systems of equations. But rather than forcing the implicit function to approximate the indicator function of the volume bounded by the implicit surface, in our formulation the implicit function is forced to be a smooth approximation of the signed distance function to the surface. Since an indicator function is discontinuous, its gradient does not exist exactly where it needs to be compared with the normal vector data. The smooth signed distance has approximate unit slope in the neighborhood of the data points. As a result, the normal vector data can be incorporated directly into the energy function without implicit function smoothing. In addition, rather than first extending the oriented points to a vector field within the bounding volume, and then approximating the vector field by a gradient field in the least squares sense, here the vector field is constrained to be the gradient of the implicit function, and a single variational problem is solved directly in one step. The formulation allows for a number of different efficient discretizations, reduces to a finite least squares problem for all linearly parameterized families of functions, and does not require boundary conditions. The resulting algorithms are significantly simpler and easier to implement, and produce results of quality comparable with state‐of‐the‐art algorithms. An efficient implementation based on a primal‐graph octree‐based hybrid finite element‐finite difference discretization, and the Dual Marching Cubes isosurface extraction algorithm, is shown to produce high quality crack‐free adaptive manifold polygon meshes.     

火箭橇速度窗点火控制器方案

火箭橇试验是测试弹射救生装置和导弹飞行性能较好的手段,这些试验往往要求火工机构在火箭橇在预设点出速度达到预设数值时点火工作。而外场火箭橇试验中各种不确定因数都可能造成计算弹道与实际弹道存在较大误差,一旦速度误差超出范围,则该发次试验判为无效试验。由此带来的损失以数百万计。针对这种情况,设计了地面用基于CPLD的火箭橇速度窗,当检测到火箭橇速度大于或小于设定的速度限值时,切断地面点火电源,以较小的几枚火箭的损失换取弹射救生或导弹装置误动作带来的巨大损失。     

破碎刚体三角网格模型的断裂面分割

针对基于断裂面匹配的破碎刚体复原,提出了一种分割断裂面的方法。首先,根据相邻三角片法矢的夹角,将碎块外表面以棱边为界限分割成多张曲面;然后,根据曲面法矢的扰动大小和扰动图像,经过二次分割,将曲面区分为原始面和断裂面。实验结果表明,所提方法能够正确快速地提取出形状较复杂碎块的断裂面。     

VC^＋＋环境下利用SQL Server与Object ARX开发智能参数化刀具实体模型库

对VC^ ,SQL Server和AutoCAD相互通讯的技术进行深入研究,在此基础上利用AutoCAD的二次开发工具Object ARX完成了对刀具的参数化生成、模糊化选刀和智能化管理的刀具实体模型库系统的开发。     

（RbCl）108离子簇均相成核的分子动力学研究

分子动力学模拟测得熔融（RbCl)108离子簇在300K至600K温度时凝固的成核速率大于10^35m^-3s^-1,用均相成核的经典理论加以分析,估算得氯化铷离子簇的固液界面自由能σalT^1.4,用Grunasy提出的扩散界面理论加以分析,估算得扩展界面厚度约为0．195nm,σalT^0.97,2个理论在实验温度范围内没有明显判别,且均能较好地分子动力学模型的结果,但预测的较高温度下的成核速率有比较显著区别,因此进一步地研究将有助于鉴别它们。