Results 191 to 200 of about 586,655 (242)
Some of the next articles are maybe not open access.
Polygonal surface mesh optimization
Engineering with Computers, 2004A procedure has been developed to improve polygonal surface mesh quality while maintaining the essential characteristics of the discrete surface. The surface characteristics are preserved by repositioning mesh vertices so that they remain on the original discrete surface.
Rao V. Garimella, Mikhail J. Shashkov
openaire +1 more source
Handbook of Computational Geometry, 2020
An essential step in scientific computing is to find a proper discretization of a continuous domain. This is the problem of mesh generation. Once we have a discretization or sometimes we just say a " mesh " , differential equations for flow, waves, and ...
Marshall Bern, P. Plassmann
semanticscholar +1 more source
An essential step in scientific computing is to find a proper discretization of a continuous domain. This is the problem of mesh generation. Once we have a discretization or sometimes we just say a " mesh " , differential equations for flow, waves, and ...
Marshall Bern, P. Plassmann
semanticscholar +1 more source
Polygonal and Polyhedral Delaunay Meshing
2021We consider construction of a polyhedral Delaunay partition as a limit of the sequence of radical partitions (power diagrams), while the dual Voronoi diagram is obtained as a limit of sequence of weighted Delaunay partitions. Using a lifting analogy, this problem is reduced to the construction of a pair of dual convex polyhedra, inscribed and ...
Vladimir Garanzha, Liudmila Kudryavtseva
openaire +1 more source
Untangling polygonal and polyhedral meshes via mesh optimization
Engineering with Computers, 2014We propose simple and efficient optimization-based untangling strategies for 2D polygonal and 3D polyhedral meshes. The first approach uses a size-based mesh metric, which eliminates inverted elements by averaging element size over the entire mesh.
Jibum Kim, Jaeyong Chung
openaire +1 more source
, 2020
The scaled boundary finite element method is developed for transient thermoelastic fracture analysis. To enable this, a set of novel shape functions are derived considering thermoelastic equilibrium. The salient features of the proposed framework are: (a)
E. Ooi +5 more
semanticscholar +1 more source
The scaled boundary finite element method is developed for transient thermoelastic fracture analysis. To enable this, a set of novel shape functions are derived considering thermoelastic equilibrium. The salient features of the proposed framework are: (a)
E. Ooi +5 more
semanticscholar +1 more source
Mesh Optimization for Polygonized Isosurfaces
Computer Graphics Forum, 2001In this paper, we propose a method for improvement of isosurface polygonizations. Given an initial polygonization of an isosurface, we introduce a mesh evolution process initialized by the polygonization. The evolving mesh converges quickly to its limit mesh which provides with a high quality approximation of the isosurface even if the isosurface has ...
Yutaka Ohtake, Alexander G. Belyaev
openaire +1 more source
Perfect Laplacians for Polygon Meshes
Computer Graphics Forum, 2015AbstractA discrete Laplace‐Beltrami operator is called perfect if it possesses all the important properties of its smooth counterpart. It is known which triangle meshes admit perfect Laplace operators and how to fix any other mesh by changing the combinatorics.
Philipp Herholz +2 more
openaire +1 more source
Delaunay Triangular Meshes in Convex Polygons
SIAM Journal on Scientific and Statistical Computing, 1986Es wird ein Algorithmus vorgestellt, der eine Triangularisierung eines gegebenen konvexen Polygons P erzeugt (dies ist ein Teilschritt für die Finite-Element-Triangularisierung eines komplexen polygonalen Bereichs). Im Inneren von P entsteht ein quasi-gleichmäßiges Dreiecksgitter der Größe h, die auf dem Rand von P liegenden Dreiecksseiten haben auf ...
openaire +1 more source
A novel mesh saliency approximation for polygonal mesh segmentation
Multimedia Tools and Applications, 2017To assist a great variety of applications including object recognition or shape matching, 3D scene analysis, view point selection, mesh simplification, segmentation, and 3D printing etc., the approximation of mesh or part saliency has been intensively studied in recent years.
Hung-Kuang Chen, Mu-Wei Li
openaire +1 more source