我面临的问题如下:
Given two polygons defining the borders of a maze and a path in between (see picture below), I would like to know when I crossed the borders of the maze.
In respect to the inputs I have:
- One file defining edges of the two polygons (only the points that connect straight lines)
- One file with all waypoints I had visited, in the order of appearance
我需要根据限制区所花时间计算这条道路的分数。
www.un.org/spanish/ecosoc 这样做的最佳方式是什么? (Algorithm/Technology/Library) 我没有任何技术限制,因此解决办法可以是 Java、C、Perl(这是我所喜欢的)等。
我开始寻求解决办法,但后来我认识到,这个问题过去必须解决数百万次,没有理由“重新发明轮船”:
我是地理/族裔问题的新鲜事,我非常赞赏对我应采取什么做法的任何建议。
卡车
