Tetrahedralization of a Hexahedral Mesh

Two important classes of three-dimensional elements in computational meshes are hexahedra and tetrahedra. While several efficient methods exist that convert a hexahedral element to a tetrahedral elements, the existing algorithm for tetrahedralization of a hexahedral complex is the marching tetrahedron algorithm which limits pre-selection of face divisions. We generalize a procedure for tetrahedralizing triangular prisms to tetrahedralizing cubes, and combine it with certain heuristics to design an algorithm that can triangulate any hexahedra.Comment: The previous version had an error in the proof of Observation 2.1, which has since been rectified in this version. Formatting and title change

Decomposing and packing polygons / Dania el-Khechen.

In this thesis, we study three different problems in the field of computational geometry: the partitioning of a simple polygon into two congruent components, the partitioning of squares and rectangles into equal area components while minimizing the perimeter of the cuts, and the packing of the maximum number of squares in an orthogonal polygon. To solve the first problem, we present three polynomial time algorithms which given a simple polygon P partitions it, if possible, into two congruent and possibly nonsimple components P 1 and P 2 : an O ( n 2 log n ) time algorithm for properly congruent components and an O ( n 3 ) time algorithm for mirror congruent components. In our analysis of the second problem, we experimentally find new bounds on the optimal partitions of squares and rectangles into equal area components. The visualization of the best determined solutions allows us to conjecture some characteristics of a class of optimal solutions. Finally, for the third problem, we present three linear time algorithms for packing the maximum number of unit squares in three subclasses of orthogonal polygons: the staircase polygons, the pyramids and Manhattan skyline polygons. We also study a special case of the problem where the given orthogonal polygon has vertices with integer coordinates and the squares to pack are (2 {604} 2) squares. We model the latter problem with a binary integer program and we develop a system that produces and visualizes optimal solutions. The observation of such solutions aided us in proving some characteristics of a class of optimal solutions

Advances in honeycomb layered oxides: Part II -- Theoretical advances in the characterisation of honeycomb layered oxides with optimised lattices of cations

The quest for a successful condensed matter theory that incorporates diffusion of cations, whose trajectories are restricted to a honeycomb/hexagonal pattern prevalent in honeycomb layered materials is ongoing, with the recent progress discussed herein focusing on symmetries, topological aspects and phase transition descriptions of the theory. Such a theory is expected to differ both qualitatively and quantitatively from 2D electron theory on static carbon lattices, by virtue of the dynamical nature of diffusing cations within lattices in honeycomb layered materials. Herein, we have focused on recent theoretical progress in the characterisation of pnictogen- and chalcogen-based honeycomb layered oxides with emphasis on hexagonal/honeycomb lattices of cations. Particularly, we discuss the link between Liouville conformal field theory to expected experimental results characterising the optimal nature of the honeycomb/hexagonal lattices in congruent sphere packing problems. The diffusion and topological aspects are captured by an idealised model, which successfully incorporates the duality between the theory of cations and their vacancies. Moreover, the rather intriguing experimental result that a wide class of silver-based layered materials form stable Ag bilayers, each comprising a pair of triangular sub-lattices, suggests a bifurcation mechanism for the Ag triangular sub-lattices, which ultimately requires conformal symmetry breaking within the context of the idealised model, resulting in a cation monolayer-bilayer phase transition. Other relevant experimental, theoretical and computational techniques applicable to the characterisation of honeycomb layered materials have been availed for completeness.Comment: 93 pages, 21 figures, 4 tables, title updated, table of contents adde