We present an explicit geometric construction of a large parametrized family of graphs with no $k$-cliques and with bounded independence number, generalizing the triangle-free Ramsey graphs of Codenotti, Pudlák, and Resta and revisiting the previous generalization by Kostochka, Pudlák and Rödl. Within this framework, we provide a new combinatorial proof of the upper bound on the independence number for their constructions, offering additional insight into the structure of its independent sets. For our generalized family, we establish lower bounds on the independence number and identify necessary constraints on the parameters under which these graphs could yield improved constructive asymptotic lower bounds on $R(s,t)$, with particular emphasis on $R(3,t)$. As a byproduct, we provide a linear-time approximation algorithm for finding the largest independent set within this parametrized family. For a substantial subfamily, this algorithm achieves a $\frac{1}{2}$-approximation ratio. Special attention is given to the case of triangle-free graphs: we describe explicit constructions on $n$ vertices with independence number $O(n^{\frac{2}{3}})$, giving a constructive asymptotic lower bound of $Ω(t^{\frac{3}{2}})$ for the Ramsey numbers $R(3,t)$, matching the best known constructive bound.