给定切失混合有理插值曲线

在曲线的设计中,尤其是反向设计,通常所取的数据点都是关键点,譬如:逗留点(曲线上的一阶导失与二阶导失叉积为零矢量的点)。因此,设计的曲线希望在该数据点也是逗留点。利用三角函数对三次Bernstein基函数改进为混合基函数,该基函数具有规范性,对称性等类似Bernstein基函数的性质和特点。给定一组确定切方向的数据点,用此基函数,可以构造一种带形状因子的有理插值曲线。生成的有理插值曲线具有G2-连续和曲率连续,插值点均是逗留点等特点。若通过加强形状因子的条件限制可达到C2-连续,并可以通过修改形状因子来调节曲线的形状,并且这种影响是局部的。最后还给出了实例,并与三次Hermite插值曲线进行了比较。     

曲线的整数型生成算法

本文提出了一个用光栅显示器或数字化绘图仪等显示设备中选择曲线上最佳点的通过算法，该算法由几部分组成，分别对应曲线的不同走向段，其最大的特点是可以根据实际曲线的走向，在算法的各部分实现自动跳动，由此算法可生成所有常用曲线，本文给出Ｂｅｚｉｅｒ曲线和Ｂ样条曲线的生成算法，这些算法选择距离实际曲线最近的网格点，并且只有整数运算。     

Parallel space‐filling curve generation through sorting

In this paper we consider the scalability of parallel space‐filling curve generation as implemented through parallel sorting algorithms. Multiple sorting algorithms are studied and results show that space‐filling curves can be generated quickly in parallel on thousands of processors. In addition, performance models are presented that are consistent with measured performance and offer insight into performance on still larger numbers of processors. At large numbers of processors, the scalability of adaptive mesh refined codes depends on the individual components of the adaptive solver. One such component is the dynamic load balancer. In adaptive mesh refined codes, the mesh is constantly changing resulting in load imbalance among the processors requiring a load‐balancing phase. The load balancing may occur often, requiring the load balancer to perform quickly. One common method for dynamic load balancing is to use space‐filling curves. Space‐filling curves, in particular the Hilbert curve, generate good partitions quickly in serial. However, at tens and hundreds of thousands of processors serial generation of space‐filling curves will hinder scalability. In order to avoid this issue we have developed a method that generates space‐filling curves quickly in parallel by reducing the generation to integer sorting. Copyright © 2007 John Wiley & Sons, Ltd.     

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.     

空间代数曲线的参数化逼近

提出一种用三次B样条曲线逼近空间代数曲线的方法.对非奇异的情况,先用随机微分方程方法采样,然后对采样点进行聚类排序,最后用三次B样条曲线逼近有序点列;而对包含奇异点的情况,则将空间曲线双有理映射成平面曲线,采用已有的含奇异点的平面代数曲线的采样及排序方法来实现对应空间曲线的采样及排序.两种情况都获得了优于其它方法的逼近效果.     

Algorithms for rational Bézier curves

A recursive algorithm for the evaluation of rational Bézier curves is presented; it consists of a construction that works with a constant cross ratio. This geometric principle is carried over to other algorithms.     

Compact Hilbert indices: Space-filling curves for domains with unequal side lengths

In this paper we define a new compact Hilbert index which, while maintaining all of the advantages of the standard Hilbert curve, permits spaces with unequal dimension cardinalities. The compact Hilbert index can be used in any application that would have previously relied on Hilbert curves but, in the case of unequal side lengths, provides a more memory efficient representation. This advantage is particularly important in distributed applications (Parallel, P2P and Grid), in which not only is memory space saved but communication volume is significantly reduced.     

Spatial camera orientation control by rotation‐minimizing directed frames

The use of rotation‐minimizing directed frames (RMDFs) for defining smoothly varying camera orientations along given spatial paths, in real or virtual environments, is proposed. A directed frame on a space curve is a varying orthonormal basis for ℝ³ such that coincides with the unit polar vector from the origin to each curve point, and such a frame is rotation‐minimizing if its angular velocity vector maintains a vanishing component along o . To facilitate computation of rotation‐minimizing directed frames, it is shown that the basic theory is equivalent to the established theory for rotation‐minimizing adapted frames—for which one frame vector coincides with the tangent at each curve point—if one replaces the given space curve by its anti‐hodograph (i.e., indefinite integral). A family of polynomial curves on which RMDFs can be computed exactly by a rational function integration, the Pythagorean (P) curves, is also introduced, together with algorithms for their construction. Copyright © 2009 John Wiley & Sons, Ltd.     

Approximation of involute curves for CAD-system processing

In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geometry behind a gear tooth. The circle involute curves are by definition transcendental and cannot be expressed by algebraic equations, and hence it cannot be directly incorporated into commercial CAD systems. In this paper, an approximation algorithm for circle involute curves in terms of polynomial functions is developed. The circle involute curve is approximated using a Chebyshev approximation formula (Press et al. in Numerical recipes, Cambridge University Press, Cambridge, 1988), which enables us to represent the involute in terms of polynomials, and hence as a Bézier curve. In comparison with the current B-spline approximation algorithms for circle involute curves, the proposed method is found to be more accurate and compact, and induces fewer oscillations.     

Rational Pythagorean-hodograph space curves

A method for constructing rational Pythagorean-hodograph (PH) curves in R³ is proposed, based on prescribing a field of rational unit tangent vectors. This tangent field, together with its first derivative, defines the orientation of the curve osculating planes. Augmenting this orientation information with a rational support function, that specifies the distance of each osculating plane from the origin, then completely defines a one-parameter family of osculating planes, whose envelope is a developable ruled surface. The rational PH space curve is identified as the edge of regression (or cuspidal edge) of this developable surface. Such curves have rational parametric speed, and also rational adapted frames that satisfy the same conditions as polynomial PH curves in order to be rotation-minimizing with respect to the tangent. The key properties of such rational PH space curves are derived and illustrated by examples, and simple algorithms for their practical construction by geometric Hermite interpolation are also proposed.     

非参数数字曲线的生成

数字曲线的生成无论是地计算机图形学还是虚拟现实，都是一个极为重要的基础技术。本文探讨了高效的数字曲线的生成技术。新的方法既保了实空间嗣线的性质，又能高效地生成数字曲线，克服了现有技术的局限。本文对二次曲线的生成提出的算法具有高效、稳定的特点，对曲线弧段的生成算法尤其简洁实用。     

Topology of real algebraic space curves

In this paper we give a new projection-based algorithm for computing the topology of a real algebraic space curve given implicitly by a set of equations. Under some genericity conditions, which may be reached through a linear change of coordinates, we show that a plane projection of the given curve, together with a special polynomial in the ideal of the curve contains all the information needed to compute its topological shape. Our method is also designed in such a way to exploit important particular cases such as complete intersection curves or curves contained in nonsingular surfaces.     

有理三次样条的误差分析及空间闭曲线插值

给出了具有线性分母的有理三次样条函数的误差估计,并在柱面坐标系下对一类空间闭曲线的插值问题进行了研究;通过将柱面展开,把空间闭曲线的插值问题转化为平面中的插值问题,利用具有线性分母的有理三次样条函数进行插值;最终得到的空间曲线能达到曲率连续.对该方法的误差进行了分析,数值例子显示插值效果较好.     

Equivalence of distinct characterizations for rational rotation-minimizing frames on quintic space curves

A rotation-minimizing frame on a space curve r(t) is an orthonormal basis (f₁,f₂,f₃) for R³, where f₁=r^′/|r^′| is the curve tangent, and the normal-plane vectors f₂,f₃ exhibit no instantaneous rotation about f₁. Such frames are useful in spatial path planning, swept surface design, computer animation, robotics, and related applications. The simplest curves that have rational rotation-minimizing frames (RRMF curves) comprise a subset of the quintic Pythagorean-hodograph (PH) curves, and two quite different characterizations of them are currently known: (a) through constraints on the PH curve coefficients; and (b) through a certain polynomial divisibility condition. Although (a) is better suited to the formulation of constructive algorithms, (b) has the advantage of remaining valid for curves of any degree. A proof of the equivalence of these two different criteria is presented for PH quintics, together with comments on the generalization to higher-order curves. Although (a) and (b) are both sufficient and necessary criteria for a PH quintic to be an RRMF curve, the (non-obvious) proof presented here helps to clarify the subtle relationships between them.     

On invariant curve forms

A class of axis-independent curve algorithms is investigated, in two- and three-dimensional space, using simple group-theoretic methods. In two dimensions the analysis provides a general curve form not previously considered in Computer Aided Geometric Design. In the three-dimensional case analogous arguments produce no new general axis-dependent curve forms and this is seen to be a consequence of the more complex structure of the rotation group of three-space.     

均匀B样条曲线的降阶

文中给出均匀 B样条曲线退化的充要条件 ,证明了满足退化条件的 k阶均匀 B样条曲线可以表示为 (k- 1)阶均匀 B样条曲线 ,并给出相应的表示方法 .在此基础上 ,利用约束优化方法 ,提出均匀 B样条曲线的一种降阶方法 .而传统方法从升阶的反问题考虑降阶 ,要求被降阶的 B样条曲线的所有节点都是多重节点 ,从而无法处理均匀B样条曲线 .     

Descent via isogeny on elliptic curves with large rational torsion subgroups

We outline PARI programs which assist with various algorithms related to descent via isogeny on elliptic curves. We describe, in this context, variations of standard inequalities which aid the computation of members of the Tate–Shafarevich group. We apply these techniques to several examples: in one case we use descent via 9-isogeny to determine the rank of an elliptic curve; in another case we find nontrivial members of the 9-part of the Tate–Shafarevich group, and in a further case, nontrivial members of the 13-part of the Tate–Shafarevich group.     

广义Said-Ball曲线

给出了n次带形状参数λ的Said-Ball曲线,它具有n次Said-Ball曲线的类似性质.形状参数λ具有明显的几何意义:λ越大,曲线越逼近控制多边形;当λ=2时,曲线退化为Said-Ball曲线.给出了曲线的递归求值算法及两段曲线G~1,C~1连续拼接的条件.     

ACORD—an adaptive corner detector for planar curves

In contrast to the conventional method of smoothing a curve at multiple scales and integrating the information at various scales, a technique for smoothing a curve adaptively based on the roughness present in the curve is suggested. The procedure does not require smoothing at all levels of detail and it does not require construction of complete scale space map and representation of the map by tree. The procedure has been applied on a number of digital curves and the results have been compared with those of the recent work.