.png){kind=icon}
返回
Geometric mesh partitioning: Implementation and experiments
.png){kind=icon}
OA
AI
DOI：10.1137/S1064827594275339.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
centerpoints
conformal mapping
geometric sampling
graph and geometric algorithms
MATLAB
mesh partitioning
moment of inertia
parallel processing
separators
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容