In computer science, Computational
Geometry is the study of algorithms to solve problems stated in
terms of geometry. Some purely geometrical problems arise out of the study
of computational geometric algorithms, and the study of such problems is
also considered to be part of computational geometry.
There are two main flavors
of computational geometry:
Combinatorial computational geometry, also called
algorithmic geometry, which deals with geometric objects as discrete entities.
Numerical geometry, also called machine geometry,
computer-aided geometric design (CAGD), or geometric modeling which deals
primarily with representation of real-world objects in form suitable for
computer computations in CAD /CAM systems.
Wikipedia, the free encyclopedia