Polygon-containment and translational min-Hausdorff-distance between segment sets are 3SUM-hard

Authors:
Gill Barequet;Sariel Har-Peled
Affiliations:
Faculty of Computer Science, The Technion-IIT, Haifa, 32000, Israel;School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 2
Cited 2

Applications of parametric searching in geometric optimization

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
On a class of O(n2) problems in computational geometry

Computational Geometry: Theory and Applications

Pattern matching for sets of segments

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Towards polynomial lower bounds for dynamic problems

Proceedings of the forty-second ACM symposium on Theory of computing

Quantified Score

Hi-index	0.01

Visualization

Abstract