Results 31 to 40 of about 11,474 (200)
Generation of Polyhedral Delaunay Meshes
AbstractA polyhedral mesh fulfills the Delaunay condition if the vertices of each polyhedron are co-spherical and each polyhedron circum- sphere is point-free. If Delaunay tessellations are used together with the finite volume method, it is not necessary to partition each polyhedron into tetrahedra; co-spherical elements can be used as final elements ...
Contreras, David +1 more
openaire +1 more source
Revealing Significant Medial Structure in Polyhedral Meshes [PDF]
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for detailed differential geometric information to be recovered. However, exact algorithms for their computation from meshes must solve high-order polynomial equations, while ...
Svetlana Stolpner, Kaleem Siddiqi
openaire +1 more source
VoroCrust: Voronoi Meshing Without Clipping
Polyhedral meshes are increasingly becoming an attractive option with particular advantages over traditional meshes for certain applications. What has been missing is a robust polyhedral meshing algorithm that can handle broad classes of domains ...
Abdelkader, Ahmed +6 more
core +1 more source
A Mesh Deformation Method for CFD-Based Hull form Optimization
Computational fluid dynamics (CFD) is an effective tool for ship resistance prediction and hull form optimization. A three-dimensional volume mesh is essential for CFD simulation, and mesh generation requires much time and effort.
Kwang-Leol Jeong, Se-Min Jeong
doaj +1 more source
A Projective Framework for Polyhedral Mesh Modelling [PDF]
AbstractWe present a novel framework for polyhedral mesh editing with face‐based projective maps that preserves planarity by definition. Such meshes are essential in the field of architectural design and rationalization. By using homogeneous coordinates to describe vertices, we can parametrize the entire shape space of planar‐preserving deformations ...
openaire +2 more sources
Load-Balanced Multi-Criteria Adaptive Mesh Refinement on Polyhedral Meshes
The efficient use of computational resources while maintaining a certain level of solution accuracy through a parallel simulation is a major challenge in CFD. The concept of adaptive mesh refinement (AMR) arises from the idea of, instead of computationally expensive uniform mesh refinement, an algorithm refining the typically moving regions of interest
Fadeli, Mohammed Elwardi +2 more
openaire +1 more source
hp-version time domain boundary elements for the wave equation on quasi-uniform meshes [PDF]
Solutions to the wave equation in the exterior of a polyhedral domain or a screen in $\mathbb{R}^3$ exhibit singular behavior from the edges and corners.
Gimperlein, Heiko +3 more
core +2 more sources
A Two-Level Method for Mimetic Finite Difference Discretizations of Elliptic Problems [PDF]
We propose and analyze a two-level method for mimetic finite difference approximations of second order elliptic boundary value problems. We prove that the two-level algorithm is uniformly convergent, i.e., the number of iterations needed to achieve ...
Antonietti, Paola F. +2 more
core +3 more sources
$C^1$ Virtual Element Method on polyhedral meshes
Computer & Mathematics with Applications (Jul 2019)
Beirao da Veiga L., Dassi F., Russo A.
openaire +3 more sources
The BEM with graded meshes for the electric field integral equation on polyhedral surfaces [PDF]
We consider the variational formulation of the electric field integral equation on a Lipschitz polyhedral surface $\Gamma$. We study the Galerkin boundary element discretisations based on the lowest-order Raviart-Thomas surface elements on a sequence of ...
Bespalov, Alex, Nicaise, Serge
core +4 more sources

