9th International Parallel Processing Symposium Geometric mesh partitioning: implementation and experiments Santa Barbara, CA April 25-April 28 ISBN: 0-8186-7074-6
We investigate a method of dividing an irregular mesh into equal-sized pieces with few interconnecting edges. The method's novel feature is that it exploits the geometric coordinates of the mesh vertices. It is based on theoretical work of Miller, Teng, Thurston, and Vavasis, who showed that certain classes of "well-shaped" finite element meshes have good separators. The geometric method is quite simple to implement: we describe a Matlab code for it in some detail. The method is also quite efficient and effective: we compare it with some other methods, including spectral bisection.
Index Terms:
finite element analysis; mesh generation; computational geometry; geometric mesh partitioning; irregular mesh; equal-sized pieces; geometric coordinates; mesh vertices; finite element meshes; Matlab code; spectral bisection
Citation:
J.R. Gilbert, G.L. Miller, Shang-Hua Teng, "Geometric mesh partitioning: implementation and experiments," ipps, pp.418, 9th International Parallel Processing Symposium, 1995 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||