Computer Graphics

Chapter 3

Geometric algorithms in 2D

3.1     Line from two points

3.2     Classification of a point relative to the line

3.3     Classification of a circle relative to the line

3.4     Classification of an Axis-Aligned Bounding Box (AABB) relative to the line

3.5     Computing the area of triangle and polygon

3.6     Intersection of two lines

3.7     Intersection of two line segments

3.8     Closest point on the line to the given point

3.9     Distance from point to line segment

3.10   Checking whether the given polygon is convex

3.11   Check whether the point lies inside the given polygon

3.12   Clipping line segment to a convex polygon, Cyrus-Beck algorithm

3.13   Clipping a polygon: Sutherland-Hodgman algorithm

3.14   Clipping a polygon ...