  We study a family of variants of Erd\H os' unit distance problem, concerning
distances and dot products between pairs of points chosen from a large finite
point set. Specifically, given a large finite set of $n$ points $E$, we look
for bounds on how many subsets of $k$ points satisfy a set of relationships
between point pairs based on distances or dot products. We survey some of the
recent work in the area and present several new, more general families of
bounds.
