Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods

DOI10.1137/S0097539799359361zbMath0969.68164OpenAlexW1996542508MaRDI QIDQ2706114

Xiaoxu Han, Suely Oliveira, David E. Stewart

Publication date: 19 March 2001

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539799359361

zbMATH Keywords

computational geometryquadtree and octree search methods

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Efficient searching in meshfree methods

This page was built for publication: Finding Sets Covering a Point with Application to Mesh-Free Galerkin Methods