Nearest Neighbor on All Lines

Sometimes even well-understood problems can grow significantly thornier when the variables involved scale up dramatically. Take the problem of joining up the ends of line segments—the algorithm for finding the nearest point on a set of lines to a given point is a common one in modern graphical computing. But when the data sets you're working with become huge, that simple algorithm can take days to execute. Stefan Wörthmüller presents an optimized approach in "Accelerated Search For the Nearest Line."

Posted by Kevin Carlson at 10:22 AM  Permalink