Publication Date:
2019-07-13
Description:
Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.
Keywords:
Cybernetics, Artificial Intelligence and Robotics
Type:
SIAM Parallel Processing Conference; Mar 22, 1999 - Mar 24, 1999; San Antonio, TX; United States
Format:
application/pdf