نتایج جستجو برای: hyperbolic uniform spline

تعداد نتایج: 148446  

2007
Srinivasan Natesan Rajesh K. Bawa

In this article, we consider singularly perturbed reaction-diffusion Robin boundary-value problems. To solve these problems we construct a numerical method which involves both the cubic spline and classical finite difference schemes. The proposed scheme is applied on a piece-wise uniform Shishkin mesh. Truncation error is obtained, and the stability of the method is analyzed. Also, parameter-un...

2007
Carole Blanc Pascal Guitton

In order to get an optimal use of all the interesting features for free-form mod-eling provided by sophisticated geometric models (Bezier, B-Spline, NURBS), we propose a deformation technique based on the concept of normalized operators. Such an operator can be viewed as a black-box which encloses | and hides to the user | the high number and the complexity of the parameters involved during a d...

Journal: :Computer Aided Geometric Design 2009
Kestutis Karciauskas Jörg Peters

We introduce a non-uniform subdivision algorithm that partitions the neighborhood of an extraordinary point in the ratio σ : 1 − σ, where σ ∈ (0, 1). We call σ the speed of the non-uniform subdivision and verify C continuity of the limit surface. For σ = 1/2, the Catmull-Clark limit surface is recovered. Other speeds are useful to vary the relative width of the polynomial spline rings generated...

Journal: :Computers & Graphics 2012
Hailing Zhou Jianmin Zheng Xunnian Yang

This paper introduces a special arc spline called an Euler arc spline as the basic form for visually pleasing completion curves. It is considered as an extension of an Euler curve in the sense that the points in the Euler curve are replaced by arcs. A simple way for specifying it, which is suitable for shape completion, is presented. It is shown that Euler arc splines have several properties de...

2007
Jana Procházková David Procházka

Derivatives are a very important tool of computations in an engineering practice on the graphics structures. B-Spline functions are defined recursively, so the direct computation is very difficult. In this article new direct proof of the formula used for simpler direct computation is shown. The paper also presents own method of programming derivatives of NURBS curves by means of the proven form...

Journal: :CoRR 2012
Roger A. Sauer Thang X. Duong Callum J. Corbett

A geometrically exact membrane formulation is presented that is based on curvilinear coordinates and isogeometric finite elements, and is suitable for both solid and liquid membranes. The curvilinear coordinate system is used to describe both the theory and the finite element equations of the membrane. In the latter case this avoids the use of local cartesian coordinates at the element level. C...

2003
Guerino Mazzola Stefan Müller Arisona

Our ongoing research in performance theory integrates methods for complex instrument parameter spaces and models for musical gestures. The latter are modelled as parametric curves residing in high-dimensional symbolic and physical gesture spaces. This article shortly exposes basic concepts of those spaces and the construction of symbolic gesture curves. It then discusses the problem of fitting ...

2011
Wen-Haw Chen

This paper proposes a method to improve the shortest path problem on a NURBS (Non-uniform rational basis spline) surfaces. It comes from an application of the theory in classic differential geometry on surfaces and can improve the distance problem not only on surfaces but in the Euclidean 3-space R . Keywords—shortest paths, geodesic-like method, NURBS surfaces.

2004
Luca Ghezzi

A method is presented to interpolate real affine plane curves with second degree NURBS (Non Uniform Rational Bezier Splines). The curve into object is initially partitioned into an arbitrary number of arcs. Then each arc is approximated with a conic section passing thru its extremes, thru a third intermediate point and being tangent to the arc at the extremes. Each arc is then parameterized by ...

2011
S. Bharath M. Ramanathan

Given two distinct points S and E on a simply-connected domain (without holes) enclosed by a closed parametric curve, this paper provides an algorithm to find the shortest interior path (SIP) between the two points in the domain. SIP consists of portions of curves along with straight line segments that are tangential to the curve. The algorithm initially computes point-curve tangents and bitang...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید