线性复杂度的六面体网格生成
计算几何
2010-01-21 v1
摘要
我们证明了任何形成拓扑球体且拥有偶数个四边形边的多面体，都可以划分为 O(n) 个拓扑立方体，彼此面对面相连。该结果推广到满足额外二分性条件的非简单联通多面体。同样的技术也可用于将六面体网格生成问题的几何版本降低为机器可解的有限案例分析。
引用
@article{arxiv.cs/9809109,
title = {Linear Complexity Hexahedral Mesh Generation},
author = {David Eppstein},
journal= {arXiv preprint arXiv:cs/9809109},
year = {2010}
}
备注
12 pages, 17 figures. A preliminary version of this paper appeared at the 12th ACM Symp. on Computational Geometry. This is the final version, and will appear in a special issue of Computational Geometry: Theory and Applications for papers from SCG '96