Anzeige
Erschienen in:
01.06.2009 | Theoretical Advances
Recognizing convex polygons with few finger probes
Erschienen in: Pattern Analysis and Applications | Ausgabe 2/2009
EinloggenAktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
The problem considered is that of recognizing if a given convex polygon belongs to a known collection by applying the so-called finger probes (i.e., probes by laser-like rays that each return the location of contact). Existing approaches use a number of probes that are linear in the number of sides of the polygon. The current premise is that probing is expensive, while computing is not. Accordingly, a method is proposed that recognizes a polygon (arbitrarily oriented) from the given collection, with high probability, using only a constant number of finger probes, at the cost of fairly large computing resources, particularly, in setting up and applying a range tree data structure. Analysis, though partly heuristic, is validated with software and experimental results.