三角形域上的超限插值方法

在三角形域上构造对边界曲线和跨界导数插值的三角曲面是计算机辅助几何设计和计算机图形学等领域中的基本问题.此类问题称为三角形域上的超限插值问题.对现有三角形域上的超限插值方法进行了综述,并对现有三角形域上的超限插值方法以具体实例进行了比较.最后讨论了现有三角形域上的超限插值方法中有待进一步解决的问题.     

Radical parametrizations of algebraic curves by adjoint curves

We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less than or equal to 4 and the curve is defined over an algebraically closed field of characteristic zero. In addition, we also present an algorithm for parametrizing by radicals any irreducible plane curve of degree d having at least a point of multiplicity d−r, with 1≤r≤4 and, as a consequence, every irreducible plane curve of degree d≤5 and every irreducible singular plane curve of degree 6.     

Almost rotation-minimizing rational parametrization of canal surfaces

Almost rotation minimizing parametrization of the canal surface is given. The basic building block of our approach is the curve approximation scheme that enables us to construct a curve, called the parameter curve, on the canal surface that produces, when projected and rescaled, an almost parallel normal vector field on the spine curve. Its construction relies on our earlier methods and results on relating the geometry of the canal surface to the Lorentzian geometry of the Minkowski geometry via the Clifford algebra formalism. We then iteratively construct patches out of the parameter curves via suitable interpolation procedure. Furthermore, its rotational deviation, i.e., the angle deviation from the parallel (no rotation) frame along the spine curve, can be controlled with the use of the rotation deviation estimate of the parameter curves. Our numerical experiment shows that the rotation deviation is minuscule. When compared with other earlier results including our earlier one, our result fares extremely favorably. To facilitate the implement, a practitioners' summary is given in the appendix.     

参数曲线曲面实奇异点的计算

本文主要讨论了利用Grobner基理论对参数曲线（面）的奇异点进行判断和计算。如果曲线（面）存在奇异点,由定义可知它的导矢（法矢）等于0。因此,曲线（面）奇异点的判定就是方程组的求解问题。由Hilbert弱零点定理可知,若一组多项式方程无公共零点,则其生成理想约化的Grobner基为[1]。在计算时,首先根据Grobner基理论判断 曲线（面）是否存在奇异点。当存在奇异点时,利用区间算法对实奇异点进行隔离和迭代。在确定奇异点的存在性时,根据曲线（曲面）的导矢（法矢）方程的Grobner基直 接进行判断,而不需要求解非线性代数方程组。若曲线曲面存在奇异点,进一步采用区间方法对奇异点进行隔离以确定曲线段或曲面片的正则性。该方法可以得到参数曲线曲面的所有实奇异点且达到任意精度。     

Degenerate parametric curves

This paper discusses two degenerate cases of polynomial parametric curves for which the degrees of the defining polynomials can be reduced without altering the curve. The first case is the improperly parametrized curve for which each point on the curve corresponds to several parameter values. The second case, which can only occur for rational polynomial parametric curves, exists when the defining polynomials all have a common factor.

This paper describes how to detect and correct each type of degeneracy. Examples are given which demonstrate that seemingly innocuous Bézier curves may suffer from either of these degeneracies.     

Darboux cyclides and webs from circles

Motivated by potential applications in architecture, we study Darboux cyclides. These algebraic surfaces of order ?4 are a superset of Dupin cyclides and quadrics, and they carry up to six real families of circles. Revisiting the classical approach to these surfaces based on the spherical model of 3D Möbius geometry, we provide computational tools for the identification of circle families on a given cyclide and for the direct design of those. In particular, we show that certain triples of circle families may be arranged as so-called hexagonal webs, and we provide a complete classification of all possible hexagonal webs of circles on Darboux cyclides.     

HelSweeper: Screw-sweeps of canal surfaces

A tube is a solid bounded by the union of a one-parameter family of circles that may be decomposed into canal-surfaces and planar disks or annuli. A screw-sweep is the region swept by a shape during a screw motion. HelSweeper computes the boundary of a screw-sweep of an arbitrary union of tubes and polyhedra. To do so, it generates a superset of faces, splits them at their intersections, and selects the face portions that form the desired boundary. The novelty of the proposed approach lies in the fact that the faces contributed to this superset by a tube are each a screw-sweeps of a rigid curve (generator), which is the locus of grazing points, and that each grazing point is formulated as the intersection of a circle of the tube with a corresponding screw-plane. Hence, each such face is a one-parameter family of helices, each being the screw-sweep of a grazing point.     

基于轮廓数据的B样条曲面重建

针对B样条曲面拟合中出现的问题和困难,提出了一种基于行组织的轮廓数据（截面数据）的曲面重建方法。该方法避免了数据点的参数化问题,使得逼近曲面拥有较好的形状和合理的控制顶点数量。该方法的基本思想是：首先构造易于控制的低阶曲面拟合数据点,此曲面称控制曲面,然后利用高次曲面逼近该曲面,此高次曲面称为逼近曲面,为所需要的重建曲面。在曲面重建中利用最佳平方逼近和光顺函数,减少了逼近曲面的控制顶点冗余,较有效地防止了逼近曲面的形状突变和曲面的扭曲,很大程度地提高了曲面的质量。     

数控系统连续微段重构与插补算法研究

针对目前微段加工研究中采用的非重构微段加工方法存在的加工轨迹与设计曲线轮廓误差较大,轮廓加工精度较低,及微段节点处速度方向不连续,因此加工表面质量不高,加工过程机床振动较大的问题。在计算机数控（Computerized Numerical Control,CNC）中采用实时曲线重构与插补算法进行连续微段加工以实现对曲面的高速高精度加工。微段插补技术包括样条曲线的实时重构及递推插补算法,及建立满足加减速要求的可以直接递推的插补样条曲线的重构条件。应用微段曲线重构技术进行的样件数控加工实验中,在保证曲线轮廓加工精度达到um级精度的同时,加工速度提高了2~2.4倍。实验结果表明,实时曲线重构微段加工不仅可以实现在重构曲线的范围内进行整体加减速速度规划,提高加工效率,而且加工轨迹的进给速度的衔接平滑,轨迹光滑,表面质量好,并且利用重构的可以直接递推插补的样条曲线,有效解决了平衡了复杂算法加工过程中精度与运算速度的矛盾,提高了加工精度。     

Switched systems with multiple invariant sets

This paper explores dwell time constraints on switched systems with multiple, possibly disparate invariant limit sets. We show that, under suitable conditions, trajectories globally converge to a superset of the limit sets and then remain in a second, larger superset. We show the effectiveness of the dwell-time conditions by using examples of switching limit cycles commonly found in robotic locomotion and flapping flight.     

三点插值的三次PH曲线构造方法

为推广三次PH曲线的实际应用,研究在给定3个平面型值点条件下的三次PH曲线构造方法.三次PH曲线具有鲜明的几何性质和代数特征,采用平面参数曲线的复数表示方法,三次PH曲线的充分必要条件被表述为复代数系统.通过对给定型值点进行参数化,将复代数系统转化为一元二次复方程,求解方程即得三次PH曲线的控制顶点,从而得到2条构造曲线.应用该方法对模拟给定的若干平面型值点数据进行实验,比较了均匀参数化、弦长参数化、弧长参数化方法的不同效果,并计算弧长、弯曲能量、绝对旋转数来选取最优构造曲线.实验结果表明,该方法有效且易于计算,可应用于三次PH样条构造.     

B样条曲线曲面GC2扩展

提出了一个扩展B样条曲线曲面的新方法,扩展B样条曲线曲面的关键是为新增加的点确定节点值,新方法的基本思想是：首先,B样条曲线和扩展部分在连接点处满足GC^2连续,用能量极小化方法确定扩展部分的曲线形状,通过对曲线重新参数化使两部分曲线满足C^2连续,进而确定新增加点的节点值,新B样条曲线的控制点由一个显式递推公式计算,原B样条曲线和扩展后的部分合在一起形成一条新的B样条曲线,新的B样条曲线满足原B样条曲线和扩展的点,文章还讨论了运用该方法进行B样条曲面扩展,且以实例对新方法与其它方法进行了比较,结果表明新方法的光顺性得到了明显改善,曲率变化更平坦,且有较小的旋转数指标。     

B2-splines: a local representation for cubic spline interpolation

The cubicB-spline representation provides the local interaction properties and the sufficient order of continuity required in free-form curve and surface modelling in CAD. Basic problems are nevertheless encountered when applyingB-splines to interpolation, where they have global behavior. In this paper, we present theB2-spline formulation, a superset of theB-splines with local interpolation properties. Besides providing the local interpolation access, theB2-spline interaction operations can also be used directly as aB-spline modelling interface. Modelling aplications are discussed especially with the skinning method for interpolating surfaces through curve networks.     

Conventional Benchmarks as a Sample of the Performance Spectrum

Most benchmarks are smaller than actual application programs. One reason is to improve benchmark universality by demanding resources every computer is likely to have. However, users dynamically increase the size of application programs to match the power available, whereas most benchmarks are static and of a size appropriate for computers available when the benchmark was created; this is particularly true for parallel computers. Thus, the benchmark overstates computer performance, since smaller problems spend more time in cache. Scalable benchmarks, such as HINT, examine the full spectrum of performance through various memory regimes, and express a superset of the information given by any particular fixed-size benchmark. Using 5,000 experimental measurements, we have found that performance on the NAS Parallel Benchmarks, SPEC, LINPACK, and other benchmarks is predicted accurately by subsets of HINT performance curve. Correlations are typically better than 0.995. Predicted ranking is often perfect.     

Representational information: a new general notion and measure of information

In what follows, we introduce the notion of representational information (information conveyed by sets of dimensionally defined objects about their superset of origin) as well as an original deterministic mathematical framework for its analysis and measurement. The framework, based in part on categorical invariance theory [30], unifies three key constructs of universal science - invariance, complexity, and information. From this unification we define the amount of information that a well-defined set of objects R carries about its finite superset of origin S, as the rate of change in the structural complexity of S (as determined by its degree of categorical invariance), whenever the objects in R are removed from the set S. The measure captures deterministically the significant role that context and category structure play in determining the relative quantity and quality of subjective information conveyed by particular objects in multi-object stimuli.     

Generating subdivision surfaces from profile curves

The construction of freeform models has always been a challenging task. A popular approach is to edit a primitive object such that its projections conform to a set of given planar curves. This process is tedious and relies very much on the skill and experience of the designer in editing 3D shapes. This paper describes an intuitive approach for the modeling of freeform objects based on planar profile curves. A freeform surface defined by a set of orthogonal planar curves is created by blending a corresponding set of sweep surfaces. Each of the sweep surfaces is obtained by sweeping a planar curve about a computed axis. A Catmull-Clark subdivision surface interpolating a set of data points on the object surface is then constructed. Since the curve points lying on the computed axis of the sweep will become extraordinary vertices of the subdivision surface, a mesh refinement process is applied to adjust the mesh topology of the surface around the axis points. In order to maintain characteristic features of the surface defined with the planar curves, sharp features on the surface are located and are retained in the mesh refinement process. This provides an intuitive approach for constructing freeform objects with regular mesh topology using planar profile curves.     

A framework for nonparametric profile monitoring

Control charts have been widely used for monitoring the functional relationship between a response variable and some explanatory variable(s) (called profile) in various industrial applications. In this article, we propose an easy-to-implement framework for monitoring nonparametric profiles in both Phase I and Phase II of a control chart scheme. The proposed framework includes the following steps: (i) data cleaning; (ii) fitting B-spline models; (iii) resampling for dependent data using block bootstrap method; (iv) constructing the confidence band based on bootstrap curve depths; and (v) monitoring profiles online based on curve matching. It should be noted that, the proposed method does not require any structural assumptions on the data and, it can appropriately accommodate the dependence structure of the within-profile observations. We illustrate and evaluate our proposed framework by using a real data set.     

LLE重构和SVD分解的地震信号降噪方法

针对现有地震信号降噪方法处理地震剖面的弯曲同相轴效果不佳,提出联合局部线性嵌入（LLE）和奇异值分解（SVD）方法的地震信号降噪技术。利用LLE的重构思想,对地震数据采样点用其近邻进行重构,实现非线性模式的弯曲同相轴的线性化处理,并去除一定程度的随机噪声;根据地震资料有效信号具有良好相关性的特性,采用SVD分解对LLE重构后的地震数据进行有效信号和噪声分离,剔除不相干的噪声,最终实现地震数据的随机噪声压制。在正演模型和真实地震资料上进行了实验,实验结果表明：与传统SVD方法相比,提出的方法很好地消除了随机噪声,有效信号基本上无丢失。     

A rational model of the surface swept by a curve*

This paper shows how to construct a rational Bezier model of a swept surface that interpolates N frames (i.e., N position/orientation pairs) of a fixed rational space curve c(s) and maintains the shape of the curve at all intermediate points of the sweep. Thus, the surface models an exact sweep of the curve, consistent with the given data. The primary novelty of the method is that this exact modeling of the sweep is achieved without sacrificing a rational representation for the surface. Through a simple extension, we also allow the sweeping curve to change its size through the sweep. The position, orientation, and size of the sweeping curve can change with arbitrary continuity (we use C² continuity in this paper). Our interpolation between frames has the classical properties of Bezier interpolation, such as the convex hull property and linear precision. This swept surface is a useful primitive for geometric design. It encompasses the surface of revolution and extruded surface, but extends them to arbitrary sweeps. It is a useful modeling primitive for robotics and CAD/CAM, using frames generated automatically by a moving robot or tool.