Potato peeling
Jump to navigation
Jump to search
Script error: No such module "about". In computational geometry, the potato peeling or convex skull problem is a problem of finding the convex polygon of the largest possible area that lies within a given non-convex simple polygon. It was posed independently by Goodman and Woo,[1]Template:R/superscript[2]Template:R/superscript and solved in polynomial time by Chang and Yap.[3]Template:R/superscript The exponent of the polynomial time bound is high, but the same problem can also be accurately approximated in near-linear time.[4]Template:R/superscript[5]Template:R/superscript
References
<templatestyles src="Reflist/styles.css" />
Script error: No such module "Check for unknown parameters".