Meshfree, probabilistic determination of point sets and support regions for meshless computing
DOI10.1016/S0045-7825(01)00327-9zbMATH Open0993.65009OpenAlexW2073240454MaRDI QIDQ1348280FDOQ1348280
Authors: Qiang Du, Max Gunzburger, Lili Ju 
Publication date: 15 May 2002
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0045-7825(01)00327-9
Recommendations
algorithmsnumerical examplesMonte Carlo methodsparallel computationmesh generationcentroidal Voronoi tessellationssphere coveringsmeshless computingpoint placement
Monte Carlo methods (65C05) Parallel numerical computation (65Y05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Least squares quantization in PCM
- Title not available (Why is that?)
- The partition of unity finite element method: basic theory and applications
- Title not available (Why is that?)
- Meshless methods: An overview and recent developments
- Element‐free Galerkin methods
- Title not available (Why is that?)
- Reproducing kernel particle methods
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- Title not available (Why is that?)
- Grid generation and optimization based on centroidal Voronoi tessellations
- Multidimensional binary search trees used for associative searching
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Title not available (Why is that?)
- Smoothed particle hydrodynamics stability analysis
- Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
Cited In (21)
- 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
- Parallel Support Set Searches for Meshfree Methods
- POD and CVT-based reduced-order modeling of Navier-Stokes flows
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)
