Luis Gajardo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this work, we present an algorithm that finds the closest pair on two data sets, assuming that neither set has an index. A straightforward solution is to build the spatial index on the fly, and then apply algorithms that use such indexes. But if the sets are not used again these techniques are inefficient. Our algorithm considers two steps: First, each(More)
  • 1