Before revision:  We show that deciding whether there exists an embedding of unit disk graphs  is NP-hard, even if the given straight lines are parallel to either x-axis or y-axis.
After revision:  We show that deciding whether there exists an embedding of unit disk graphs on straight lines is NP-hard, even if the given straight lines are parallel to either x-axis or y-axis.