The design and analysis of spatial data structures
The design and analysis of spatial data structures
Composite overlapping meshes for the solution of partial differential equations
Journal of Computational Physics
Renumbering unstructured grids to improve the performance of codes on hierarchical memory machines
Advances in Engineering Software
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A parallel rendezvous algorithm for interpolation between multiple grids
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
On parallel implementations of dynamic overset grid methods
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
Algorithm 932: PANG: Software for nonmatching grid projections in 2D and 3D with linear complexity
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.00 |
This paper is concerned with designing an efficient algorithm for computing the intersection of two unstructured meshes. The algorithm uses a background quadtree from the first unstructured mesh and a self-avoiding walk (SAW) from the second unstructured mesh. Due to the relationships between neighboring consecutive triangles in the triangle sequence of a SAW, we can track the location of each triangle in the second unstructured mesh by means of a background quadtree. This allows us to design an approximately linear time algorithm for computing the mesh intersection. Experiments show that our efficient algorithm for computing the mesh intersection saves considerable execution time when compared to other algorithms. We also present two new SAWs. Using our first-in-first-out (FIFO) SAW saves an additional 5% in the execution time over other SAWs as our FIFO SAW employs better data locality, which is especially beneficial to hierarchical-memory computer architectures.