Introduction
Imagine we are walking on campus of university and suddenly you want to make an urgent call , suppose consider there are many public phones on campus and of course we want to go to nearest one, but how do we know which one is nearest to us? it would be helpful to have a map and you could see nearest public phone from the campus. but we know map only shows subdivision of the specific region of campus, and shows the for each region indicate nearest public phone. so here problem is what would the region look like and how we could compute them? . so here require some good designed algorithm and the computational geometry algorithm is perfect solution for this type of problems. so what is Computational geometry problem? so The computational geometry problem is one of the branch of computer science which is used study algorithm which can be stated in terms of geometry. Computational geometry is an mathematical field that involve design, analysis and implementation of e...