Efficient clipping of arbitrary polygons
ACM Transactions on Graphics (TOG)
A parallel rendezvous algorithm for interpolation between multiple grids
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Hidden surface removal using polygon area sorting
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Coupling Spectral and Finite Elements for Second Order Elliptic Three-Dimensional Equations
SIAM Journal on Numerical Analysis
Data transfer and interface propagation in multicomponent simulations
Data transfer and interface propagation in multicomponent simulations
Fast algorithms for computing self-avoiding walks and mesh intersections over unstructured meshes
Advances in Engineering Software
Numerical zoom for multiscale problems with an application to nuclear waste disposal
Journal of Computational Physics
Applied Numerical Mathematics
| Hi-index | 0.00 |
We design and analyze an algorithm with linear complexity to perform projections between 2D and 3D nonmatching grids. This algorithm, named the PANG algorithm, is based on an advancing front technique and neighboring information. Its implementation is surprisingly short, and we give the entire Matlab code. For computing the intersections, we use a direct and numerically robust approach. We show numerical experiments both for 2D and 3D grids, which illustrate the optimal complexity and negligible overhead of the algorithm. An outline of this algorithm has already been presented in a short proceedings paper of the 18th International Conference on Domain Decomposition Methods (see Gander and Japhet [2008]).