Other important applications of computational geometry include robotics (motion planning and visibility problems), geographic information systems (GIS) (geometrical location and search, route planning), integrated circuit design (IC geometry design and verification), computer-aided engineering (CAE) (mesh generation), and computer vision (3D reconstruction).
A classic result in computational geometry was the formulation of an algorithm that takes O(n log n).
The core problems in computational geometry may be classified in different ways, according to various criteria.
The search space typically needs to be preprocessed, in a way that multiple queries can be answered efficiently.
Yet another major class is the dynamic problems, in which the goal is to find an efficient algorithm for finding a solution repeatedly after each incremental modification of the input data (addition or deletion input geometric elements).
Any of the computational geometric problems may be converted into a dynamic one, at the cost of increased processing time.
For example, in many applications of computer graphics a common problem is to find which area on the screen is clicked by a pointer.
Application areas of computational geometry include shipbuilding, aircraft, and automotive industries.