**What is Computational Geometry?**

Computational geometry is a branch of computer science that studies algorithms that can be expressed in other forms of geometry. Historically, it is considered to be one of the oldest fields in computer engineering, although modern computer geometry is a more recent development. The main reason behind the development of computational geometry is due to advances in computer graphics, as well as computer aided design and manufacture. However, some problems are more of a classic nature and originate from mathematical visualization. Applications of computer geometry can be found in robotics, the design of integrated circuits, Computer vision (3D reconstruction), computer-aided engineering and geographic information systems (GIS)

Computational Geometry is broadly divided into two main areas: combinatorial computational geometry and numerical computational geometry. The first treats geometric objects as discrete entities. For example, it can be used to find the smallest polyhedron or polygon that contains all of the given points, which is a convex hull problem.

Another example is the nearest neighbor problem, where it is necessary to find the closest point to an interrogation point from a set of points. The second numerical calculation geometry is intended to represent real objects in a way that is suitable for calculations in CAD or CAM systems. Important sections are parametric surfaces and curves such as spline curves and Bezier curves.