Two problems in discrete and computational geometry are considered that are related to questions about the combinatorial complexity of arrangements of visibility domains and about the hardness of path planning under cost ...