Geometric hashing
id:
geometric-hashing-243-14728960
title:
Geometric hashing
text:
In computer science, geometric hashing is a method for efficiently finding two-dimensional objects represented by discrete points that have undergone an affine transformation, though extensions exist to other object representations and transformations. In an off-line step, the objects are encoded by treating each pair of points as a geometric basis. The remaining points can be represented in an invariant fashion with respect to this basis using two parameters. For each point, its quantized trans
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Geometric_hashing
date created:
date modified:
2023-12-03T16:37:55Z
main entity:
{"identifier":"Q5535489","url":"https://www.wikidata.org/entity/Q5535489"}
image:
fields total:
13
integrity:
13