Aligning two convex figures to minimize area or perimeter

DOI10.1007/s00453-010-9466-1zbMath1311.68161MaRDI QIDQ2428667

Hee-Kap Ahn, Otfried Schwarzkopf

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-010-9466-1

zbMATH Keywords

area; optimization; convex hull; computational geometry; perimeter

Mathematics Subject Classification ID

52B55: Computational aspects related to convexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

52A38: Length, area, volume and convex sets (aspects of convex geometry)

52A10: Convex sets in (2) dimensions (including convex curves)

Related Items

A Dynamical Systems Approach for the Shape Matching of Polytopes Along Rigid-Body Motions, The frechet distance revisited and extended, Universal convex covering problems under translations and discrete rotations, A generalization of the convex Kakeya problem, Scandinavian thins on top of cake: new and improved algorithms for stacking and packing, Bundling three convex polygons to minimize area or perimeter, The minimum convex container of two convex polytopes under translations, Packing circles into perimeter-minimizing convex hulls, Packing convex polygons in minimum-perimeter convex hulls, Bundling Two Simple Polygons to Minimize Their Convex Hull, Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing the overlap of two planar convex sets under rigid motions
• Translational packing of arbitrary polytopes
• Rotational polygon overlap minimization and compaction
• Computing the maximum overlap of two convex polygons under translations
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Matching convex shapes with respect to the symmetric difference
• Disk packing for the estimation of the size of a wire bundle
• Metric entropy of some classes of sets with differentiable boundaries
• Maximum overlap and minimum convex hull of two convex polyhedra under translations
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Approximating extent measures of points
• MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS