Results 231 to 240 of about 974,445 (260)

Edge subdivision and dimension

Order, 1988
M. Habib conjectured that the dimension problem for the so-called \(N\)-free partial orders could be solved in polynomial time. Kierstead asked whether the conversion of a partial order by edge subdivision can multiply the dimension by more than a constant; if not, then a polynomial time algorithm for determining the dimension of an \(N\)-free partial ...
openaire   +2 more sources

Embarrassingly parallel mesh refinement by edge subdivision

Engineering with Computers, 2006
We have previously proposed a new technique for the communication-free adaptive refinement of tetrahedral meshes that works for all configurations. Implementations of the scheme must deal with all possible geometric configurations, which results in a large number of cases that in turn result in practical programming issues.
David C. Thompson 0001, Philippe P. Pébay   +1 more
openaire   +1 more source

Edge subdivision for fast diffraction calculations

IEEE Workshop on Applications of Signal Processing to Audio and Acoustics, 2005., 2006
A continuous-time edge-diffraction impulse response (IR) can be expressed as a line-integral along the diffracting edge. With such a formulation, the discrete-time IR is found by subdividing the edge into segments, and for each segment integrating over its length and distributing the result among the appropriate time samples.
P.T. Calamia, U.P. Svensson
openaire   +1 more source

Triangulation refinement by using edge subdivision

Vestnik St. Petersburg University: Mathematics, 2009
For a given triangulation \(T\) with the property that the interior angles of the constituting triangles are within the interval \((\varepsilon,\;\pi-\varepsilon)\), the existence of a refined triangulation \(T'\) with triangles of arbitrarily small diameter and the interior angles within the interval \((\varepsilon/9,\;\pi-\varepsilon/9)\) is proved.
Lebedinskaya, N. A., Lebedinskii, D. M.
openaire   +1 more source

Solving the b-coloring problem for subdivision-edge neighborhood coronas

Discrete Mathematics, Algorithms and Applications, 2023
In this paper, the [Formula: see text]-coloring problem is solved for every subdivision-edge neighborhood corona of paths, cycles, stars and complete graphs. In addition, some exact values and sharp bounds are established for the [Formula: see text]-chromatic number of subdivision-edge neighborhood coronas of these graphs with any other graph.
Raúl M. Falcón, M. Venkatachalam, S. Julie Margaret   +2 more
openaire   +3 more sources

A Scheme for Edge-based Adaptive Tetrahedron Subdivision

1998
A new scheme for adaptive refinement of tetrahedra based on an edge criterion is presented. This scheme guarantees consistent subdivision without cracks. Checks between neighboring tetrahedra of a mesh are not necessary, allowing a recursive algorithm with low space requirements and parallel implementation.
Detlef Ruprecht, Heinrich Müller
openaire   +2 more sources

Extension of half-edges for the representation of multiresolution subdivision surfaces

The Visual Computer, 2008
We address in this paper the problem of the data structures used for the representation and the manipulation of multiresolution subdivision surfaces. The classically used data structures are based on quadtrees, straightforwardly derived from the nested hierarchy of faces generated by the subdivision schemes.
Kraemer, Pierre, Cazier, David, Bechmann, Dominique   +2 more
openaire   +2 more sources

Influence of edge subdivision on the convex domination number.

Australas. J Comb., 2012
We study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in ...
Magda Dettlaff, Magdalena Lemańska
openaire   +2 more sources

2-Domination edge subdivision in trees.

Australas. J Comb.
A set S of vertices in a graph G is a 2-dominating set of G if every vertex not in S has at least two neighbors in S, where two vertices are neighbors if they are adjacent. The 2-domination number of G, denoted by gamma(2)(G), is the minimum cardinality among all 2-dominating sets in G. A gamma(2 )set of G is a 2dominating set of G of cardinality gamma(
Magda Dettlaff, Michael A. Henning, Magdalena Lemańska, Adriana Roux, Jerzy Topp   +4 more
openaire   +2 more sources

Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5

Combinatorica, 2005
Let \(G_1, G_2,\ldots,G_m\), \(m \geq 1\), be a sequence of maximal planar graphs and suppose \(D_i\) is a triangle in \(G_i\). Let \(G_{1,2}\) be obtained from \(G_1\) and \(G_2\) by identifying \(D_1\) and \(D_2\). Now take a triangle \(D_{1,2}\) in \(G_{1,2}\) and identify it with the triangle \(D_3\) in \(G_3\) and let \(G_{1,2,3}\) be the ...
openaire   +1 more source