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.The main impetus for the development of computational geometry as a discipline was progress in
computer graphics, computer-aided design and manufacturing (
CAD/
CAM), but many problems in computational geometry are classical in nature.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) (programming of numerically controlled (NC) machines).
See more at Wikipedia.org...
<
mathematics> The study of
algorithms for combinatorial, topological, and metric problems concerning sets of points, typically in
Euclidean space. Representative areas of research include geometric search, convexity, proximity, intersection, and
linear programming.
(1997-08-03)
Free Download Now!
