In this paper, we presetn 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 ocmbinatorial since it sues the mesh connectivity only. We also show how the concept can be easily modidied for adaptivegrids that are generated in a hierarchical manner based on a set of simple rules, and made amenable ofr efficient parallelization. The proposed approach should be vry useful in the runtime partitioning and load balancing of adaptive unstructured grids.
展开▼
