اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSimple Methods For Drawing Rational Surfaces as Four or Six Bezier Patches
61
0
0.0
(
0
)
تأليف
Jean Gallier
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 RP2 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.
قيم البحث
اقرأ أيضاً
In this paper, we investigate the efficiency of various strategies for subdividing polynomial triangular surface patches. We give a simple algorithm performing a regular subdivision in four calls to the standard de Casteljau algorithm (in its subdivi
sion version). A naive version uses twelve calls. We also show that any method for obtaining a regular subdivision using the standard de Casteljau algorithm requires at least 4 calls. Thus, our method is optimal. We give another subdivision algorithm using only three calls to the de Casteljau algorithm. Instead of being regular, the subdivision pattern is diamond-like. Finally, we present a ``spider-like subdivision scheme producing six subtriangles in four calls to the de Casteljau algorithm.
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 a
lso 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.
This paper introduces simple analytical formulas for the grid impedance of electrically dense arrays of square patches and for the surface impedance of high-impedance surfaces based on the dense arrays of metal strips or square patches over ground pl
anes. Emphasis is on the oblique-incidence excitation. The approach is based on the known analytical models for strip grids combined with the approximate Babinet principle for planar grids located at a dielectric interface. Analytical expressions for the surface impedance and reflection coefficient resulting from our analysis are thoroughly verified by full-wave simulations and compared with available data in open literature for particular cases. The results can be used in the design of various antennas and microwave or millimeter wave devices which use artificial impedance surfaces and artificial magnetic conductors (reflect-array antennas, tunable phase shifters, etc.), as well as for the derivation of accurate higher-order impedance boundary conditions for artificial (high-) impedance surfaces. As an example, the propagation properties of surface waves along the high-impedance surfaces are studied.
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.
A emph{Stick graph} is an intersection graph of axis-aligned segments such that the left end-points of the horizontal segments and the bottom end-points of the vertical segments lie on a `ground line, a line with slope $-1$. It is an open question to
decide in polynomial time whether a given bipartite graph $G$ with bipartition $Acup B$ has a Stick representation where the vertices in $A$ and $B$ correspond to horizontal and vertical segments, respectively. We prove that $G$ has a Stick representation if and only if there are orderings of $A$ and $B$ such that $G$s bipartite adjacency matrix with rows $A$ and columns $B$ excludes three small `forbidden submatrices. This is similar to characterizations for other classes of bipartite intersection graphs. We present an algorithm to test whether given orderings of $A$ and $B$ permit a Stick representation respecting those orderings, and to find such a representation if it exists. The algorithm runs in time linear in the size of the adjacency matrix. For the case when only the ordering of $A$ is given, we present an $O(|A|^3|B|^3)$-time algorithm. When neither ordering is given, we present some partial results about graphs that are, or are not, Stick representable.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
