Results 211 to 220 of about 7,440 (255)
Some of the next articles are maybe not open access.
POLYHEDRON DISTORTIONS IN TOURMALINE
The Canadian Mineralogist, 2002Distortion parameters [?, s2, DI(Y-O), DI(O-Y-O), DI(O-O)] have been calculated for cation polyhedra in tourmalines of different chemical compositions. Tourmalines with greater amounts of small, highly charged ions in the YO6 octahedron display greater bond-length distortion in Y. The size and charge of the occupants at the Y site have been included in
Ertl, Andreas +6 more
openaire +2 more sources
On the multiway cut polyhedron
Networks, 1991AbstractGiven a graph G = (V,E) and a set N ⊆ V, we consider the problem of finding a minimum‐weight multiway cut that separates each pair of nodes in N. In this paper we give an integer programming formulation of this problem and study the associated polyhedron. We give some computational results to support the strength of our facets.
Sunil Chopra, M. R. Rao
openaire +2 more sources
The Continuous Mixing Polyhedron
Mathematics of Operations Research, 2005We analyze the polyhedral structure of the sets PCMIX = {(s, r, z) ∈ R × R+n × Zn ∣ s + rj + zj ≥ fj, j = 1, …, n} and P+CMIX = PCMIX ∩ {s ≥ 0}. The set P+CMIX is a natural generalization of the mixing set studied by Pochet and Wolsey [15, 16] and Günlük and Pochet [8] and recently has been introduced by Miller and Wolsey [12].
openaire +1 more source
On the Complexity of Computing the Volume of a Polyhedron
SIAM Journal on Computing, 1988The paper considers the problem of computing the volume of a polyhedron in n dimensions given either as a convex hull of its vertices or as a set of linear inequalities (both representations use only rational numbers). It is shown that this problem is {\#}P-hard for both representations, i.e., it is at least as hard as computing the permanent of a ...
Martin E. Dyer, Alan M. Frieze
openaire +2 more sources
Adjacency on the Postman Polyhedron
SIAM Journal on Algebraic Discrete Methods, 1981Let $G = (V,E)$ be a loopless, undirected graph and $C \subseteq V$ have even cardinality. A postman set is a subset $J \subseteq E$ such that for every node $v \in V$, the number of edges of J incident to v is odd if and only if $v \in C$. The postman polyhedron$P( G )$ is the sum of the convex hull of all incidence vectors of postman sets and the ...
openaire +1 more source
ABOUT A POLYHEDRON OF CUBIC GRAPHS
Fundamenta Informaticae, 1996A polyhedron M n which is the convex hull of a set of characteristic vectors for all cubic subgraphs of the complete graph G n is studied. It is shown that the problem of vertices nonadjacency recognition for this polyhedron is NP-complete and the ...
Vladimir A. Bondarenko, S. V. Yurov
openaire +2 more sources
Sorting for Polyhedron Compositing
1993There are basically two ways to visualize a scalar function in a volume: (1) draw contour surfaces, or (2) integrate a continuous volume density along viewing rays. The polyhedron compositing scheme of Max, Hanrahan, and Crawfis [9] combines both of these techniques by subdividing the volume cells at contour surfaces, and compositing the resulting ...
openaire +1 more source
Vorotis: Software for Voronoi tessellation analysis using the polyhedron code
Computer Physics Communications, 2022Kengo Nishio
exaly
Polyhedron‐Like Biomaterials for Innervated and Vascularized Bone Regeneration
Advanced Materials, 2023Dong Zhai, Jingge Ma, Hui Zhuang
exaly