Traditional snakes, or active contours, are planar parametric curves. Their parameters are determined by optimizing the weighted sum of three energy terms: one depending on the data (typically on the integral of its gradient under the curve, or on its integral over the area enclosed by the curve), one monitoring the shape of the curve (typically promoting its smoothness, or regularizing ambiguous solutions), and one incorporating prior knowledge (typically favoring a given shape). We present in this paper a snake that we designed to be as simple as possible without losing too many of the characteristics of more complicated, fuller versions. It retains an area data term and requires regularization to avoid an ill-posed optimization problem. It is parameterized by just two points, thus further easing requirements on the optimizer. Despite its extreme simplicity, this active contour can efficiently solve a variety of problems such as cell counting and segmentation of approximately circula...