Meshfree, probabilistic determination of point sets and support regions for meshless computing
From MaRDI portal
(Redirected from Publication:1348280)
Recommendations
Cites work
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 1515661 (Why is no real title available?)
- scientific article; zbMATH DE number 947512 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 3386717 (Why is no real title available?)
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Element‐free Galerkin methods
- Grid generation and optimization based on centroidal Voronoi tessellations
- Least squares quantization in PCM
- Meshless methods: An overview and recent developments
- Multidimensional binary search trees used for associative searching
- Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
- Reproducing kernel particle methods
- Smoothed particle hydrodynamics stability analysis
- The partition of unity finite element method: basic theory and applications
Cited in
(21)- POD and CVT-based reduced-order modeling of Navier-Stokes flows
- Parallel Support Set Searches for Meshfree Methods
- Three-dimensional superconvergent gradient recovery on tetrahedral meshes
- Mesh generation for FEM based on centroidal Voronoi tessellations
- Modeling of grain growth using Voronoi discretization and natural neighbor interpolants
- Dimension-splitting data points redistribution for meshless approximation
- Centroidal Voronoi tessellation algorithms for image compression, segmentation, and multichannel restoration
- Adaptive mixed-hybrid and penalty discontinuous Galerkin method for two-phase flow in heterogeneous media
- The optimal centroidal Voronoi tessellations and the Gersho's conjecture in the three-dimensional space
- Adaptive computations using material forces and residual-based error estimators on quadtree meshes
- Adaptive meshless centres and RBF stencils for Poisson equation
- The mixed-cell-complex partition-of-unity method
- Constrained CVT meshes and a comparison of triangular mesh generators
- Recent progress in robust and quality Delaunay mesh generation
- Finding sets covering a point with application to mesh-free Galerkin methods
- Generalised Voronoi tessellation for generating microstructural finite element models with controllable grain-size distributions and grain aspect ratios
- Meshless simulation of a lid-driven cavity problem with a non-Newtonian fluid
- Reduced-order modeling of time-dependent PDEs with multiple parameters in the boundary data
- Adaptive tetrahedral mesh generation by constrained centroidal Voronoi-Delaunay tessellations for finite element methods
- Meshfree generalized multiscale exponential integration method for parabolic problems
- Mesh free Galerkin method based on natural neighbors and conformal mapping
This page was built for publication: Meshfree, probabilistic determination of point sets and support regions for meshless computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348280)
