The Three Dimensional Logic Engine
We consider the following graph embedding question: given a graph G, 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? We show that this problem is NP-hard. We do this by extending the “logic engine” method to three dimensions by using building blocks inpired by the structure of diamond and by constructions of A.G. Bell and B. Fuller.
- 1.Bell, A.G.: Tetrahedral principle in kite structure. National Geographic Magazine 14(6), 219–251 (1903)Google Scholar
- 2.Buckminster Fuller, R.: Inventions, the Patented Works of R. Buckminster Fuller. St. Martin’s Press (1983)Google Scholar
- 5.Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing, ch. 11.2. Prentice Hall, Englewood Cliffs (1999)Google Scholar
- 7.Dillencourt, M.B., Smith, W.D.: Graph-theoretical conditions for inscribability and Delaunay realizability. In: Proc. 6th Canad. Conf. Comput. Geom., pp. 287–292 (1994)Google Scholar
- 13.Liotta, G., Di Battista, G.: Computing proximity drawings of trees in the 3-dimensional space. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol. 955, pp. 239–250. Springer, Heidelberg (1995)Google Scholar
- 16.Toussaint, G.: A graph-theoretical primal sketch. In: Computational Morphology, pp. 229–260. North-Holland, Amsterdam (1988)Google Scholar