اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBezier developable surfaces
60
0
0.0
(
0
)
نشر من قبل
Leonardo Fernandez-Jambrina
تاريخ النشر
2017
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
L. Fernandez-Jambrina
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we address the issue of designing developable surfaces with Bezier patches. We show that developable surfaces with a polynomial edge of regression are the set of developable surfaces which can be constructed with Aumanns algorithm. We also obtain the set of polynomial developable surfaces which can be constructed using general polynomial curves. The conclusions can be extended to spline surfaces as well.
قيم البحث
اقرأ أيضاً
In this paper we construct developable surface patches which are bounded by two rational or NURBS curves, though the resulting patch is not a rational or NURBS surface in general. This is accomplished by reparameterizing one of the boundary curves. T
he reparameterization function is the solution of an algebraic equation. For the relevant case of cubic or cubic spline curves, this equation is quartic at most, quadratic if the curves are Bezier or splines and lie on parallel planes, and hence it may be solved either by standard analytical or numerical methods.
In this paper we review the derivation of implicit equations for non-degenerate quadric patches in rational Bezier triangular form. These are the case of Steiner surfaces of degree two. We derive the bilinear forms for such quadrics in a coordinate-f
ree fashion in terms of their control net and their list of weights in a suitable form. Our construction relies on projective geometry and is grounded on the pencil of quadrics circumscribed to a tetrahedron formed by vertices of the control net and an additional point which is required for the Steiner surface to be a non-degenerate quadric.
In this paper we provide a characterisation of rational developable surfaces in terms of the blossoms of the bounding curves and three rational functions $Lambda$, $M$, $ u$. Properties of developable surfaces are revised in this framework. In partic
ular, a closed algebraic formula for the edge of regression of the surface is obtained in terms of the functions $Lambda$, $M$, $ u$, which are closely related to the ones that appear in the standard decomposition of the derivative of the parametrisation of one of the bounding curves in terms of the director vector of the rulings and its derivative. It is also shown that all rational developable surfaces can be described as the set of developable surfaces which can be constructed with a constant $Lambda$, $M$, $ u$ . The results are readily extended to rational spline developable surfaces.
In this paper, we give several simple methods for drawing a whole rational surface (without base points) as several Bezier patches. The first two methods apply to surfaces specified by triangular control nets and partition the real projective plane R
P2 into four and six triangles respectively. The third method applies to surfaces specified by rectangular control nets and partitions the torus RP1 X RP1 into four rectangular regions. In all cases, the new control nets are obtained by sign flipping and permutation of indices from the original control net. The proofs that these formulae are correct involve very little computations and instead exploit the geometry of the parameter space (RP2 or RP1 X RP1). We illustrate our method on some classical examples. We also propose a new method for resolving base points using a simple ``blowing up technique involving the computation of ``resolved control nets.
Continuous collision detection (CCD) and response methods are widely adopted in dynamics simulation of deformable models. They are history-based, as their success is strictly based on an assumption of a collision-free state at the start of each time
interval. On the other hand, in many applications surfaces have normals defined to designate their orientation (i.e. front- and back-face), yet CCD methods are totally blind to such orientation identification (thus are orientation-free). We notice that if such information is utilized, many penetrations can be untangled. In this paper we present a history-free method for separation of two penetrating meshes, where at least one of them has clarified surface orientation. This method first computes all edge-face (E-F) intersections with discrete collision detection (DCD), and then builds a number of penetration stencils. On response, the stencil vertices are relocated into a penetration-free state, via a global displacement minimizer. Our method is very effective for handling penetration between two meshes, being it an initial configuration or in the middle of physics simulation. The major limitation is that it is not applicable to self-collision within one mesh at the time being.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
