✦ LIBER ✦

Computational techniques for processing parametric surfaces

✍ Scribed by P.A Koparkar; S.P Mudur

Publisher: Elsevier Science
Year: 1984
Weight: 93 KB
Volume: 27
Category: Article
ISSN: 0734-189X
DOI: 10.1016/0734-189x(84)90090-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing all parametric solutions for b

Computing all parametric solutions for blending parametric surfaces

✍ Sonia Pérez-Dı́az; J. Rafael Sendra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 853 KB

In this paper we prove that, for a given set of parametric primary surfaces and parametric clipping curves, all parametric blending solutions can be expressed as the addition of a particular parametric solution and a generic linear combination of the basis of a free module of rank 3. As a consequenc

Computing Rational Parametrizations of C

Computing Rational Parametrizations of Canal Surfaces

✍ MARTIN PETERNELL; HELMUT POTTMANN 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A canal surface is the envelope of a one-parameter set of spheres with radii r(t) and centers m(t). It is shown that any canal surface to a rational spine curve m(t) and a rational radius function r(t) possesses rational parametrizations. We derive algorithms for the computation of these parametriza

Chebyshev economization for parametric s

Chebyshev economization for parametric surfaces

✍ Michael A. Lachance 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 983 KB

Computer simulation of a parametric opti

Computer simulation of a parametric optimization problem for an industrial process

✍ J.P. Humeau; M. Grolleau 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 293 KB

Results in functional analysis are applied to the co~utation of the optimal control of a parabolic distributed parameter system° The control term is a coefficient of the state equation, and is computed by the steepest descent method, An a-priori feedback is determined in the case of a constant contr

The computational algorithm for the para

The computational algorithm for the parametric objective function

✍ Saul Gass; Thomas Saaty 📂 Article 📅 1955 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

Two Computational Techniques for Singula

Two Computational Techniques for Singularity Resolution

✍ Gábor Bodnár; Josef Schicho 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 356 KB

This paper presents two efficient computational techniques in algebraic geometry. The first one allows the elimination of redundancies in the representation of quasi-projective varieties by atlases of affine charts. The second simplifies the computations with exponentiated ideals by attaching ration