scientific article; zbMATH DE number 1305490

MaRDI QIDQ4252379zbMATH OpenFDO

Authors Gill Barequet, Sariel Har-Peled

Publication date 17 June 1999

zbMATH Keywords

3SUM problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
• On the hardness of computing intersection, union and Minkowski sum of polytopes
• scientific article; zbMATH DE number 1445288
• The complexity of computing minimum separating polygons
• Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
• Maintaining the minimal distance of a point set in polylogarithmic time
• On the minimality of polygon triangulation
• A tight bound for the complexity of Voroni diagrams under polyhedral convex distance functions in 3D
• Minimization of the Hausdorff distance between convex polyhedrons
• scientific article; zbMATH DE number 30304

Cited in

(4)

• On a class of \(O(n^ 2)\) problems in computational geometry
• On a class of O(n^2) problems in computational geometry
• POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
• Improved space-time tradeoffs for \(k\)SUM

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252379)