Starting from the definition of the different classes of geometric graphs, this talk will survey some recent results results and present some open problems on random proximity graphs, random geometric graphs. We also discuss the complexity of some problems in the unit disc graphs, the deterministic counterpart of random geometric graphs.