Finding large sticks and potatoes in polygons
From MaRDI portal
Publication:3581499
DOI10.1145/1109557.1109610zbMath1192.68746OpenAlexW4236250687MaRDI QIDQ3581499
Joseph S. B. Mitchell, Arik Sityon, O. Hall-Holt, Piyush Kumar, Matthew J. Katz
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109610
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Polyhedral manifolds (52B70)
Related Items (13)
Isometric and affine copies of a set in volumetric Helly results ⋮ Maximum-area and maximum-perimeter rectangles in polygons ⋮ Finding a largest-area triangle in a terrain in near-linear time ⋮ An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ Peeling Potatoes Near-Optimally in Near-Linear Time ⋮ Largest area parallelogram inside a digital object in a triangular grid ⋮ Large \(k\)-gons in a 1.5D terrain ⋮ Finding largest rectangles in convex polygons ⋮ Largest inscribed rectangles in convex polygons ⋮ Largest triangle inside a terrain ⋮ Largest triangles in a polygon ⋮ Peeling meshed potatoes ⋮ Efficient Algorithm for Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon
Uses Software
This page was built for publication: Finding large sticks and potatoes in polygons
