Self-Avoiding walks over adaptive unstructured grids

  • Gerd Heber
  • Rupak Biswas
  • Guang R. Gao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1586)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Biswas, R., Strawn, R.C.: Mesh Quality Control for Multiply-Refined Tetrahedral Grids. Appl. Numer. Math. 20 (1996) 337–348MATHCrossRefGoogle Scholar
  2. 2.
    Gerlach, J.: Application of Natural Indexing to Adaptive Multilevel Methods for Linear Triangular Elements. RWCP Technical Report 97-010 (1997)Google Scholar
  3. 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
  4. 4.
    Griebel, M., Zumbusch, G.: Hash-Storage Techniques for Adaptive Multilevel Solvers and their Domain Decomposition Parallelization. AMS Contemp. Math. Series 218 (1998) 279–286MathSciNetGoogle Scholar
  5. 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. 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. 7.
    Parashar, M., Browne, J.C.: On Partitioning Dynamic Adaptive Grid Hierarchies. 29th Hawaii Intl. Conf. on System Sciences (1996) 604–613Google Scholar
  8. 8.
    Pilkington, J.R., Baden, S.B.: Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves, IEEE Trans. Par. Dist. Sys. 7 (1996) 288–300CrossRefGoogle Scholar
  9. 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

Copyright information

© Springer-Verlag 1999

Authors and Affiliations

  • Gerd Heber
    • 1
  • Rupak Biswas
    • 2
  • Guang R. Gao
    • 1
  1. 1.University of DelawareCAPSLNewarkUSA
  2. 2.MRJ/NASA Ames Research CenterMoffett FieldUSA

Personalised recommendations