I am a Computer Science Undergrad student with an interest towards Algebraic Geometry.I have just recently started and am currently reading Miles Reids' Undergraduate Algebraic Geometry(I have read Reid's Undergraduate Commutative Algebra).
Apart from "just reading" up some texts, I want to do a specific project related to both computer science and algebraic geometry.
By project , I mean something like a specific problem related to CS which can be solved by algebraic geometric methods or a programming exercise (an example would be a Sudoku-Solver using Grobner Basis). I am not very interested in implementing a particular algorithm (say, Buchberger's Algorithm) and would rather build an application which uses it.
I have seen a few ideas in the appendix to David Cox's Ideals,Varieties and Algorithms but I am not very satisfied.
Any ideas would be extremely helpful.