Probing polygons minimally is hard

Authors:
Patrice Belleville;Thomas C. Shermer
Affiliations:
-;-
Venue:
Computational Geometry: Theory and Applications
Year:
1993

Citing 0
Cited 3

Data structures for maintaining set partitions

Random Structures & Algorithms
A note on data structures for maintaining bipartitions

Journal of Discrete Algorithms
Preprocessing convex polygons using range trees for recognition with few finger probes

CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns

Quantified Score

Hi-index	0.00

Visualization

Abstract