Welcome to the igraph community @Gulshan_Kumar.
This is indeed a good start. Please see point 1 in what I wrote in another thread:
To clarify, the primary goal would be to implement the computation of the proximity graphs, which is already done in IGraph/M. Please see here: IGraph/M Documentation These rely on Delaunay triangulations and nearest neighbour search algorithms (such as k-D trees), but ideally we won’t implement these from scratch. Instead, we should try to find existing libraries that are not too heavyweight and whose licenses are reasonably compatible with igraph. If we are forced to use a library with a divergent license, this may need to be an optional (togglable) feature.
Do you have access to and some experience with Mathematica / the Wolfram Language? This is not strictly required, but would make it easier to read the existing implementation.