Related papers: Tetrahedralization of a Hexahedral Mesh
In this paper we introduce three complementary three-dimensional weighted quadratic enrichment strategies to improve the accuracy of local histopolation on tetrahedral meshes. The first combines face and interior weighted moments…
The present paper suggests a new approach for geometric representation of 3D spatial models and provides a new compression algorithm for 3D meshes, which is based on mathematical theory of convex geometry. In our approach we represent a 3D…
We extend earlier international efforts to optimise hexahedral-based spectral element methods on GPUs and vectorised CPUs to mixed element meshes additionally involving prismatic, pyramidic, and tetrahedral shapes using tensorial…
This paper shows that constraint programming techniques can successfully be used to solve challenging hex-meshing problems. Schneiders' pyramid is a square-based pyramid whose facets are subdivided into three or four quadrangles by adding…
We determine the numbers of integral tetrahedra with diameter $d$ up to isomorphism for all $d\le 1000$ via computer enumeration. Therefore we give an algorithm that enumerates the integral tetrahedra with diameter at most $d$ in $O(d^5)$…
We introduce the tetrahedron trinomial coefficient transform which takes a Pascal-like arithmetical triangle to a sequence. We define a Pascal-like infinite tetrahedron H, and prove that the application of the tetrahedron trinomial…
The creation of a volumetric mesh representing the interior of an input polygonal mesh is a common requirement in graphics and computational mechanics applications. Most mesh creation techniques assume that the input surface is not…
We present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is definedas the set of points from which the whole polyhedron is visible. Whilst the computation of the…
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primal-dual mesh pairs. We prove that well-centered meshes also have…
Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…
The generation of triangle meshes from point clouds, i.e. meshing, is a core task in computer graphics and computer vision. Traditional techniques directly construct a surface mesh using local decision heuristics, while some recent methods…
We consider an algorithm called FEMWARP for warping triangular and tetrahedral finite element meshes that computes the warping using the finite element method itself. The algorithm takes as input a two- or three-dimensional domain defined…
The Finite Element Method (FEM) is widely used to solve discrete Partial Differential Equations (PDEs) in engineering and graphics applications. The popularity of FEM led to the development of a large family of variants, most of which…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…
Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…
An algorithm to compute the six distances between particles of a planar Four-Body central configuration is presented according to the following schema. An orthocentric tetrahedron is computed as a function of given masses. Each mass is…
We propose a compact and efficient tetrahedral mesh representation to improve the ray-tracing performance. We reorder tetrahedral mesh data using a space-filling curve to improve cache locality. Most importantly, we propose an efficient ray…
Icosahedron and dodecahedron can be dissected into tetrahedral tiles projected from 3D-facets of the Delone polytopes representing the deep and shallow holes of the root lattice D_6. The six fundamental tiles of tetrahedra of edge lengths 1…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…