For a real matrix 𝐀 ∈ℝ𝑑×𝑛 with non-collinear columns, we show that 𝑛 ≤𝑂⁡(𝑑4⁢𝜅𝐀) where 𝜅𝐀 is the circuit imbalance measure of 𝐀. The circuit imbalance measure 𝜅 is a real analogue of Δ-modularity for integer matrices, satisfying 𝜅𝐀 ≤Δ𝐀 for integer 𝐀. The circuit imbalance measure has numerous applications in the context of linear programming (see Ekkbatani, Natura and Végh (2022) for a survey). Our result generalizes the 𝑂⁡(𝑑4⁢Δ𝐀) bound of Averkov and Schymura (2023) for integer matrices and provides the first polynomial bound holding for all parameter ranges on real matrices. To derive our result, similar to the strategy of Geelen, Nelson and Walsh (2021) for Δ-modular matrices, we show that real representable matroids induced by 𝜅-bounded matrices are minor closed and exclude a rank-2 uniform matroid on 𝑂⁡(𝜅) elements as a minor (also known as a line of length 𝑂⁡(𝜅)). As our main technical contribution, we show that any simple rank-𝑑 complex representable matroid which excludes a line of length 𝑙 has at most 𝑂⁡(𝑑4⁢𝑙) elements. This complements the tight bound of (𝑙 −3)⁢(𝑑2) +𝑑 for 𝑙 ≥4, of Geelen, Nelson and Walsh, which holds when the rank 𝑑 is sufficiently large compared to 𝑙 (at least doubly exponential in 𝑙). Our proof of the above relies on an improvement of a Sylvester-Gallai type theorem of Dvir, Saraf and Wigderson (2014). Refining their design matrix technique, we show that for any full dimensional set of 𝑛 points in ℂ𝑑 there always exists a point that lies on at least (1 −4/𝑑)⁢𝑛 many distinct lines (the constant 4 is improved from 12). The excluded minor bound follows by inductively applying this result to find good elements to contract in the matroid, where the improved constant reduces the dependence on 𝑑 from 𝑑12 to 𝑑4. Interestingly, by relying on geometric techniques, our proof avoids the use of any difficult matroid machinery.