Tag Archives: computational geometry

Paper and Puzzle a Day 7

I’ve been reading up more about hinged dissections and came across a shorter paper than the one I mentioned in my previous post. This paper proves that hinged dissections are PSPACE-hard using a reduction from NCL with some neat gadgets. … Continue reading

Posted in Paper and Puzzle | Tagged , , , | Leave a comment