There is a growing consensus that state of the art Finite Volume technology requires, and will continue to require too extensive computational resources to provide the necessary resolu- tion, even at the rate that computational power increases. The requirement for high resolution naturally leads us to consider methods which have a higher order of grid convergence than the classical (formal) 2nd order provided by most industrial grade codes. This indicates that higher- order discretization methods will replace at some point the finite volume solvers of today, at least for part of their applications. The development of high-order numerical technologies for CFD is underway for many years now. For example, Discontinuous Galerkin methods (DGM) have been largely studied in the literature, initially in a quite theoretical context, and now in the application point of view. In many contributions, it is shown that the accuracy of the method strongly depends of the accuracy of the geometrical discretization. In other words, the following question is raised: it is true that we have the high order methods, but how do we get the meshes? In this talk, we propose a robust procedure that allows to build a curvilinear mesh for which every element is guaranteed to be valid. The technique builds on standard interior point optimization procedures (IP). It starts from a valid straight sided mesh and continuously modify it up to the point when boundary points are snapped onto the geometric model. Constraints are added to the problem that forbids element jacobians to become too small.