Sciweavers

Share
IPPS
1999
IEEE

Self-Avoiding Walks over Adaptive Unstructured Grids

9 years 3 months ago
Self-Avoiding Walks over Adaptive Unstructured Grids
Abstract. In this paper, we present self-avoiding walks as a novel technique to linearize" a triangular mesh. Unlike space- lling 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 modi ed for adaptive grids that are generated in a hierarchical manner based on a set of simple rules, and made amenable for e cient parallelization. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.
Gerd Heber, Rupak Biswas, Guang R. Gao
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors Gerd Heber, Rupak Biswas, Guang R. Gao
Comments (0)
books