%0 Generic %1 shankar2018robust %A Shankar, Varun %A Kirby, Robert M. %A Fogelson, Aaron L. %D 2018 %K approximation meshfree %T Robust Node Generation for Meshfree Discretizations on Irregular Domains and Surfaces %U http://arxiv.org/abs/1806.02972 %X We present a new algorithm for the automatic one-shot generation of scattered node sets on irregular 2D and 3D domains using Poisson disk sampling coupled to novel parameter-free, high-order parametric Spherical Radial Basis Function (SBF)-based geometric modeling of irregular domain boundaries. Our algorithm also automatically modifies the scattered node sets locally for time-varying embedded boundaries in the domain interior. We derive complexity estimates for our node generator in 2D and 3D that establish its scalability, and verify these estimates with timing experiments. We explore the influence of Poisson disk sampling parameters on both quasi-uniformity in the node sets and errors in an RBF-FD discretization of the heat equation. In all cases, our framework requires only a small number of "seed" nodes on domain boundaries. The entire framework exhibits O(N) complexity in both 2D and 3D.

@preprint{shankar2018robust, abstract = {We present a new algorithm for the automatic one-shot generation of scattered node sets on irregular 2D and 3D domains using Poisson disk sampling coupled to novel parameter-free, high-order parametric Spherical Radial Basis Function (SBF)-based geometric modeling of irregular domain boundaries. Our algorithm also automatically modifies the scattered node sets locally for time-varying embedded boundaries in the domain interior. We derive complexity estimates for our node generator in 2D and 3D that establish its scalability, and verify these estimates with timing experiments. We explore the influence of Poisson disk sampling parameters on both quasi-uniformity in the node sets and errors in an RBF-FD discretization of the heat equation. In all cases, our framework requires only a small number of "seed" nodes on domain boundaries. The entire framework exhibits O(N) complexity in both 2D and 3D.}, added-at = {2018-06-11T19:13:56.000+0200}, author = {Shankar, Varun and Kirby, Robert M. and Fogelson, Aaron L.}, biburl = {https://www.bibsonomy.org/bibtex/2841c19be7b54d461a57ee01b12e56b45/tobydriscoll}, description = {Robust Node Generation for Meshfree Discretizations on Irregular Domains and Surfaces}, interhash = {aaf8785ce4f80b573acd1810eda77615}, intrahash = {841c19be7b54d461a57ee01b12e56b45}, keywords = {approximation meshfree}, note = {cite arxiv:1806.02972Comment: 26 pages, 9 figures, accepted SIAM Journal on Scientific Computing}, timestamp = {2018-06-11T19:13:56.000+0200}, title = {Robust Node Generation for Meshfree Discretizations on Irregular Domains and Surfaces}, url = {http://arxiv.org/abs/1806.02972}, year = 2018 }