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.     

多边形三角剖分与三角细分的研究与实现

多边形是构成三维模型表面的基本元素,多边形的三角剖分及三角形的三角细分是计算机三维快速建模及纹理帖图的基本技术。本文在研究平面多边形的三角剖分及其三角网格化相关理论的基础上,利用面向对象技术及递归程序设计方法,实现多边形的三角剖分及其三角细分的算法设计,并对该算法的执行效率进行分析。实验结果表明,该算法具有较高的运算效率及实用价值,对实际应用有较好的参考作用。     

Point-augmented biquadratic C1 subdivision surfaces

Shape artifacts, especially for convex input polyhedra, make Doo and Sabin’s generalization of bi-quadratic (bi-2) subdivision surfaces unattractive for general design. Rather than tuning the eigenstructure of the subdivision matrix, we improve shape by adding a point and enriching the refinement rules. Adding a guiding point can also yield a polar bi-2 subdivision algorithm. Both the augmented and the polar bi-2 subdivision are complemented by a new Primal Bi-2 Subdivision scheme. All surfaces are $C^1$ and can be combined.     

Generating planar spiral by geometry driven subdivision scheme

Spirals are curves with one-signed, monotone increasing or decreasing curvature. They are commonly useful in a variety of applications, either for aesthetic or for engineering requirements. In this paper we propose a new iterative subdivision scheme for generating planar spiral segments from two points and their tangent vectors. The subdivision process consists of two main steps, computing new points and adjusting tangent vectors adaptively for each iteration. We categorize this iterative scheme as geometry...     

一种实用的多投影仪显示墙色彩校正方法

针对多投影仪显示墙系统色彩不均匀性的问题,提出一种快速、实用的独立于几何校正结果的色彩校正方法。该方法利用细分网格变形技术将现有针对平面投影屏幕的色彩校正方法推广到适应任意光滑曲面投影屏幕,同时利用加权最小二乘曲线拟合思想降低色彩测量数据量。实际进行色彩校正时,采用可编程图形处理单元(GPU)的像素着色器对投影图像的每个像素进行实时校正计算,并在实际多投影仪显示墙系统中验证了方法的有效性。     

基于小波分析的亚像素配准算法

在像素级配准的基础上,通过对多项式细分算法的改进,提出了一种基于小波分析的亚像素配准算法,并对配准算法的精度进行了分析研究.仿真结果表明,该算法效果良好,达到亚像素级精度.     

细分曲面求交交线计算方法的研究

主要针对三角网格的细分曲面求交提出了一种有效的交线计算的方法,该方法适用于任意三角网格的细分曲面中.在利用AABB和二部图进行初始控制网格相交性检测后,利用该方法快速有效地求出细分曲面的交线.     

基于法向量的非线性逼近型细分格式

提出一种二进制的几何非线性逼近型细分格式。在该格式中,新点不全是旧点的线性组合,其中一个新点是通过在法向量方向偏移所产生,且法向量在每次细分中能自适应计算。引入一些参数来控制细分过程,且参数对曲线形状的影响是局部的。实例证明,通过选择适当的参数值,产生的细分曲线具有保凸性和 连续性。