Several promising approaches for hexahedral mesh generation work as follows: Given a prescribed quadrilateral surface mesh they first build the combinatorial dual of the hexahedral mesh. This dual mesh is converted into the primal hexahedral mesh, and finally embedded and smoothed into the given domain. Two such approaches, the modified whisker weaving algorithm by Folwell and Mitchell, as well as a method proposed by the author, rely on an iterative elimination of certain dual cycles in the surface mesh. An intuitive interpretation of the latter method is that cycle eliminations correspond to complete sheets of hexahedra in the volume mesh.
Although these methods can be shown to work in principle, the quality of the generated meshes heavily relies on the dual cycle structure of the given surface mesh. In particular, it seems that difficulties in the hexahedral meshing process and poor mesh qualities are often due to self-intersecting dual cycles. Unfortunately, all previous work on quadrilateral surface mesh generation has focused on quality issues of the surface mesh alone but has disregarded its suitability for a high-quality extension to a three-dimensional mesh.
In this paper, we develop a new method to generate quadrilateral surface meshes without self-intersecting dual cycles. This method reuses previous b-matching problem formulations of the quadrilateral mesh refinement problem. The key insight is that the b-matching solution can be decomposed into a collection of simple cycles and paths of multiplicity two, and that these cycles and paths can be consistently embedded into the dual surface mesh.
A second tool uses recursive splitting of components into simpler subcomponents by insertion of internal two-manifolds. We show that such a two-manifold can be meshed with quadrilaterals such that the induced dual cycle structure of each subcomponent is free of self-intersections if the original component satisfies this property. Experiments show that we can achieve hexahedral meshes with a good quality. 相似文献
Let d, k and n be three integers with k3, d4k−1 and n3k. We show that if d(x)+d(y)d for each pair of nonadjacent vertices x and y of a graph G of order n, then G contains k vertex-disjoint cycles converting at least min{d,n} vertices of G. 相似文献
A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.We discuss several results for cycle covers and the corresponding results for cut covers. Our main result is that every connected graph on n vertices and e edges has a cut cover of total size at most 2e-n+1 with equality precisely when every block of the graph is an odd cycle or a complete graph (other than K4 or K8). This corresponds to the result of Fan [J. Combin. Theory Ser. B 74 (1998) 353-367] that every graph without cut-edges has a cycle cover of total size at most e+n-1. 相似文献
PSN is a fast forward permutation if for each m the computational complexity of evaluating Pm(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in SN is Θ(N) if one does not use queries of the form Pm(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form Pm(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold. 相似文献
PVC disulfide (2SPVC) was synthesized by solution crosslink and its molecular structure was confirmed by infrared spectrum. 2SPVC's specific area is 36.1 m2·g-1 tested by stand BET method, and granularity experiment gives out the particle size of d0.5= 11.3μm. With SEM (Scanning Electron Microscope) experiment the surface morphology and particle shape of 2SPVC were observed. Cyclic voltammetry (scan rate: 0.5 mV·s-1) shows that 2SPVC experience an obvious S-S redox reaction in charge-discharge process. When 2SPVC was used as cathode material for secondary lithium battery in a 1 mol·L-1 solution of lithium bis(trifluoromethylsulfonyl) imide (Li(CF3SO2)2N) in a 5:45:50 volume ratio mixture of o-xylene (oxy), diglyme (DG) and dimethoxymethane (DME) at 30℃, the first discharge capacity of 2SPVC is about 400.3 mAh·g-1 which is very close to its theoretical value (410.5 mAh·g-1) at a constant discharge current of 15 mA·g-1. It can retain at about 346.1 mAh·g-1 of discharge capacity after 30 charge-discharge cycles. So 2SPVC is a very promising cathode candidate for rechargeable lithium batteries. 相似文献
Planted three-dimensional (3D) trees, which are defined as a 3D version of planted trees, are enumerated by means of Fujita’s
proligand method formulated in Parts 1–3 of this series [Fujita in Theor Chem Acc 113:73–79, 80–86, 2005; Fujita in Theor
Chem Acc 115:37–53, 2006]. By starting from the concepts of proligand and promolecule introduced previously [Fujita in Tetrahedron
47:31–46, 1991], a planted promolecule is defined as a 3D object in which the substitution positions of a given 3D skeleton are occupied by a root and proligands.
Then, such planted promolecules are introduced as models of planted 3D-trees. Because each of the proligands in a given planted
promolecule is regarded as another intermediate planted promolecule in a nested fashion, the given planted promolecule is
recursively constructed by a set of such intermediates planted promolecules. The recursive nature of such intermediate planted
promolecules is used to derive generating functions for enumerating planted promolecules or planted 3D-trees. The generating
functions are based on cycle indices with chirality fittingness (CI-CFs), which are composed of three kinds of sphericity
indices (SIs), i.e., ad for homospheric cycles, cd for enantiospheric cycles, and bd for hemispheric cycles. For the purpose of evaluating cd recursively, the concept of diploid is proposed, where the nested nature of cd is demonstrated clearly. The SIs are applied to derive functional equations for recursive calculations, i.e., a(x), c(x2), and b(x). Thereby, planted 3D-trees or equivalently monosubstituted alkanes as stereoisomers are enumerated recursively by counting
planted promolecules. The resulting values are collected up to 20 carbon content in a tabular form. Now, the enumeration problem
initiated by mathematician Cayley [Philos Mag 47(4):444–446, 1874] has been solved in such a systematic and integrated manner
as satisfying both mathematical and chemical requirements. 相似文献