Preprocessing convex polygons using range trees for recognition with few finger probes

Authors:
Sumanta Guha;Kiêu Trọng Khánh
Affiliations:
Computer Science & Information Management Program, Asian Institute of Technology, Klong Luang, Pathumthani, Thailand;Computer Science & Information Management Program, Asian Institute of Technology, Klong Luang, Pathumthani, Thailand
Venue:
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Year:
2005

Citing 7
Cited 0

Probing convex polytopes

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Determining the shape of a convex n-sided polygon by using 2n+k tactile probes

Information Processing Letters
Shape from probing

Journal of Algorithms
Model-based probing strategies for convex polygons

Computational Geometry: Theory and Applications
Probing polygons minimally is hard

Computational Geometry: Theory and Applications
Geometric Probing and Testing - A Survey

Geometric Probing and Testing - A Survey
Geometric probing

Geometric probing

Quantified Score

Hi-index	0.02

Visualization

Abstract

The problem considered is that of recognizing if a given convex polygon comes from a known collection by applying probes. Existing approaches use a number of probes that is linear in the number of sides of the polygon. The current premise is that probing is expensive, while computing is cheap. Accordingly, a method is proposed that recognizes a polygon from the collection, with high probability, using only a constant number of probes, at the cost of fairly large computing resources, particularly, in setting up and applying a range tree data structure.