نتایج جستجو برای: eternal m security subdivision number
تعداد نتایج: 1787002 فیلتر نتایج به سال:
The Catmull-Clark subdivision algorithm consists of an operator that can be decomposed into a refinement and a smoothing operator, where the refinement operator splits each face with m vertices into m quadrilateral subfaces and the smoothing operator replaces each internal vertex with an affine combination of its neighboring vertices and itself. In this paper, we generalize the Catmull-Clark sc...
For standard subdivision algorithms and generic input data, near an extraordinary point the distance from the limit surface to the control polyhedron after m subdivision steps is shown to decay dominated by the mth power of the subsubdominant eigenvalue. Conversely, for Loop subdivision we exhibit generic input data so that the Hausdorff distance at the mth step is greater or equal to the mth p...
Abstract. Eternal solutions of parabolic equations (those which are defined for all time) are typically rather rare. For example, the heat equation has exactly one eternal solution – the trivial solution. While solutions to the heat equation exist for all forward time, they cannot be extended backwards in time. Nonlinearities exasperate the situation somewhat, in that solutions may form singula...
A vertex u of a graph “t-dominates” a vertex v if there are at most t vertices different from u, v that are adjacent to v and not to u; and a graph is “t-dominating” if for every pair of distinct vertices, one of them t-dominates the other. Our main result says that if a graph is t-dominating, then it is close (in an appropriate sense) to being 0-dominating. It was already known that every t-do...
LetH be a multigraph, possibly containing loops. AnH-subdivision is any simple graph obtained by replacing the edges of H with paths of arbitrary length. Let H be an arbitrary multigraph of order k, size m, n0(H) isolated vertices and n1(H) vertices of degree one. In [10] it was shown that if G is a simple graph of order n containing an H-subdivision H and δ(G) ≥ n+m−k+n1(H)+2n0(H) 2 , then G c...
abstract: country’s fiber optic network, as one of the most important communication infrastructures, is of high importance; therefore, ensuring security of the network and its data is essential. no remarkable research has been done on assessing security of the country’s fiber optic network. besides, according to an official statistics released by ertebatat zirsakht company, unwanted disconnec...
We show that any polygonal subdivision in the plane can be converted into an “mguillotine” subdivision whose length is at most (1 + c m ) times that of the original subdivision, for a small constant c. “m-Guillotine” subdivisions have a simple recursive structure that allows one to search for the shortest of such subdivisions in polynomial time, using dynamic programming. In particular, a conse...
A new family of interpolatory stationary subdivision schemes is introduced by using radial basis function interpolation. This work extends earlier studies on interpolatory stationary subdivision schemes in two aspects. First, it provides a wider class of interpolatory schemes; each 2L-point interpolatory scheme has the freedom of choosing a degree (say, m) of polynomial reproducing. Depending o...
We consider the class F of labelled 2-connected non-planar graphs without a K3,3-subdivision that are embeddable in the projective plane. A method of enumerating these graphs is described. We also enumerate the homeomorphically irreducible graphs in F and homeomorphically irreducible 2-connected planar graphs. The methods are based on the projective-planarity characterization for graphs without...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید