Largest placement of one convex polygon inside another

DOI10.1007/PL00009337zbMath0892.68101OpenAlexW1980951111MaRDI QIDQ1380791

Micha Sharir, Nina Amenta, Pankaj K. Agarwal

Publication date: 11 March 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009337

zbMATH Keywords

convex polygon

Mathematics Subject Classification ID

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

Related Items (11)

Isometric and affine copies of a set in volumetric Helly results ⋮ An algorithmic approach to Rupert’s problem ⋮ Smallest universal covers for families of triangles ⋮ Maximum-area and maximum-perimeter rectangles in polygons ⋮ The reverse Kakeya problem ⋮ Optimizing for the Rupert Property ⋮ Largest triangles in a polygon ⋮ Rotational polygon overlap minimization and compaction ⋮ Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently ⋮ Computing Maximal Copies of Polyhedra Contained in a Polyhedron ⋮ The Reverse Kakeya Problem

This page was built for publication: Largest placement of one convex polygon inside another