Before revision:  We prove that when paths must be drawn as straight line segments, it is NP-complete to determine if a crossing-free solution exists  .
After revision:  We prove that when paths must be drawn as straight line segments, it is NP-complete to determine if a crossing-free solution exists , even if all vertical segments have unit length .