Polygon containment under translation
From MaRDI portal
Publication:3756895
DOI10.1016/0196-6774(86)90017-9zbMath0621.51021OpenAlexW1973769099MaRDI QIDQ3756895
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
complexityalgorithmconvex hulltranslationcomputational geometrypolygon containmentintersecting geometric figuresrectilinearly convex
Analysis of algorithms and problem complexity (68Q25) Polyhedra and polytopes; regular figures, division of spaces (51M20) Polytopes and polyhedra (52Bxx)
Related Items (8)
Computing the intersection-depth to polyhedra ⋮ A new algorithm for the two-polygon containment problem ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Algorithms for deciding the containment of polygons ⋮ Knowledge based approach to the cutting stock problem ⋮ Modeling of packing problems ⋮ Placing Text Boxes on Graphs ⋮ Fuzzy distances for proximity characterization under uncertainty
This page was built for publication: Polygon containment under translation
