In this dissertation we discuss a variety of geometric constraint satisfaction problems. The greatest part of the discussion is devoted to infinite packing problems, where the packing arrangement of an infinite number of congruent copies of an object with the greatest density is sought. We develop a general method, based on the Divide and Concur scheme, for discovering dense periodic packings of any convex object. We use this method to improve on the previous greatest known packing density of regular tetrahedra. We then generalize the discussion of regular tetrahedra to a one-parameter family of shapes interpolating between the regular tetrahedron and the sphere. We investigate how the likely optimal packing changes as the shape is changed ...