We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations for these varieties, up to radical, and describing the irreducible components of the corresponding circuit varieties. We generalize the notion of cactus graphs to matroids, introducing a family of point-line configurations whose underlying graphs are cacti. Our analysis includes several classical matroids, such as the Pascal, Pappus, and cactus matroids, for which we provide explicit finite generating sets for their associated matroid ideals. The matroid ideal is the ideal of the matroid variety, whose construction involves a saturation step with respect to all the independence relations of the matroid. This step is computationally very expensive and has only been carried out for very small matroids. We provide a complete generating set of these ideals for the Pascal, Pappus, and cactus matroids. The proofs rely on classical geometric techniques, including liftability arguments and the Grassmann--Cayley algebra, which we use to construct so-called bracket polynomials in these ideals. In addition, we prove that every cactus matroid is realizable and that its matroid variety is irreducible.