Pages that link to "Item:Q1151600"

The following pages link to On the largest convex polygon contained in a non-convex n-gon, or how to peel a potato (Q1151600):

Displayed 12 items.

• On the Beer index of convexity and its variants (Q512263) ‎ (← links)
• Peeling meshed potatoes (Q534778) ‎ (← links)
• Maximum-area and maximum-perimeter rectangles in polygons (Q827336) ‎ (← links)
• Finding a largest-area triangle in a terrain in near-linear time (Q832865) ‎ (← links)
• A polynomial solution for the Potato-peeling problem (Q1076347) ‎ (← links)
• Lattice-theoretical fixpont theorems in morphological image filtering (Q1343389) ‎ (← links)
• The convexification effect of Minkowski summation (Q1755914) ‎ (← links)
• Largest triangle inside a terrain (Q2222094) ‎ (← links)
• An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) ‎ (← links)
• Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) ‎ (← links)
• Convex Polygons in Geometric Triangulations (Q5366966) ‎ (← links)
• Large \(k\)-gons in a 1.5D terrain (Q6168930) ‎ (← links)