Big little hexagon
Read OriginalThis article explores the mathematical problem of finding the n-gon with diameter 1 and maximum area. For odd n, the regular polygon is optimal, but for even n, Graham's hexagon (n=6) provides a larger area. The post provides vertex coordinates and compares areas, showing Graham's hexagon is about 3.9% larger than a regular hexagon. It references Ron Graham's 1975 paper and is relevant to computational geometry and optimization.
Comments
No comments yet
Be the first to share your thoughts!
Browser Extension
Get instant access to AllDevBlogs from your browser
Top of the Week
1
Limit token usage in Microsoft Agent Framework
Jesse Liberty
•
1 votes
2
How to Roll Back AI Agents: Incident Response, Circuit Breakers, and Recovery Patterns
Paul Bryant
•
1 votes
3
Avoiding Reasoning Model Failures with Microsoft Foundry
Luke Murray
•
1 votes
4
When Your AI Agent Lies: Silent LLM Fallbacks
Luke Murray
•
1 votes
5
Adding a custom MCP server to Claude and ChatGPT
Simon Willison
•
1 votes
6
Testing AI prompts and comparing models with promptfoo
Tim Deschryver
•
1 votes
7
Superlogical
Mitchell Hashimoto
•
1 votes