Polygon containment under translation
From MaRDI portal
Publication:3756895
Recommendations
Cited in
(16)- Knowledge based approach to the cutting stock problem
- Containment of a single polygon using mathematical programming
- Fuzzy distances for proximity characterization under uncertainty
- Rotational polygon containment and minimum enclosure using only robust 2D constructions
- Multiple translational containment. I: An approximate algorithm
- A new algorithm for the two-polygon containment problem
- The polygonal containment model
- Computing the intersection-depth to polyhedra
- Placing Text Boxes on Graphs
- scientific article; zbMATH DE number 3911704 (Why is no real title available?)
- Modeling of packing problems
- scientific article; zbMATH DE number 30304 (Why is no real title available?)
- SIMULTANEOUS CONTAINMENT OF SEVERAL POLYGONS: ANALYSIS OF THE CONTACT CONFIGURATIONS
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- Algorithms for deciding the containment of polygons
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)