en
Scientific article
English

Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity

Published inACM Transactions on Mathematical Software, vol. 40, no. 1
Publication date2013-10-03
First online date2013-10-03
Abstract

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]).

eng
Citation (ISO format)
GANDER, Martin Jakob, JAPHET, Caroline. Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity. In: ACM Transactions on Mathematical Software, 2013, vol. 40, n° 1. doi: 10.1145/2513109.2513115
Main files (1)
Article (Published version)
accessLevelRestricted
Identifiers
ISSN of the journal0098-3500
23views
1downloads

Technical informations

Creation09/05/2023 2:31:14 PM
First validation09/06/2023 1:06:16 PM
Update time09/06/2023 1:06:16 PM
Status update09/06/2023 1:06:16 PM
Last indexation02/01/2024 10:37:25 AM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack