# Automatic Mesh Partitioning

Conference paper

DOI: 10.1007/978-1-4613-8369-7_3

- Cite this paper as:
- Miller G.L., Teng SH., Thurston W., Vavasis S.A. (1993) Automatic Mesh Partitioning. In: George A., Gilbert J.R., Liu J.W.H. (eds) Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Applications, vol 56. Springer, New York, NY

## Abstract

This paper describes an efficient approach to partitioning unstructured meshes that occur naturally in the finite element and finite difference methods. This approach makes use of the underlying geometric structure of a given mesh and finds a provably good partition in random *O*(*n*) time. It applies to meshes in both two and three dimensions. The new method has applications in efficient sequential and parallel algorithms for large-scale problems in scientific computing. This is an overview paper written with emphasis on the algorithmic aspects of the approach. Many detailed proofs can be found in companion papers.

### Keywords

Center points domain decomposition finite element and finite difference meshes geometric sampling mesh partitioning nested dissection radon points overlap graphs separators stereographic projections## Preview

Unable to display preview. Download preview PDF.

## Copyright information

© Springer-Verlag New York, Inc. 1993