A independent thrust for the development of computational geometry as a discipline was progress within computer graphics, computer-aided design & manufacturing (CAD/CAM), but several problems around computational geometry come authoritative inside nature and severity.

More significant "customers" of computational geometry include robotics (motion planning and visibility problems), geographic information systems (GIS) (geometrical location & seek, route planning), integrated circuit design (IC geometry design & verification), computer-aided engineering (CAE) (programming of numerically controlled (NC) machines).

There are 2 independent flavors of computational geometry:

Combinatorial computational geometry, besides known as algorithmic geometry, which deals sustaining geometrical objects when discrete entities.

Numerical geometry, likewise known as machine geometry, computer-aided geometric project (CAGD), or even geometrical modeling which deals primarily by having representation of real-globe objects around form suitable for computer computations inside CAD /CAM systems. This flavor can be seen as a farther development of descriptive geometry.

Typically, a latter sort of computational geometry is considered to exist as branch of computer graphics and/or CAD, and a previous 1 is known as only computational geometry.

Combinatorial computational geometry

A primary goal of the food and drug administration around combinatorial computational geometry is to respond with effective algorithms and data structures for solving problems stated within terms of basic geometric objects: points, line segments, polygons, polyhedra, etc.

A select few one problems look then elementary that it were non look on problems in a least until the advent of computers. Assume, e.g., a Nighest pair condition:

Given North points in a plane, call for ii sustaining the little few feet away from either both more.

Whenever 1 computes a distances between 100% pairs of points, there are '''North(North − Single)/2' of a two; the single so picks a pair by having the little few feet away. This brute force algorithm has time complexness 'O(North^Two), i personally.e., its execution period is proportional to the square of the total of points. 1 milestone inside computational geometry was a formulation of an algorithmic rule for the closest-pair condition using instance complexness O(North log North).

For modern GIS, computer graphics, & integrated circuit project systems habitually treating tens & hundreds of million points, the difference between North^Two & North log North' is the difference between times & seconds of computation. Hence a emphasis in computational complexity in computational geometry.

Problems
independent article: List of combinatorial computational geometry topics. Core algorithms and problems

Problems from either this names use wide applications within areas processing of geometrical references is utilized.

Boolean operations in polygons and polytopes Binary space partitions Closest pair of points Convex hull Delaunay triangulation Line segment intersection Linear programming Minimal convex decomposition Orthogonal range searching Polygon triangulation Point location Point in polygon Ray casting (as well referred to as ray tracing) Voronoi diagram

Given deuce sets of points The & B, locate a orthogonal matrix U which may minimize a few feet away between UA & B''. Inside evidently English, i're concerned around seeing whenever The & B come elementary rotations of of these an additional. Given the listing of points, line segments, triangles, spheres or even more bulging objects, determine whether there is a separating plane, & whenever then, compute it.

Numerical geometry

This branch is also referred to as geometric modelling, computer-aided geometric design (CAGD), & can be typically discovered under a keyword curves & shells.

Core problems come curve & surface modelling & representation.

A first instruments on this button come parametric curves and parametric surfaces, such as Bezier curves, spline curves and shells. An crucial non-parametric approach is the level set method.

1st (& however first) application areas come shipbuilding, aircraft, & self-propelling industries. Still because of modern ubiquitousness & power of computers potentially perfume bottles & shampoo dispensers come designed applying techniques unheard of by shipbuilders of Sixties.