6 resultados para Vertex Coloring

em Cambridge University Engineering Department Publications Database


Relevância:

10.00% 10.00%

Publicador:

Resumo:

The imminent inability of silicon-based memory devices to satisfy Moore's Law is approaching rapidly. Controllable nanodomains of ferroic systems are anticipated to enable future high-density nonvolatile memory and novel electronic devices. We find via piezoresponse force microscopy (PFM) studies on lead zirconate titanate (PZT) films an unexpected nanostructuring of ferroelectric-ferroelastic domains. These consist of c-nanodomains within a-nanodomains in proximity to a-nanodomains within c-domains. These structures are created and annihilated as pairs, controllably. We treat these as a new kind of vertex-antivertex pair and consider them in terms of the Srolovitz-Scott 4-state Potts model, which results in pairwise domain vertex instabilities that resemble the vortex-antivortex mechanism in ferromagnetism, as well as dislocation pairs (or disclination pairs) that are well-known in nematic liquid crystals. Finally, we show that these nanopairs can be scaled up to form arrays that are engineered at will, paving the way toward facilitating them to real technologies.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Progress in simulating chevron nozzle jet flows using ILES/RANS-ILES approaches and using the Ffowcs Williams and Hawkings (FW-H) surface integral method to predict the radiated far field sound is presented in this paper. With the focus on the realistic chevron geometries, SMC001 and SMC006, coarse and fine meshes are generated in the range of 3∼13 million mesh cells. Throughout this work, to minimize numerical dissipation introduced by mesh quality issues, the hexahedral cell type is used. Numerical simulations are then carried out with cell-vertex and cell-centered codes. Despite the modest grids, mean velocities and turbulent statistics are found to be in reasonable accord with measurements. Also, far field sound levels predicted by the FW-H post processor are encouraging. Copyright © 2008 by the American Institute of Aeronautics and Astronautics, Inc.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Accurate and efficient computation of the nearest wall distance d (or level set) is important for many areas of computational science/engineering. Differential equation-based distance/ level set algorithms, such as the hyperbolic-natured Eikonal equation, have demonstrated valuable computational efficiency. Here, in the context, as an 'auxiliary' equation to the main flow equations, the Eikonal equation is solved efficiently with two different finite volume approaches (the cell vertex and cell-centered). Application of the distance solution is studied for various geometries. Moreover, a procedure using the differential field to obtain the medial axis transform (MAT) for different geometries is presented. The latter provides a skeleton representation of geometric models that has many useful analysis properties. As an alternative approach to the pure geometric methods (e.g. the Voronoi approach), the current d-MAT procedure bypasses many difficulties that are usually encountered by pure geometric methods, especially in three dimensional space. It is also shown that the d-MAT approach provides the potential to sculpt/control the MAT form for specialized solution purposes. Copyright © 2010 by the American Institute of Aeronautics and Astronautics, Inc.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

An infinite series of twofold, two-way weavings of the cube, corresponding to 'wrappings', or double covers of the cube, is described with the aid of the two-parameter Goldberg- Coxeter construction. The strands of all such wrappings correspond to the central circuits (CCs) of octahedrites (four-regular polyhedral graphs with square and triangular faces), which for the cube necessarily have octahedral symmetry. Removing the symmetry constraint leads to wrappings of other eight-vertex convex polyhedra. Moreover, wrappings of convex polyhedra with fewer vertices can be generated by generalizing from octahedrites to i-hedrites, which additionally include digonal faces. When the strands of a wrapping correspond to the CCs of a four-regular graph that includes faces of size greater than 4, non-convex 'crinkled' wrappings are generated. The various generalizations have implications for activities as diverse as the construction of woven-closed baskets and the manufacture of advanced composite components of complex geometry. © 2012 The Royal Society.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Current methods for formation of detected chess-board vertices into a grid structure tend to be weak in situations with a warped grid, and false and missing vertex-features. In this paper we present a highly robust, yet efficient, scheme suitable for inference of regular 2D square mesh structure from vertices recorded both during projection of a chess-board pattern onto 3D objects, and in the more simple case of camera calibration. Examples of the method's performance in a lung function measuring application, observing chess-boards projected on to patients' chests, are given. The method presented is resilient to significant surface deformation, and tolerates inexact vertex-feature detection. This robustness results from the scheme's novel exploitation of feature orientation information. © 2013 IEEE.