This paper describes a new two task approach for extracting the centerline from simple 2D polygons. An algorithm of the first task, which generates a set of points for future centerline, is presented. The idea of the algorithm is to use the polygon hatching by parallel lines and creating paths from its middle points in different polygon rotations. The centerline is derived from the intersection points between these paths. The algorithm was developed for printed circuit board insulation process and its execution time for a few hundred polygons is less than one second. The algorithm is easy to understand and implement.DOI: http://dx.doi.org/10.5755/j01.itc.45.3.12964