This paper presents the framework for finding intersections of an infinite set of wavefronts from pulsars in 2D. The conditions for an intersection to exist are shown along with a numeric scheme for rapidly determining intersection feasibility. The numeric scheme reduces the dimensionality of the problem by one resulting in a much more computationally efficient solution. Using this algorithm the candidate intersections for 3, 4, or 5 pulsars is found for a phase tolerance between 10–3 and 10–5. It was found that to minimize the number of candidate positions within a given domain it is more beneficial to increase the number of pulsars observed rather than decrease the measurement uncertainty. An additional solution is found analytically by solving the mixed-integer math problem. However, this solution does not incorporate any measurement error and there is no way to know how many function evaluations are required to find all solutions within a domain.