We introduce a near-field to far-field transformation algorithm that relaxes the usual restriction that data points be located on a plane rectangular grid. Computational complexity is O(Nlog N) where N is the number of data points. This algorithm allows efficient processing of near-field data with known probe position errors. Also, the algorithm is applicable to other measurement approaches such as plane-polar scanning, where data are collected intentionally on a nonrectangular grid.