This column is devoted to non-crossing configurations in the plane realized with straight line segments connecting pairs of points from a finite ground set. Graph classes of interest realized in this way include matchings, spanning trees, spanning cycles, and triangulations. We review some problems and results in this area. At the end we list some open problems.