Jorge L. López-López

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
Given a collection {Z1, Z2,. .. , Zm} of n-sided polygons in the plane and a query polygon W we give algorithms to find all Z ℓ such that W = f (Z ℓ) with f an unknown similarity transformation in time independent of the size of the collection. If f is a known affine transformation, we show how to find all Z ℓ such that W = f (Z ℓ) in O(n + log(m)) time.(More)
  • 1