Bundling Three Convex Polygons to Minimize Area or Perimeter
From MaRDI portal
Publication:2842137
DOI10.1007/978-3-642-40104-6_2zbMath1390.68702OpenAlexW1776243110MaRDI QIDQ2842137
Sang Won Bae, Hee-Kap Ahn, Helmut Alt, Dong Woo Park
Publication date: 12 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40104-6_2
Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (2)
The minimum convex container of two convex polytopes under translations ⋮ Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons
This page was built for publication: Bundling Three Convex Polygons to Minimize Area or Perimeter
