summary:The motivation for this paper comes from physical problems defined on bounded smooth domains $\Omega $ in 3D. Numerical schemes for these problems are usually defined on some polyhedral domains $\Omega _h$ and if there is some additional compactness result available, then the method may converge even if $\Omega _h \to \Omega $ only in the sense of compacts. Hence, we use the idea of meshing the whole space and defining the approximative domains as a subset of this partition. \endgraf Numerical schemes for which quantities are defined on dual partitions usually require some additional quality. One of the used approaches is the concept of \emph {well-centeredness}, in which the center of the circumsphere of any element lies inside tha...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2010.A well-centered simplex is a ...
We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise ...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
summary:The motivation for this paper comes from physical problems defined on bounded smooth domains...
Abstract. A completely well-centered tetrahedral mesh is a triangulation of a three dimensional doma...
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in whic...
We present an algorithm for conform (face-to-face) subdividing prismatic partitions into tetrahedra....
AbstractThe non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], est...
In this work we present a survey of some geometric results on tetrahedral partitions and their refin...
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagra...
The finite element method usually requires regular or strongly regular families of partitions in ord...
Tiling space and slabs with acute tetrahedra, with David Eppstein and Alper Üngör. We show it is pos...
Three-dimensional meshes are frequently used to perform physical simulations in sci-ence and enginee...
summary:In this paper we summarize three recent results in computational geometry, that were motivat...
When solving an algorithmic problem involving a poly-hedron in R3, it is common to start by partitio...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2010.A well-centered simplex is a ...
We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise ...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
summary:The motivation for this paper comes from physical problems defined on bounded smooth domains...
Abstract. A completely well-centered tetrahedral mesh is a triangulation of a three dimensional doma...
A completely well-centered tetrahedral mesh is a triangulation of a three dimensional domain in whic...
We present an algorithm for conform (face-to-face) subdividing prismatic partitions into tetrahedra....
AbstractThe non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], est...
In this work we present a survey of some geometric results on tetrahedral partitions and their refin...
Meshes composed of well-centered simplices have nice orthogonal dual meshes (the dual Voronoi diagra...
The finite element method usually requires regular or strongly regular families of partitions in ord...
Tiling space and slabs with acute tetrahedra, with David Eppstein and Alper Üngör. We show it is pos...
Three-dimensional meshes are frequently used to perform physical simulations in sci-ence and enginee...
summary:In this paper we summarize three recent results in computational geometry, that were motivat...
When solving an algorithmic problem involving a poly-hedron in R3, it is common to start by partitio...
138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2010.A well-centered simplex is a ...
We present a practical approach to isotropic tetrahedral meshing of 3D domains bounded by piecewise ...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...