Continuous Self‐Collision Detection for Deformable Surfaces Interacting with Solid Models

In this paper, we propose a new continuous self‐collision detection (CSCD) method for a deformable surface that interacts with a simple solid model. The method is developed based on the radial‐view‐based culling method. Our method is suitable for the deformable surface that has large contact region with the solid model. The deformable surface may consist of small round‐shaped holes. At the pre‐processing stage, the holes of the deformable surface are filled with ghost triangles so as to make the mesh of the deformable surface watertight. An observer primitive (i.e. a point or a line segment) is computed so that it lies inside the solid model. At the runtime stage, the orientations of triangles with respect to the observer primitive are evaluated. The collision status of the deformable surface is then determined. We evaluated our method for several animations including virtual garments. Experimental results show that our method improves the process of CSCD.     

Spatio‐temporal geometry fusion for multiple hybrid cameras using moving least squares surfaces

Multi‐view reconstruction aims at computing the geometry of a scene observed by a set of cameras. Accurate 3D reconstruction of dynamic scenes is a key component for a large variety of applications, ranging from special effects to telepresence and medical imaging. In this paper we propose a method based on Moving Least Squares surfaces which robustly and efficiently reconstructs dynamic scenes captured by a calibrated set of hybrid color+depth cameras. Our reconstruction provides spatio‐temporal consistency and seamlessly fuses color and geometric information. We illustrate our approach on a variety of real sequences and demonstrate that it favorably compares to state‐of‐the‐art methods.     

Robust Treatment of Degenerate Elements in Interactive Corotational FEM Simulations

We address the problem of robust and efficient treatment of element collapse and inversion in corotational FEM simulations of deformable objects in two and three dimensions, and show that existing degeneration treatment methods have previously unreported flaws that seriously threaten robustness and physical plausibility in interactive applications. We propose a new method that avoids such flaws, yields faster and smoother degeneration recovery and extends the range of well‐behaved degenerate configurations without adding significant complexity or computational cost to standard explicit and quasi‐implicit solvers.     

Scalable Realistic Rendering with Many‐Light Methods

Recent years have seen increasing attention and significant progress in many‐light rendering, a class of methods for efficient computation of global illumination. The many‐light formulation offers a unified mathematical framework for the problem reducing the full lighting transport simulation to the calculation of the direct illumination from many virtual light sources. These methods are unrivaled in their scalability: they are able to produce plausible images in a fraction of a second but also converge to the full solution over time. In this state‐of‐the‐art report, we give an easy‐to‐follow, introductory tutorial of the many‐light theory; provide a comprehensive, unified survey of the topic with a comparison of the main algorithms; discuss limitations regarding materials and light transport phenomena and present a vision to motivate and guide future research. We will cover both the fundamental concepts as well as improvements, extensions and applications of many‐light rendering.     

Sparse Localized Decomposition of Deformation Gradients

Sparse localized decomposition is a useful technique to extract meaningful deformation components out of a training set of mesh data. However, existing methods cannot capture large rotational motion in the given mesh dataset. In this paper we present a new decomposition technique based on deformation gradients. Given a mesh dataset, the deformation gradient field is extracted, and decomposed into two groups: rotation field and stretching field, through polar decomposition. These two groups of deformation information are further processed through the sparse localized decomposition into the desired components. These sparse localized components can be linearly combined to form a meaningful deformation gradient field, and can be used to reconstruct the mesh through a least squares optimization step. Our experiments show that the proposed method addresses the rotation problem associated with traditional deformation decomposition techniques, making it suitable to handle not only stretched deformations, but also articulated motions that involve large rotations.     

On‐the‐fly generation and rendering of infinite cities on the GPU

In this paper, we present a new approach for shape‐grammar‐based generation and rendering of huge cities in real‐time on the graphics processing unit (GPU). Traditional approaches rely on evaluating a shape grammar and storing the geometry produced as a preprocessing step. During rendering, the pregenerated data is then streamed to the GPU. By interweaving generation and rendering, we overcome the problems and limitations of streaming pregenerated data. Using our methods of visibility pruning and adaptive level of detail, we are able to dynamically generate only the geometry needed to render the current view in real‐time directly on the GPU. We also present a robust and efficient way to dynamically update a scene's derivation tree and geometry, enabling us to exploit frame‐to‐frame coherence. Our combined generation and rendering is significantly faster than all previous work. For detailed scenes, we are capable of generating geometry more rapidly than even just copying pregenerated data from main memory, enabling us to render cities with thousands of buildings at up to 100 frames per second, even with the camera moving at supersonic speed.     

IISPH‐FLIP for incompressible fluids

We propose to use Implicit Incompressible Smoothed Particle Hydrodynamics (IISPH) for pressure projection and boundary handling in Fluid‐Implicit‐Particle (FLIP) solvers for the simulation of incompressible fluids. This novel combination addresses two issues of existing SPH and FLIP solvers, namely mass preservation in FLIP and efficiency and memory consumption in SPH. First, the SPH component enables the simulation of incompressible fluids with perfect mass preservation. Second, the FLIP component efficiently enriches the SPH component with detail that is comparable to a standard SPH simulation with the same number of particles, while improving the performance by a factor of 7 and significantly reducing the memory consumption. We demonstrate that the proposed IISPH‐FLIP solver can simulate incompressible fluids with a quantifiable, imperceptible density deviation below 0.1%. We show large‐scale scenarios with up to 160 million particles that have been processed on a single desktop PC using only 15GB of memory. One‐ and two‐way coupled solids are illustrated.     

PVA基活性碳纤维的研制

探索了由民用大丝束聚乙烯醇纤维(PVAF)试制活性碳纤维(ACF)的可能性,以开辟新的原料路线,降低产品成本。PVAF首先用脱水剂处理,脱水剂浓度为10%(质量),然后在200—300℃进行热处理,处理后的纤维再经预氧化和碳化活化转化为ACF,ACF的收率为37.7%,比表面积为1050m~2/g。此外,还探索了用O_3处理PVAF。用差热、热失重和红外等手段对产物进行了表征,推论了相应的反应机理。结果表明:经适当处理的PVAF可制得具有较好吸附性能的ACF。     

管材超声波分层缺陷检测中盲区的构成探析

管材超声波分层检测作为控制产品质量的关键步骤,必须引起相关从业人员的重视,特别是要重点分析分层缺陷检测中盲区的构成原因和分布特征。只有这样,才能切实保证检测结果的准确性,更好地控制管材质量。通过对超声波分层缺陷检测的重要性进行阐释,分析了其中盲区的构成和分布等问题。     

无线传感网中基于成对节点探测不确定性的目标容错跟踪方法

针对无线传感器网络(Wireless Sensor Networks,WSN)中的节点在真实环境中的不可靠感知现象及其对目标跟踪精度的影响,首先分析计算了成对传感器节点感知存在的不确定区域及其边界,在此基础上,提出了一种基于成对节点探测不确定性的目标容错跟踪方法(Tracking with Pairwise Uncertainty of RSSI,TPU-RSSI),即通过匹配分组感知采样得到的感知向量(sampling vector)和跟踪区域划分面(face)的特征向量(signature vector)来进行移动目标容错跟踪。该方法在保持跟踪方法灵活性的基础上,能够减小由环境因素带来的跟踪误差。为了降低计算复杂度,提出了一种基于邻居面连接的启发式匹配算法。大量的仿真实验结果均表明,所提方法相比同类的其他方法具有更强的灵活性和更高的定位精度。