?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.title=The+Three+Dimensional+Logic+Engine&rft.creator=Kitching%2C+Matthew&rft.creator=Whitesides%2C+Sue&rft.subject=Z.250+Geometry&rft.description=We+consider+the+following+graph+embedding+question%3A+given+a+graph+G%2C+is+it+possible+to+map+its+vertices+to+points+in+3D+such+that+G+is+isomorphic+to+the+mutual+nearest+neighbor+graph+of+the+set+P+of+points+to+which+the+vertices+are+mapped%3F+We+show+that+this+problem+is+NP-hard.+We+do+this+by+extending+the+%22logic+engine%22+method+to+three+dimensions+by+using+building+blocks+inpired+by+the+structure+of+diamond+and+by+constructions+of+A.G.+Bell+and+B.+Fuller.&rft.publisher=Springer&rft.contributor=Pach%2C+J%C3%83%C2%A1nos&rft.date=2004&rft.type=Conference+Paper&rft.type=NonPeerReviewed&rft.identifier=Kitching%2C+Matthew+and+Whitesides%2C+Sue+(2004)+The+Three+Dimensional+Logic+Engine.+[Conference+Paper]&rft.relation=http%3A%2F%2Fgdea.informatik.uni-koeln.de%2F599%2F