Polygon containment under translation

DOI10.1016/0196-6774(86)90017-9MaRDI QIDQ3756895zbMATH OpenOpenAlexFDO

Authors Brenda S. Baker, S. J. Fortune, Stephen R. Mahaney

Publication date 1986

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(86)90017-9

zbMATH Keywords

algorithmcomplexitycomputational geometryconvex hulltranslationpolygon containmentintersecting geometric figuresrectilinearly convex

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• scientific article; zbMATH DE number 3911704
• scientific article; zbMATH DE number 30304
• Containment of a single polygon using mathematical programming
• Algorithms for deciding the containment of polygons
• The polygonal containment model

Cited in

(13)

• The polygonal containment model
• A new algorithm for the two-polygon containment problem
• Knowledge based approach to the cutting stock problem
• Placing Text Boxes on Graphs
• Fuzzy distances for proximity characterization under uncertainty
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
• Multiple translational containment. I: An approximate algorithm
• Algorithms for deciding the containment of polygons
• POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
• scientific article; zbMATH DE number 3911704 (Why is no real title available?)
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Modeling of packing problems
• Computing the intersection-depth to polyhedra

This page was built for publication: Polygon containment under translation

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