Combinatorics is rich with objects counted by the Catalan numbers. One such set of objects is the set of noncrossing partitions of the numbers 1 through n. There is a natural generalization in which one considers the set of noncrossing partitions of kn with block sizes each divisible by k. In this talk, we'll consider a rational generalization of noncrossing partitions and discuss current research in this subject.