Polygon containment under translation
DOI10.1016/0196-6774(86)90017-9zbMATH Open0621.51021OpenAlexW1973769099MaRDI QIDQ3756895FDOQ3756895
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
Recommendations
algorithmcomplexitycomputational geometryconvex hulltranslationpolygon containmentintersecting geometric figuresrectilinearly convex
Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Cited In (13)
- The polygonal containment model
- A new algorithm for the two-polygon containment problem
- Modeling of packing problems
- Title not available (Why is that?)
- Fuzzy distances for proximity characterization under uncertainty
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Computing the intersection-depth to polyhedra
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Knowledge based approach to the cutting stock problem
- Multiple translational containment. I: An approximate algorithm
- Algorithms for deciding the containment of polygons
- Placing Text Boxes on Graphs
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)