首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 140 毫秒
1.
This paper presents a simple and robust method for computing the bisector of two planar rational curves. We represent the correspondence between the foot points on two planar rational curves C1(t) and C2(r) as an implicit curve (t,r)=0, where (t,r) is a bivariate polynomial B-spline function. Given two rational curves of degree m in the xy-plane, the curve (t,r)=0 has degree 4m−2, which is considerably lower than that of the corresponding bisector curve in the xy-plane.  相似文献   

2.
We prove there is no rational rotation-minimizing frame (RMF) along any non-planar regular cubic polynomial curve. Although several schemes have been proposed to generate rational frames that approximate RMF's, exact rational RMF's have been only observed on certain Pythagorean-hodograph curves of degree seven. Using the Euler–Rodrigues frames naturally defined on Pythagorean-hodograph curves, we characterize the condition for the given curve to allow a rational RMF and rigorously prove its nonexistence in the case of cubic curves.  相似文献   

3.
A fast algorithm for parametric curve plotting   总被引:1,自引:0,他引:1  
In parametric curve plotting by means of line segments, a curve r = r(t), t[t0, tu] is given, and a set of ordered points r(ti, iN, tie[t0, tu] is specified as the vertices of an inscribed polygon of the curve. There are several, analytical, numerical or intuitive ways to derive these vertices obtaining a smooth polygonal approximation. The methods, which can be found in the literature, either belong to some special curves or involve a considerable waste of computing time.

In this paper, we consider an algorithm that appears as a subroutine in the whole program. The subroutine allows the main program to space points as a function of a distance interval for any parametric curve. The design of the routine for performing this spacing is outlined and two examples are shown.  相似文献   


4.
A Product–Delay algorithm is presented for creating graphic designs on a computer. In this algorithm two functions u(t) and v(t) are multiplied yielding a function x(t). Another function y(t) is formed by delaying or advancing x(t) by a fixed amount of time t. These functions are evaluated over a suitable time interval and the results are plotted in the x–y plane. For appropriate choices of the functions and parameters, the x–y displays exhibit interesting geometric patterns. In this paper the algorithm is illustrated with a pair of sine and square waves. It is shown that a wide variety of graphic designs can be created with these simple waveforms. By virtue of its simplicity this algorithm can be programmed easily and quickly using general purpose software such as Maple, Matlab or Mathematica. It can be executed on standard platforms such as IBM PC compatibles, Macintosh computers or workstations. Some results in polar coordinates are also given.  相似文献   

5.
The problem of spanning a rectangular network of rational cubic curves with a smooth surface is discussed in this paper. Provided the network is compatible with a smooth surface, then algorithms for patch construction, optimization and subdivision are developed to construct an ‘approximately smooth’ surface, that is, G1 continuous to within some tolerance, composed of rational bicubic patches. The algorithms have been applied in the die and mould industry. The toolmaker constructs a wireframe model of an EDM (electro-discharge machining) electrode and the algorithms automatically construct the surface model. For toolmaking companies, this simplifies the surface modelling process making a highly-specialized and time-consuming task virtually automatic.  相似文献   

6.
We introduce a new technique to obtain some new oscillation criteria for the oscillating coefficients delay differential equation with piecewise constant argument of the form x′(t) + a(t)x(t) + b(t)x({tk}) = 0, where a(t) and b(t) are right continuous functions on [−k, ∞), k is a positive integer, and [·] denotes the greatest integer function. Our results improve and generalize the known results in the literature. Some examples are also given to demonstrate the advantage of our results.  相似文献   

7.
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.  相似文献   

8.
A fourth order family of methods to approximate numerical integration of periodic initial value problem x″ = ƒ (t, x) is presented. The method can be regarded as a P-stable modification of the Numerov method which originally has interval of periodicity (0, 6).  相似文献   

9.
Consider the cubic sensor dx = dw, dy = x3dt + dv where w, v are two independent Brownian motions. Given a function φ(x) of the state x let φt(x) denote the conditional expectation given the observations ys, 0 s t. This paper consists of a rather detailed discussion and outline of proof of the theorem that for nonconstant φ there cannot exist a recursive finite-dimensional filter for φ driven by the observations.  相似文献   

10.
The paper presents sufficient conditions for the existence of positive solutions of the equation x″(t) + q(t)f(t,x(t),x′(t)) = 0 with the Dirichlet conditions x(0) = 0, x(1) = 0 and of the equation (p(t)x′(t))′ + p(t)q(t)f(t,x(t),p(t)x′(t)) = 0 with the boundary conditions limto+ p(t)x′(t) = 0, x(1) = 0. Our nonlinearity f is allowed to change sign and f may be singular at x = 0. The proofs are based on a combination of the regularity and sequential techniques and the method of lower and upper functions.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号