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.     

视点相关的真实感三维风景区模拟研究与实现*

提出采用八叉树组织真实山体数据,根据视点距离采用不同的细节层次LOD表示山体各部分,并结合视觉剪裁和帧间相关性进一步减少绘制的山体,达到加速三维地形的绘制和漫游的目的。使用混合纹理映射、阴影渲染技术,并加入山谷中的水面模拟,生成具有真实感的大规模三维风景场景。实验结果表明该方法有效地减少了算法复杂度,易实现碰撞检测,大大提高了绘制效率,在PC机上能实时地生成高分辨率、具有真实感的场景,完全满足VR交互要求。     

一种超大规模地形场景的实时渲染算法

超大规模地形场景包含大量的数据,无法一次性载入内存进行实时渲染.基于Geometrical Mipmapping算法,结合动态调度技术,提出一种高效的超大规模地形场景实时渲染算法.算法对海量地形数据进行分块,在实时运行时,根据视点的位置动态地载入所需的地形块和释放无用的地形块,使得内存中的地形数据维持在一定范围内.然后,通过LOD技术和视域剔除对内存中的地形数据进行简化,大量减少送入GPU的三角形数量,从而达到实时渲染.实验结果表明,算法渲染速度快,内存开销较小,适合于超大规模地形场景的实时渲染.     

海量模型实时交互可视化技术综述

综述了海量模型实时交互可视化的最新研究进展,详细讨论了其中涉及的主要支撑技术,并对目前国内外典型的交互绘制系统进行比较和分析;最后,对今后的发展方向进行了展望。     

基于四叉树的分形地形实时动态生成算法

介绍一种结合分形算法与四叉树算法生成动态随机地形的新方法,并提出一种融合地形中点位移法及四叉树递归分割算法的实时优化算法,利用可见性剔除的简化策略和三角形扇的数据简化存储方式,解决地形绘制的裂缝、突跳问题,采用纹理混合贴图方式的渲染方法实现该层次细节模型的地形渲染。通过对该算法的实现和优化,在保证一定地形环境的视觉真实程度前提下,减少开销,从而达到提高实时渲染速度的目的。     

基于有效裁剪被遮挡单元的非规则数据场体绘制算法

提出了一种被遮挡单元的裁剪算法,以加速非规则数据场的体绘制过程。在基于一组平行切割平面的体绘制方法上,新算法通过对图像不透明度缓冲区中的值进行求平均操作,并将所计算的结果存储在一个与不透明度缓冲区间同样大小的平均不透明度缓冲区中,使得只需根据每一数据单元重心投影点在平均不透明度缓冲区中的值,就可得到此数据单元的可见性,从而有效裁剪掉被遮挡单元,降低需处理的数据量,加速体绘制过程。     

Occlusion Culling Algorithm Using Prefetching and Adaptive Level of Detail Technique

Recent yearsin graphics area many rendering al-gorithms have been developed to support a newset ofdemanding applications.An efficient way to speed uprenderingis to avoid rendering geometry that cannotbe seen from current viewpoint,such as geometryoutside the current viewfrustumand obscured by ge-ometrythat is closer tothe current viewer.The hard-est part of the visibility culling problem is how toavoid rendering geometry whichis obscured by closergeometry.Our approach will focus on this.In thi…     

基于遮挡单元裁剪的非规则数据场体绘制算法研究

通过建立一个与不透明度缓冲区同样大小的平均不透明度缓冲区，就可根据数据单元重心点在平均不透明度缓冲区内的值判定数据单元的可见性，从而使得在以物体空间为序的非规则数据场体绘制过程中直接将投影完全位于不透明区域内的数据单元裁剪掉，极大地减少需处理的数据量，加速绘制过程。     

Prophylactic use of an ultra-diluted complex on health,metabolism, and performance of weaned Holstein calves and its carryover effect up to first lactation

The objective of this study was to evaluate the effect of an ultra-diluted complex supplemented as a prophylactic strategy on the incidence risk of diseases, metabolism, and performance of weaned Holstein calves immediately after grouping. Additionally, the objective was to investigate the carryover effects on heifer-raising and first-lactation periods, in a double-blind, placebo-controlled trial. A total of 184 weaned Holstein calves (83 ± 7.9 d of life; 112.5 ± 11.7 kg of body weight; values are mean ± standard deviation) were allocated to 8 paddocks in a completely randomized block design experiment. During a 112-d period, animals received a total mixed ration and were randomly allocated into 2 groups: (1) CON: placebo-control (basal diet + calcium carbonate, top-dressed at 30 g/animal per day of placebo), or (2) UD: ultra-diluted complex (basal diet + TopVita-Real H, top-dressed at 30 g/animal per day of sulfur (10⁻⁶⁰) + viola tricolor (10⁻¹⁴) + caladium seguinum (10⁻³⁰) + zincum oxydatum (10⁻³⁰) + phosphorus (10⁻⁶⁰) + carduus marianus (10⁻⁶⁰) + colibacillinum (10⁻³⁰) + podophyllum (10⁻³⁰) + vehicle: calcium carbonate; quantum sufficit 1 kg). Incidence risk of diseases, number of days with disease, and mortality events were recorded daily. Performance measurements and blood collection were carried out at enrollment and every 28 d until the end of the study period. The incidence risk of digestive problems was higher for the CON group. Additionally, the CON group had higher cumulative number of days per calf affected by tick-borne disease. Blood analysis revealed that CON calves had increased mean corpuscular hemoglobin amount and concentration than UD calves on d 28 after enrollment and had increased serum albumin and total protein concentration on d 84. Furthermore, higher albumin to globulin ratio was found in CON calves than in those of UD group at enrollment; however, on d 56, the inverse was observed. On d 28 after enrollment, CON calves had increased serum cortisol concentration. Regarding body measurements, higher withers height and body depth were detected in UD calves, on d 28 and d 84, respectively. Finally, higher culling risk was observed in the CON group during the heifer-raising period. In conclusion, a lower incidence risk of digestive problems and days with tick-borne disease were detected in the UD group. Additionally, systemic inflammation was improved by UD complex based on circulating inflammation and stress biomarkers on specific days after enrollment. However, UD product did not improve performance at the post-weaning, heifer-raising, and first-lactation periods.     

View Dependent Sequential Point Trees

Sequential point trees provide the state-of-the-art technique for rendering point models, by re-arranging hierarchical points sequentially according to geometric errors running on GPU for fast rendering. This paper presents a view dependent method to augment sequential point trees by embedding the hierarchical tree structures in the sequential list of hierarchical points. By the method,two kinds of indices are constructed to facilitate the points rendering in an order mostly from near to far and from coarse to fine. As a result, invisible points can be culled view-dependently in high efficiency for hardware acceleration, and at the same time, the advantage of sequential point trees could be still fully taken. Therefore, the new method can run much faster than the conventional sequential point trees, and the acceleration can be highly promoted particularly when the objects possess complex occlusion relationship and viewed closely because invisible points would be in a high percentage of the points at finer levels.