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

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

On the Existence and the Coefficients of the Implicit Equation of Rational Surfaces

The existence of the implicit equation of rational surfaces can be proved by three techniques: elimination theory, undetermined coefficients, and the theory of field extensions. The methods of elimination theory and undetermined coefficients also reveal that the implicit equation can be written with coefficients from the coefficient field of the parametric polynomials. All three techniques can be implemented as implicitization algorithms. For each method, the theoretical limitations of the proof and the practical advantages and disadvantages of the algorithm are discussed. Our results are important for two reasons. First, we caution that elimination theory cannot be generalized in a straightforward manner from rational plane curves to rational surfaces to show the existence of the implicit equation; thus other rigorous methods are necessary to bypass the vanishing of the resultant in the presence of base points. Second, as an immediate consequence of the coefficient relationship, we see that the implicit representation involves only rational (or real) coefficients if a parametric representation involves only rational (or real) coefficients. The existence of the implicit equation means every rational surface is a subset of an irreducible algebraic surface. The subset relation can be proper and this may cause problems in certain applications in computer aided geometric design. This anomaly is illustrated by an example.     

Pose estimation and object identification using complex algebraic representations

The comparison and alignment of two similar objects is a fundamental problem in pattern recognition and computer vision that has been considered using various approaches. In this work, we employ a complex representation for an algebraic curve, and illustrate how the algebraic transformation which relates two Euclidean equivalent curves can be determined using this representation. The idea is based on a complex representation of 2D points expressed in terms of the orthogonalx andy variables, with rotations of the complex numbers described using Euler's identity. We develop a simple formula for integer multiples of the rotation angle of the Euclidean transformation in terms of the real coefficients of implicit polynomial equations that are used to model 2D free-form objects. When there is a translation, it can be determined using some new results on the conic-line factors of implicit polynomial curves. Experimental results are presented for data sets characterised by both noisy and missing data points to illustrate and validate our procedures.     

A basis for the implicit representation of planar rational cubic Bézier curves

We present an approach to finding the implicit equation of a planar rational parametric cubic curve, by defining a new basis for the representation. The basis, which contains only four cubic bivariate polynomials, is defined in terms of the Bézier control points of the curve. An explicit formula for the coefficients of the implicit curve is given. Moreover, these coefficients lead to simple expressions which describe aspects of the geometric behaviour of the curve. In particular, we present an explicit barycentric formula for the position of the double point, in terms of the Bézier control points of the curve. We also give conditions for when an unwanted singularity occurs in the region of interest. Special cases in which the method fails, such as when three of the control points are collinear, or when two points coincide, will be discussed separately.     

隐式曲面／参数曲面的求交算法

本文介绍了一种实用有效的隐式曲面／参数曲面求交算法。算法主要分为两部分：特征初始点的求取和单调段的跟踪。解双变量多项式方程求解特征初始点。跟踪在三维空间进行，易于控制跟踪步长和离散交点对交线的逼近精度。算法不离散参数曲面，不漏交。     

参数曲面上的插值与混合

如何表示曲面上的曲线,在处理诸如数控加工中的路径设计以及CAD/CAM等领域频繁出现的曲面裁剪问题时显得日益重要.给出了数据点的切方向(切方向及曲率向量或测地曲率值)指定而G¹连续(G²连续)插值曲面上任意点列的方法.作为曲面上曲线插值问题的特例,还讨论了曲面上曲线的混合问题.基本思想是借助于微分几何的有关结论,曲面上曲线的插值问题被转化为其参数平面上类似的曲线插值问题.该方法能够用二维隐式方程来表示曲面上的插值曲线,从而把在显示该曲线时所面对的曲面求交的几何问题转化为计算隐式曲线的代数问题.实验证明该方法是可行的,而且适用于CAD/CAM及计算机图形学等领域.     

Topologically faithful fitting of simple closed curves

Implicit representations of curves have certain advantages over explicit representation, one of them being the ability to determine with ease whether a point is inside or outside the curve (inside-outside functions). However, save for some special cases, it is not known how to construct implicit representations which are guaranteed to preserve the curve's topology. As a result, points may be erroneously classified with respect to the curve. The paper offers to overcome this problem by using a representation which is guaranteed to yield the correct topology of a simple closed curve by using homeomorphic mappings of the plane to itself. If such a map carries the curve onto the unit circle, then a point is inside the curve if and only if its image is inside the unit circle.     

Parameterization in Finite Precision

Certain classes of algebraic curves and surfaces admit both parametric and implicit representations. Such dual forms are highly useful in geometric modeling since they combine the strengths of the two representations. We consider the problem of computing the rational parameterization of an implicit curve or surface in a finite precision domain. Known algorithms for this problem are based on classical algebraic geometry, and assume exact arithmetic involving algebraic numbers. In this work we investigate the behavior of published parameterization algorithms in a finite precision domain and derive succinct algebraic and geometric error characterizations. We then indicate numerically robust methods for parameterizing curves and surfaces which yield no error in extended finite precision arithmetic and, alternatively, minimize the output error under fixed finite precision calculations. Received January 8, 1997; revised August 27, 1998.     

一种修改NURBS曲线形状的新方法

曲线曲面的形状修改是计算机几何造型过程中的重要部分．文章提出了一种修改NURBS曲线的新方法，使得修改后的曲线在多个参数点处满足用户给定的几何约束(如点约束、切矢约束)，首先引入了一些新的概念如：局部曲线、总曲线、多余约束和多余曲线等．对于每个参数点分别计算出一系列满足该点处几何约束的局部曲线，并由此构造了总曲线．接着插值一条满足多余约束的多余曲线．最后运用构造Coons曲面的思想，计算出最终的修改曲线，它等于总曲线减去多余曲线．同时我们发现两种现存的修改NURBS曲线的方法是一样的．实例表明此方法适用于CAD软件系统。     

Intersecting a freeform surface with a general swept surface

We present efficient and robust algorithms for intersecting a rational parametric freeform surface with a general swept surface. A swept surface is given as a one-parameter family of cross-sectional curves. By computing the intersection between a freeform surface and each cross-sectional curve in the family, we can solve the intersection problem. We propose two approaches, which are closely related to each other. The first approach detects certain critical points on the intersection curve, and then connects them in a correct topology. The second approach converts the intersection problem to that of finding the zero-set of polynomial equations in the parameter space. We first present these algorithms for the special case of intersecting a freeform surface with a ruled surface or a ringed surface. We then consider the intersection with a general swept surface, where each cross-sectional curve may be defined as a rational parametric curve or as an implicit algebraic curve.     

集多种特性的三次三角伪B样条

目的 为了同时解决传统多项式B样条曲线在形状调控、精确表示常见工程曲线以及构造插值曲线时的不足,提出了一类集多种特性的三次三角伪B样条。方法 首先构造了一组带两个参数的三次三角伪B样条基函数,然后在此基础上定义了相应的参数伪B样条曲线,并讨论了该曲线的特性及光顺性问题,最后研究了相应的代数伪B样条,并给出了最优代数伪B样条的确定方法。结果 参数伪B样条曲线不仅满足C²连续,而且无需求解方程系统即可自动插值于给定的型值点。当型值点保持不变时,插值曲线的形状还可通过自带的两个参数进行调控。在适当条件下,该参数伪B样条曲线可精确表示圆弧、椭圆弧、星形线等常见的工程曲线。相应的代数伪B样条具有参数伪B样条曲线类似的性质,利用最优代数伪B样条可获得满意的插值效果。结论 所提出的伪B样条同时解决了传统多项式B样条曲线在形状调控、精确表示常见工程曲线以及构造插值曲线时的不足,是一种实用的曲线造型方法。     

有理曲线的近似隐式化表示

本文首次提出了曲线近似隐式化的概念，给出了求曲线的近似隐式化表示的有效算法，并以实例说明了算法有效性以及研究这一问题的重要意义。     

隐式二次代数曲线插值

目前,二次参数曲线在曲线曲面造型中应用非常广泛,起着至关重要的作用,因此对二次曲线的性质和应用的研究仍十分有意义。本文首先综述近年来有关二次曲线的研究,对各种方法的优缺点进行了客观的评价。然后根据三次代数曲线的构造方法,提出一种新的二次曲线的构造方法,该方法通过几何量如控制点和切线来控制二次代数曲线的形状。文章在理论上对曲线的一系列性质进行了详细说明。     

Vector elimination: A technique for the implicitization, inversion, and intersection of planar parametric rational polynomial curves

In this paper vector techniques and elimination methods are combined to help resolve some classical problems in computer aided geometric design. Vector techniques are applied to derive the Bezout resultant for two polynomials in one variable. This resultant is then used to solve the following two geometric problems: Given a planar parametric rational polynomial curve, (a) find the implicit polynomial equation of the curve (implicitization); (b) find the parameter value(s) corresponding to the coordinates of a point known to lie on the curve (inversion). The solutions to these two problems are closed form and, in general, require only the arithmetic operations of addition, subtraction, multiplication, and division. These closed form solutions lead to a simple, non-iterative, analytic algorithm for computing the intersection points of two planar parametric rational polynomial curves. Extensions of these techniques to planar rational Bezier curves are also discussed.     

Planar piecewise algebraic curves

An approach is described for piecing together segments of planar algebraic curves with derivative continuity. The application of piecewise algebraic curves to area modelling (the two-dimensional analogue of solid modelling) is discussed. A technique is presented for expressing a planar rational parametric curve as an algebraic curve segment. An upper bound is derived for the farthest distance between two algebraic curves (one of which may also be a parametric curve) within a specified region.     

Algorithms for Trigonometric Curves (Simplification,Implicitization, Parameterization)

A trigonometric curve is a real plane curve where each coordinate is given parametrically by a truncated Fourier series. The trigonometric curves frequently arise in various areas of mathematics, physics, and engineering. Some trigonometric curves can also be represented implicitly by bivariate polynomial equations. In this paper, we give algorithms for (a) simplifying a given parametric representation, (b) computing an implicit representation from a given parametric representation, and (c) computing a parametric representation from a given implicit representation.     

The -basis and implicitization of a rational parametric surface

The concept of a μ-basis was introduced in the case of parametrized curves in 1998 and generalized to the case of rational ruled surfaces in 2001. The μ-basis can be used to recover the parametric equation as well as to derive the implicit equation of a rational curve or surface. Furthermore, it can be used for surface reparametrization and computation of singular points. In this paper, we generalize the notion of a μ-basis to an arbitrary rational parametric surface. We show that: (1) the μ-basis of a rational surface always exists, the geometric significance of which is that any rational surface can be expressed as the intersection of three moving planes without extraneous factors; (2) the μ-basis is in fact a basis of the moving plane module of the rational surface; and (3) the μ-basis is a basis of the corresponding moving surface ideal of the rational surface when the base points are local complete intersections. As a by-product, a new algorithm is presented for computing the implicit equation of a rational surface from the μ-basis. Examples provide evidence that the new algorithm is superior than the traditional algorithm based on direct computation of a Gröbner basis. Problems for further research are also discussed.     

Constructing G 1 continuous curve on a free-form surface with normal projection

In this paper, we develop a new method for G ¹ continuous interpolation of an arbitrary sequence of points on an implicit or parametric surface with a specified tangent direction at every point. Based on the normal projection method, we design a G ¹ continuous curve in three-dimensional space and then project orthogonally the curves onto the given surface. With the techniques in classical differential geometry, we derive a system of differential equations characterizing the projection curve. The resulting interpolation curve is obtained by numerically solving the initial-value problems for a system of first-order ordinary differential equations in the parametric domain associated to the surface representation for a parametric case or in three-dimensional space for an implicit case. Several shape parameters are introduced into the resulting curve, which can be used in subsequent interactive modification such that the shape of the resulting curve meets our demand. The presented method is independent of the geometry and parameterization of the base surface, and numerical experiments demonstrate that it is effective and potentially useful in surface trim, robot, patterns design on surface and other industrial and research fields.     

A theory of self-calibration of a moving camera

There is a close connection between the calibration of a single camera and the epipolar transformation obtained when the camera undergoes a displacement. The epipolar transformation imposes two algebraic constraints on the camera calibration. If two epipolar transformations, arising from different camera displacements, are available then the compatible camera calibrations are parameterized by an algebraic curve of genus four. The curve can be represented either by a space curve of degree seven contained in the intersection of two cubic surfaces, or by a curve of degree six in the dual of the image plane. The curve in the dual plane has one singular point of order three and three singular points of order two.If three epipolar transformations are available, then two curves of degree six can be obtained in the dual plane such that one of the real intersections of the two yields the correct camera calibration. The two curves have a common singular point of order three.Experimental results are given to demonstrate the feasibility of camera calibration based on the epipolar transformation. The real intersections of the two dual curves are found by locating the zeros of a function defined on the interval [0, 2]. The intersection yielding the correct camera calibration is picked out by referring back to the three epipolar transformations.