Computer Science – Computational Geometry
Scientific paper
2010-08-06
Computer Science
Computational Geometry
17 pages, 13 figures. An abstract was presented at the 5th International Conference on Origami in Science, Mathematics and Edu
Scientific paper
We show that deciding whether a given set of circles can be packed into a rectangle, an equilateral triangle, or a unit square are NP-hard problems, settling the complexity of these natural packing problems. On the positive side, we show that any set of circles of total area 1 can be packed into a square of size 4/\sqrt{pi}=2.2567... These results are motivated by problems arising in the context of origami design.
Demaine Erik D.
Fekete Sandor P.
Lang Robert J.
No associations
LandOfFree
Circle Packing for Origami Design Is Hard does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Circle Packing for Origami Design Is Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Circle Packing for Origami Design Is Hard will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-231231