Skip to main content
Conference ProceedingsOPEN ACCESS

Parallelizing an unstructured grid generator with a space-filling curve approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1900 815-823
DOI: 10.1007/3-540-44520-x_112
22Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A new parallel partitioning algorithm for unstructured parallel grid generation is presented. This new approach is based on a space filling curve. The space-filling curve’s indices are calculated recursively and in parallel, thus leading to a very efficient and fast load distribution. The resulting partitions have good edge-cut and load balancing characteristics.

Cite

CITATION STYLE

APA

Behrens, J., & Zimmermann, J. (2000). Parallelizing an unstructured grid generator with a space-filling curve approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 815–823). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_112

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free