基于包围盒和空间分解的碰撞检测算法

文中提出一种基于包围盒和空间分解的碰撞检测算法,用以解决软体的碰撞检测。算法使用AABB包围盒做初步检测,确定可能发生碰撞的物体。再根据包围盒的重叠情况缩小可能发生碰撞的区域,利用哈希表作为数据储存结构进行空间分解,将物体包围盒重叠区域的基本几何元素的空间网格映射到哈希表中,将碰撞区域缩小到基本几何元素,最后用基元碰撞检测找出具体碰撞点。由于前期AABB包围盒的处理减少了空间分解阶段需要映射的基本几何元素数量,该算法具有较高的运算速度。     

A Projective Framework for Polyhedral Mesh Modelling

We present a novel framework for polyhedral mesh editing with face‐based projective maps that preserves planarity by definition. Such meshes are essential in the field of architectural design and rationalization. By using homogeneous coordinates to describe vertices, we can parametrize the entire shape space of planar‐preserving deformations with bilinear equations. The generality of this space allows for polyhedral geometric processing methods to be conducted with ease. We demonstrate its usefulness in planar‐quadrilateral mesh subdivision, a resulting multi‐resolution editing algorithm, and novel shape‐space exploration with prescribed transformations. Furthermore, we show that our shape space is a discretization of a continuous space of conjugate‐preserving projective transformation fields on surfaces. Our shape space directly addresses planar‐quad meshes, on which we put a focus, and we further show that our framework naturally extends to meshes with faces of more than four vertices as well.     

General triangular midpoint subdivision

In this paper, we introduce triangular subdivision operators which are composed of a refinement operator and several averaging operators, where the refinement operator splits each triangle uniformly into four congruent triangles and in each averaging operation, every vertex will be replaced by a convex combination of itself and its neighboring vertices. These operators form an infinite class of triangular subdivision schemes including Loop's algorithm with a restricted parameter range and the midpoint schemes for triangular meshes. We analyze the smoothness of the resulting subdivision surfaces at their regular and extraordinary points by generalizing an established technique for analyzing midpoint subdivision on quadrilateral meshes. General triangular midpoint subdivision surfaces are smooth at all regular points and they are also smooth at extraordinary points under certain conditions. We show some general triangular subdivision surfaces and compare them with Loop subdivision surfaces.     

优化变形能的平面多边形同构剖分

平面多边形间的同构三角剖分是平面形状渐进过渡与插值的基础,降低对应三角形的变形程度是获得高质量应用的关键.文中提出一种基于变形能优化的2个平面多边形的同构剖分算法,其中包含同构剖分生成和变形能最小化2个模块.首先根据用户指定的对应特征点对多边形进行顶点重采样,得到顶点一一对应的2个多边形;然后利用带约束的Delaunay剖分对其中的一个多边形进行三角化,得到源网格;再用重心坐标将源网格的内部顶点嵌入到另一个多边形得到同构剖分(目标网格);最后逐一检查三角形的变形能,对源网格中变形能超过阈值的三角形进行细分,用同构剖分模块生成新的目标网格.实验及数据统计分析表明,该算法可以得到较好的同构三角剖分,提升网格质量,并能很好地避免纹理细节失真.     

基于Loop细分算法的人体模型网格平滑

网格平滑是实现三维模型离散造型的主要方法。为了实现数字人体几何模型的光顺效果,本文提出一种基于Loop细分算法的三维人体模型的网格平滑方法。细分曲面是用低分辨率的控制网格和定义在控制网格上的一种细分规则来表示曲面的,它能有效改善三维人体几何模型的表面不光滑以及分辨率低的缺点。实验证明,该方法对基于参数化建模方法的、多曲率网格人体模型取得了很好的效果,实现简单高效,特征保持效果也很好。     

有限差分法在二维位场延拓的应用

采用第一类边界值条件下有限差分矩形等距网格法,对位场求解区进行网格剖分,探讨有限差分方程的建立、建模和计算原理。在同一种模型建立的差分方程下,使用Jacobian迭代和全选主元高斯消去法进行求解,统计计算时间和迭代次数,比较两者的均方误差。不同模型计算结果显示,两者求解结果基本吻合。     

基于双CPU的太阳能跟踪系统的研究

从提高太阳能电池板的输出功率出发,提出了基于双CPU控制方式的太阳能跟踪系统。系统采用俯仰-水平双轴控制,以单片机STC12C2052AD为光电控制单元的核心处理器,以混合式步进电机为执行机构,以TMS320F2812为核心控制器件的三相正弦波细分驱动器实现了混合式步进电机的精确定位。实验表明系统运行稳定,具有很高的实用价值。     

浅述宁夏大地构造单元划分

宁夏大地构造单元的划分是在系统收集与综合已有研究成果的基础上,对宁夏区内沉积建造构造、侵入岩浆构造、变质建造构造和大型变形构造等进行了分析研究,对宁夏稳定陆块区和造山系的特点进行了综合研究,对宁夏大地构造单元进行了较为合理的划分和充分的表达.而大地构造单元的划分主要服务于成矿区带的划分和成矿规律的研究.以龙首山—六盘山断裂为界,将宁夏大地构造单元划分出华北陆块区和秦祁昆造山系2个Ⅰ级构造单元;鄂尔多斯陆块和北祁连弧盆系2个Ⅱ级构造单元;鄂尔多斯盆地、贺兰山被动陆缘盆地、走廊弧后盆地和走廊南山岛弧4个Ⅲ级构造单元;盐池—彭阳坳陷、贺兰山被动陆缘裂陷带、银川新生代断陷盆地、鄂尔多斯西缘被动陆缘坳陷、阿拉善南缘前陆盆地、香山弧后盆地、南山东端火山弧、南山东端弧背盆地8个Ⅳ级构造单元.为宁夏矿产资源潜力评价提供了可靠的基础地质背景资料及下一步的找矿工作奠定了理论基础.     

Algorithms to support point-based cadcam

This paper presents a system that supports a point-based approach to CADCAM that was first suggested by McLaughlin. The core to the approach is the ability to interpolate a grid of points in a geometrically meaningful way that does not suffer from the disadvantages of the standard interpolation schemes based on NURBS. The essential features of the approach are based on recursive subdivision between existing points to generate intermediate points that are consistent with a smooth curvature profile. There are many advantages to this approach. Time-consuming surface fitting is not necessary; there are no problems with ensuring continuity between surfaces; data exchange can be carried out exactly. By chosing to work entirely with points, all of the standard interrogations available in CAE systems, including visualisations, FE analysis and NC machining, which are dependent on NURBS curves and surfaces have to be replicated. The feasibility of the point-based approach is illustrated by showing how geometric interrogations and machine tool paths can be accurately generated using just points.     

Semi‐Regular Triangle Remeshing: A Comprehensive Study

Semi‐regular triangle remeshing algorithms convert irregular surface meshes into semi‐regular ones. Especially in the field of computer graphics, semi‐regularity is an interesting property because it makes meshes highly suitable for multi‐resolution analysis. In this paper, we survey the numerous remeshing algorithms that have been developed over the past two decades. We propose different classifications to give new and comprehensible insights into both existing methods and issues. We describe how considerable obstacles have already been overcome, and discuss promising perspectives.