Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
From MaRDI portal
Publication:4021081
DOI10.1002/NME.1620330507zbMath0762.65111OpenAlexW2006122675MaRDI QIDQ4021081
Paul-Louis George, François Hermeline
Publication date: 17 January 1993
Published in: International Journal for Numerical Methods in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nme.1620330507
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)
Related Items (23)
OPTIMAL DELAUNAY POINT INSERTION ⋮ A finite volume method for approximating 3D diffusion operators on general meshes ⋮ A simple unstructured tetrahedral mesh generation algorithm for complex geometries ⋮ Three-dimensional unstructured mesh generation. I: Fundamental aspects of triangulation and point creation ⋮ Three-dimensional unstructured mesh generation. III: Volume meshes ⋮ A parallel matrix-free conservative solution interpolation on unstructured tetrahedral meshes ⋮ The reconstruction of boundary contours and surfaces in arbitrary unstructured triangular and tetrahedral grids ⋮ Automatic mesh generator with specified boundary ⋮ A finite volume method for the approximation of Maxwell's equations in two space dimensions on arbitrary meshes ⋮ A new front updating solution applied to some engineering problems ⋮ Approximating constrained tetrahedrizations ⋮ Generation of non-isotropic unstructured grids via directional enrichment ⋮ 2D and 3D finite element meshing and remeshing ⋮ 3D Delaunay mesh generation coupled with an advancing-front approach ⋮ Approximation of 2D and 3D diffusion operators with variable full tensor coefficients on arbitrary meshes ⋮ An adaptive strategy for elliptic problems including a posteriori controlled boundary approximation ⋮ Fast Delaunay triangulation in three dimensions ⋮ Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation ⋮ Unnamed Item ⋮ Breakthrough `workarounds' in unstructured mesh generation ⋮ Adaptivity techniques for compressible inviscid flows ⋮ A Robust Implementation for Three-Dimensional Delaunay Triangulations ⋮ Automatic nodes generation in N-dimensional space
This page was built for publication: Delaunay's mesh of a convex polyhedron in dimension d. application to arbitrary polyhedra
