Combinatorially optimized grid generation

Abstract

We present a grid conversion algorithm, generating a quadrilateral grid out of an arbitrary polygonal grid. Our aim is a conversion resulting in a low increase in grid elements, which our algorithm achieves by using combinatorial optimization - i.e. transformation of the problem to a graph theoretical problem and using a solution to the latter. The algorithm is embedded in a grid generation scheme based on the octree approach. Another useful application is the conversion of a triangular grid into a quadrilateral grid. (orig.)Available from TIB Hannover: RR 6943(97-17) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman