A t-embedding assigns a certain geometric structure to a finite weighted planar bipartite graph, and its associated origami map is the result of folding along the edges of a t-embedding. After introducing the necessary background on Kasteleyn matrices, we will define the t-embedding and discuss strategies to construct it for a given bipartite graph. We will then give examples of origami maps and briefly discuss the motivation for why we study them.