Self-Avoiding walks over adaptive unstructured grids
In this paper, we present self-avoiding walks as a novel technique to “linearize” a triangular mesh. Unlike space-filling curves which are based on a geometric embedding, our algorithm is combinatorial since it uses the mesh connectivity only. We also show how the concept can be easily modified for adaptive grids that are generated in a hierarchical manner based on a set of simple rules, and made amenable for efficient parallelization. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.
Unable to display preview. Download preview PDF.
- 2.Gerlach, J.: Application of Natural Indexing to Adaptive Multilevel Methods for Linear Triangular Elements. RWCP Technical Report 97-010 (1997)Google Scholar
- 3.Gerlach, J., Heber, G.: Fundamentals of Natural Indexing for Simplex Finite Elements in Two and Three Dimensions. RWCP Technical Report 97-008 (1997)Google Scholar
- 5.Heber, G., Biswas, R., Gao, G.R.: Self-Avoiding Walks over Two-Dimensional Adaptive Unstructured Grids. NAS Technical Report NAS-98-007 (1998)Google Scholar
- 6.Ou, C.-W., Ranka, S., Fox, G.: Fast and Parallel Mapping Algorithms for Irregular Problems, J. of Supercomp. 10 (1995) 119–140Google Scholar
- 7.Parashar, M., Browne, J.C.: On Partitioning Dynamic Adaptive Grid Hierarchies. 29th Hawaii Intl. Conf. on System Sciences (1996) 604–613Google Scholar
- 9.Salmon, J., Warren, M.S.: Parallel, Out-of-Core Methods for Fast Evaluation of Long-Range Interactions. 8th SIAM Conf. on Par. Proc. for Sci. Comput. (1997)Google Scholar