We present a general technique, based on parametric search with some twist, for solving a variety of optimization problems on a set of points in the plane or in higher dimensions. These problems include (i) the reverse shortest path problem in unit-disk graphs, recently studied by Wang and Zhao, (ii) the same problem for weighted unit-disk graphs, with a decision procedure recently provided by Wang and Xue, (iii) extensions of these problems to three and higher dimensions, (iv) the discrete Fr\'echet distance with one-sided shortcuts in higher dimensions, extending the study by Ben Avraham et al., and (v) the maximum-height independent towers problem, in which we want to erect vertical towers of maximum height over a 1.5-dimensional terrain so that no pair of tower tips are mutually visible. We obtain significantly improved solutions for problems (i) and (ii), and new efficient solutions to problems (iii), (iv) and (v), which do not appear to have been studied earlier.

翻译：我们提出了一种一般性技术,其依据是经过一些曲折的对称搜索,以解决飞机上各点或更高层面的各种优化问题,这些问题包括:(一) 王和赵最近研究的单位磁盘图中反向最短路径问题,(二) 加权单位磁盘图问题,与王和薛最近提供的决定程序相同,(三) 将这些问题扩大到三个以上层面,(四) 离散的Fr\'echet距离与更高层面的单向捷径,扩展了Ben Avraham等人的研究,(五) 最大高度的独立塔的问题,我们希望在1.5米的地形上竖起最高高度的垂直塔,这样一对塔尖就不会相互可见,我们大大改进了问题(一)和(二)的解决方案,以及问题(三)、(四)和(五)的新的有效解决办法,这些问题似乎早先没有研究过。