Consider a 2D coordinate space with a set of red and a set of blue points. We define a scenic point as a point that is equidistant to a red point and a blue point. The set of contiguous scenic points form a scenic path. The perpendicular bisectors to the line joining a red point and a blue point forms a scenic path between the red point and the blue point. A scenic route is a traversal made from scenic paths. In this paper, we address this novel problem by (i) designing algorithms for scenic route generation, (ii) studying the algorithms different properties and (iii) analyzing the routes generated by these algorithms. Scenic routes have applications in geo-spatial visualizations and visual analytics.

翻译：考虑二维坐标空间中的一组红点和一组蓝点。我们定义风景点为与红点和蓝点等距的点。连续的风景点集合构成风景路径。连接红点与蓝点的线段的垂直平分线形成了这两点之间的风景路径。风景路线是由多条风景路径组成的遍历路径。本文通过以下方法解决这一新问题：(i) 设计生成风景路线的算法，(ii) 研究这些算法的不同性质，以及 (iii) 分析由这些算法生成的路线。风景路线在空间可视化与可视化分析中具有应用价值。