One part of the production of modern hearing aids is the integration of a ventilation tube. This is usually done by applying a shortest path search algorithm on a non-convex ear impression. For the functionality of this so-called vent the path search algorithm has to fulfill several constraints like smoothness and space consumption of the vent. The proposed solution is based upon a modified version of Dijkstra’s algorithm to address the constraints and to increase accuracy. The algorithm was evaluated by experts and validated to perform better for the application than a shortest path solution.