benchmarks.wiki / Public workspace
Omni-MATH / ( Gregory Galparin ) Let P be a convex polygon with n sides, n≥3 . Any set of n−3 diagonals of P that do not intersect in the interior of the polygon determine a triangulation of P… · Discussion
Discussing ( Gregory Galparin ) Let P be a convex polygon with n sides, n≥3 . Any set of n−3 diagonals of P that do not intersect in the interior of the polygon determine a triangulation of P… · Omni-MATH
Posts
Chronological order within this page.
State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.