In this paper an algorithm for generating pure triangular or pure quadrilateral meshes for arbitrary polygonal domains is presented. The first part shows a triangulation procedure being as suitable for local mesh refinement as for local mesh coarsening. In the second part an algorithm for transformation of triangular grids to quadrilateral meshes of the same relative mesh density is introduced. Two simple strategies are shown which can easily be implemented into any existing triangulation algorithm.     «

In this paper an algorithm for generating pure triangular or pure quadrilateral meshes for arbitrary polygonal domains is presented. The first part shows a triangulation procedure being as suitable for local mesh refinement as for local mesh coarsening. In the second part an algorithm for transformation of triangular grids to quadrilateral meshes of the same relative mesh density is introduced. Two simple strategies are shown which can easily be implemented into any existing triangulation algori...     »