To bound the number of planar embeddings a minimally rigid
graph can have, Borcea and Streinu have used intersections of curves
generated by simple mechanisms. The gap between the 4^n upper and 2.88^n
lower bounds is still quite wide, and we seek techniques for narrowing it.
The mechanism-generated curve technique should in theory yield better
bounds, if one could find better curves to iterate on. We look at a family
of high degree curves described by Wunderlich and describe our computer
experiments with them in search of many intersections.