Efficient Packing Algorithm for Regular Polygons
I'm looking for a packing algorithm which will reduce a regular polygon into rectangles and right triangles. The algorithm should attempt to use as few such shapes as possible and should be relatively easy to implement (given the difficulty of the challenge).
If possible, the answer to this question should explain the general heuristics used in the suggested algorithm.
Solution
I think the answer is fairly simple for regular polygons.
Find an axis of symmetry, and draw a line between each vertex and its mirror. This divides the polygon into trapezoids. Each trapezoid can be turned into a rectangle and two right triangles.
- How to form the biggest number from an array of numbers
- How to determine if all pairs in an array have the same GCD optimally?
- What's a good algorithm for calculating the area of a quadrilateral?
- How to optimize a CustomPainter drawing application in Flutter?
- How to Mark Repeated Entries as True Starting from the Second Occurrence Using NumPy?
- What algorithm can I use to determine points within a semi-circle?
- How to check if a number is a power of 2
- How to efficiently perform dynamic programming with complex state dependencies in Python?
- JavaScript Math.random Normal distribution (Gaussian bell curve)?
- PRAM if-then-else CREW/EREW
- Is there a more elegant way to solve this anti-palindrome problem?
- Forward chaining and Backward chaining in java
- Tron lightcycles AI in Prolog
- how to find shortest path between multiple clusters
- About reducing the branch misprediction
- How can I check all the prime numbers in a for loop?
- Calculating the Amount of Combinations
- What if the nth iterator is not within the range [first, last) when use std::nth_element
- LeetCode 231: Problem in finding whether a given number is Power of 2
- Determining if a number is prime
- Parsing DeepDiff result
- I need the algorithm for suggesting other similar usernames
- Translating C programming into pseudocode
- Is there an algorithm for color mixing that works like mixing real colors?
- Can someone explain Hoare's partitioning scheme to me?
- Run Time Anaysis of Nested Loop
- Can deleting a single node in an AVL tree ever require two double rotations?
- Questions about William's Heapsort
- Why does this C++ code give different output on different compilers?
- Finding two minimum values out of four?