This lecture introduces computational geometry and basic algorithms for finding line segments.

Computational geometry has applications in many areas: robotics, forestry, medical imaging, metallurgy, VLSI design, textile layout, manufacturing, computer graphics, robotics, computer-aided design, molecular modeling and many other modern science areas which one needs to deal with geometric objects and geometric problems.

Typical inputs to such algorithms are geometric objects like set of points, set of line segments, and out is generally some query about geometric objects for example do line segments represented by such and such points intersect.

5,021 total views, 2 views today