Circle Packing for Origami Design Is Hard

Computer Science – Computational Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-231231

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.