I am looking for an implementation of a method for a pure (or nearly pure) generation of quad-meshes for arbitrary bounded quadrilaterals (similar as here and here). Arbitrary means, that the surface must not be 2D planar. The bounding lines must not be straight, but can be polynoms or splines. Two examples are shown below. The points on the boundary show the mesh seed of the boundary lines. The method should be capable of generating meshes similar to the Paver mesh algorithm implemented in PATRAN.
Is there anything like that available in a free library you know? I would prefer Java, but any open-source code would be ok too.
I had a quick look at advanced Delaunay triangulation or Advancing Front methods and some threads. There I found some lists of possible tools which predominantly offer complex triangular or tetrahedral meshing:
These are quite a lot of tools. Some are outdated or not reachable anymore. Do you have experiences with any of these tools and can tell me if one of them has the capabilities I need?
