The minimum distance between two convex polygons---两个凸包之间的最短距离---旋转卡壳法
来源:互联网 发布:国际专线网络 编辑:程序博客网 时间:2024/04/29 08:38
声明:本文章转自http://cgm.cs.mcgill.ca/~orm/mind2p.html
译文详见:http://blog.csdn.net/acmaker/article/details/3178696
The minimum distance between two convex polygons
Given two disjoint (i.e. non-intersecting) convex polygons P and Q, the goal is to find the pair(s) of points (p,q) (p belonging toP andq toQ) minimizing the distance between them.
The fact that the polygons are disjoint is important, since it is assumed the polygon contains its interior. If the polygons intersect, then the minimum distance is meaningless. However, another version of this problem, the minimum vertex distance between convex polygons has solutions in intersecting and non-intersecting cases.
Back to the main problem: intuitively, the points determining the minimum distance will not belong to the interior of their respective polygons. Similar to the maximum distance problem, we have the following result:
The minimum distance between two convex polygons P and Q is determined byanti-podal pair between the polygons. As there are three cases foranti-podal pairs between convex polygons, three cases for the minimum distance can occur:
- The vertex-vertex case
- The vertex-edge case
- The edge-edge case
In other words, the points determining the minimum distance are not necessarily vertices. The following three examples illustrate the above result:
Given this result, an algorithm based on the Rotating Calipers naturally comes to mind:
Consider the following algorithm, where the input is assumed to be two convex polygonsP andQ withm and n vertices respectively given in clockwise order.
- Compute the vertex with minimum y coordinate for P (call ityminP) and the vertex with maximumy coordinate forQ (call itymaxQ).
- Construct two lines of support LP and LQ for the polygons atyminP andymaxQ such that the polygons lie to the right of their respective lines of support. ThenLP andLQ have opposite direction, andyminP and ymaxQ form an anti-podal pair between the polygons.
- Compute dist(yminP,ymaxQ) and keep it as the minimum.
- Rotate the lines clockwise until one of them coincides with an edge of its polygon.
- If only one line coincides with an edge, then the vertex-edge anti-podal pair distance should be computed along with the new vertex-vertex anti-podal pairA distance. Both distances are compared the current minimum, which is updated if necessary. If both lines of support coincide with edges, then the situation is somewhat more complex. If the edges "overlap", that is if one can construct a line perpendicular to both edges and intersecting both edges (but not at vertices), then the edge-edge distance should be computed. Otherwise the three new vertex-vertex anti-podal pair distances are computed. All distances are compared to the current minimum which is updated if necessary.
- Repeat steps 4 and 5, until the lines reach (yminP, ymaxQ) again.
- Output the minimum distance.
The Rotating Calipers paradigm ensures all possible anti-podal pairs (and all possible subcases) are considered. Furthermore, the whole algorithm has linear time complexity, since (besides the initialization), there are only as many steps as there are vertices.
The maximum and minimum distance problems show that the Rotating Calipers paradigm can be used in different ways (compared to the previous problems of diameter and width). The paradigm can be applied to a two polygon case.
The smallest-box problem (minimum area enclosing rectangle) shows yet another way of using the Rotating Calipers, by using two sets of orthogonal lines of support on the same polygon.
- The minimum distance between two convex polygons---两个凸包之间的最短距离---旋转卡壳法
- POJ 3608 Bridge Across Islands(旋转卡壳 求不相交凸包之间的最短距离)
- poj 3608(旋转卡壳求解两凸包之间的最短距离)
- 旋转卡壳求凸包间的最短距离 POJ 3608
- POJ 3608 旋转卡壳求解凸包间的最短距离
- poj3608(旋转卡壳求两凸包间的最短距离)
- 旋转卡壳--凸包之间的最大距离
- 两个单词之间的最短距离
- 豪斯多夫距离-- Hausdorff distance of convex polygons
- 旋转卡壳--凸包的直径
- 旋转卡壳---凸包的宽度
- poj 3608 Bridge Across Islands 旋转卡壳(两个凸包的最近距离)
- Find the distance between two nodes
- Floyd算法,求图中两个点之间的最短距离
- 两个面之间的最短距离算法(记录)
- 凸包与旋转卡壳
- 凸包,旋转卡壳模板
- bzoj1069 凸包+旋转卡壳
- Ruby中的map, reduce, select, reject, group_by理解
- FZU 1402 猪的安家 中国剩余定理
- LCD和LCD控制器
- SQL Server 2008 数据库同步 (发布、订阅)
- 遍历List<String[]>并 转换为String[][],List<List<String>>,Map<String,String[]> .
- The minimum distance between two convex polygons---两个凸包之间的最短距离---旋转卡壳法
- 新手进阶,关于字符串和boolalpha的问题
- Android 开发TCP、UdP客户端
- 软键盘弹出,listview上移并滚动到最后的解决方法
- VS.2010.C#.LINQ 学习(三)-not in、排序、分页
- Openstack常见报错及解决方法<一>
- 15.log4j.properties例子:log4j.appender.file.ImmediateFlush
- continue 和break语句的区别
- js中escape,encodeURI,encodeURIComponent三个函数的区别