  Weak unit disk contact graphs are graphs that admit a representation of the
nodes as a collection of internally disjoint unit disks whose boundaries touch
if there is an edge between the corresponding nodes. We provide a gadget-based
reduction to show that recognizing embedded caterpillars that admit a weak unit
disk contact representation is NP-hard.
