The 3-D Karnaugh map
Michael J. Reale · Journal of computing sciences in colleges · 2005
As a graphical aid in reducing Boolean canonical expressions, K-maps are very useful. However, a two-dimensional Karnaugh map can fit at most 4 variables. This project explores an implementation of a 3D Karnaugh map. Programmed entirely in JAVA, it utilizes an advanced GUI that allows the user to input binary information (either directly or by opening an appropriate file), to convert it to DNF (SOP) or CNF (POS), and to construct an appropriate 3D Karnaugh map for it. The implementation involved development of a simple 3D graphics engine that can display multi-colored with some shading. These cubes represent the data values using color codes. We automatically reduce the map and display the reduction. Other GUI enhancements allow the user to select bricks, make bricks disappear and reappear (to facilitate selection of obscured bricks), and rotate the display, as well as toggle bricks on and off in modification mode. The user also has the option to manually reduce the K-map in reduction mode.