Meshfree, probabilistic determination of point sets and support regions for meshless computing
Publication:1348280
DOI10.1016/S0045-7825(01)00327-9zbMath0993.65009OpenAlexW2073240454MaRDI QIDQ1348280
Lili Ju, Max D. Gunzburger, Qiang Du
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
algorithmsnumerical examplesparallel computationMonte Carlo methodsmesh generationcentroidal Voronoi tessellationssphere coveringsmeshless computingpoint placement
Monte Carlo methods (65C05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Parallel numerical computation (65Y05)
Related Items (18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothed particle hydrodynamics stability analysis
- Meshless methods: An overview and recent developments
- The partition of unity finite element method: basic theory and applications
- Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations
- Grid generation and optimization based on centroidal Voronoi tessellations
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Multidimensional binary search trees used for associative searching
- Element‐free Galerkin methods
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- Centroidal Voronoi Tessellations: Applications and Algorithms
- Least squares quantization in PCM
- Reproducing kernel particle methods
This page was built for publication: Meshfree, probabilistic determination of point sets and support regions for meshless computing