Given a plane with an unbounded number of random points, is there an economical algorithm to find the Voronoi zone of any one selected point?
I've considered making a "sweeping" circle from that point, adding a line to the zone boundary as I meet points of increasing distance; would this solution be correct as soon as I have enough lines to enclose a polygon?
(The obvious corollary question is "If stopping as soon as the point is bounded isn't correct, when do I stop?")