This chapter describes and implements a wide range of algorithms for computing intersections and unions of various geometric objects, including: intersection among $n$ segments, between a segment and a triangle, a segment and a rectangle, a segment and a convex polygon, a rectangle and a concave polygon, between convex polygons, half-planes, and unions of rectangles.