scientific article; zbMATH DE number 1786500
From MaRDI portal
Publication:4547792
zbMath0998.68189MaRDI QIDQ4547792
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980067
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (8)
The minimum convex container of two convex polytopes under translations ⋮ Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons ⋮ A simple method for fitting of bounding rectangle to closed regions ⋮ Bundling three convex polygons to minimize area or perimeter ⋮ Aligning two convex figures to minimize area or perimeter ⋮ Bundling Two Simple Polygons to Minimize Their Convex Hull ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Optimized packing clusters of objects in a rectangular container
This page was built for publication:
