We propose a geometric framework to describe and analyze a wide array of operator splitting methods for solving monotone inclusion problems. This framework is shown to encompass traditional methods as well as state-of-the-art asynchronous block-iterative algorithms, and its flexible structure provides a pattern to design new ones.