Partitioning Meshes with Lines and Planes

  title={Partitioning Meshes with Lines and Planes},
  author={Feng Cao and John R. Gilberty and Shang-Hua Tengz},
  • Feng Cao, John R. Gilberty, Shang-Hua Tengz
  • Published 1996
We investigate several geometric methods for dividing an irregular mesh into pieces of roughly equal size with few interconnecting edges. All these methods are based on cutting a mesh with a line (in two dimensions) or a hyperplane (in any dimension). Line cuts have often been used in practice, but their quality varies widely. Until now, no theory has existed to predict the eeectiveness of any line-cut algorithm. We make two main contributions: First, we give rigorous (and tight) bounds on the… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 22 references

Finite element meshes and geometric separators

  • G. L. Miller, S.-H. Teng, W. Thurston, S. A. Vavasis
  • SIAM J. Scienti c Computing, to appear
  • 1995
Highly Influential
6 Excerpts

Automatic mesh partitioning

  • G. L. Miller, S.-H. Teng, W. Thurston, S. A. Vavasis
  • Graph Theory and Sparse Matrix Computa- tion,
  • 1993
Highly Influential
13 Excerpts

Points, Spheres, and Separators: a uni ed geometric approach to graph partitioning

  • S.-H. Teng
  • Ph.D. Thesis, Carnegie Mellon University,
  • 1991
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…