scientific article; zbMATH DE number 1786500
From MaRDI portal
Publication:4547792
zbMATH Open0998.68189MaRDI QIDQ4547792FDOQ4547792
Authors: Helmut Alt, Ferran Hurtado 
Publication date: 21 August 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2098/20980067
Title of this publication is not available (Why is that?)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cited In (15)
- Bundling Two Simple Polygons to Minimize Their Convex Hull
- Aligning two convex figures to minimize area or perimeter
- Packing and covering the plane with translates of a convex polygon
- The minimum convex container of two convex polytopes under translations
- A simple method for fitting of bounding rectangle to closed regions
- Optimized packing clusters of objects in a rectangular container
- Packing of convex polytopes into a parallelepiped
- Packing convex polygons in minimum-perimeter convex hulls
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
- MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
- Periodic interlocking problems in \(\mathbb R\times[0,w]\)
- Regular packing of congruent polygons on the rectangular sheet
- Bundling three convex polygons to minimize area or perimeter
- Approximation algorithms for solving packing problems of convex polygons in plane
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547792)
