%0 Journal Article
%T Simple Polygon Distance Algorithm Based on Monotone Chains<br>基于单调链的简单多边形距离算法
%A ZHOU Zhi-ping
%A WU Jieyi
%A ZHANG Sa-bing
%A ZHANG Shao-bo
%A <br>周之平
%A 吴介一
%A 张飒兵
%A 张少博
%J 计算机应用研究
%D 2007
%I 
%X The distance problem between simple polygons is a nut in computer graphics.A simple polygon distance algorithm based on monotone chains is proposed in this paper for calculating the distance efficiently.It comprises three procedures.Firstly,the simple polygons are decomposed into a collection of monotone chains concerning coordinate axis.Then,the candidate chain-pairs are determined by the visibility rule.Eventually,it computes the distances for all candidate chainpairs using both hierarchy-tree theory and branch-limit strategy in order to solute the minimum distance problem for simple polygons.Experimental results indicate that this approach performs better than other counterparts.
%K Simple Polygons
%K Monotone Chains
%K Hierarchytree
%K Axis-Aligned Bounding Box
%K Visibility<br>简单多边形
%K 单调链
%K 层次树
%K AABB
%K 包围盒
%K 可见性
%K 单调链
%K 简单多边形
%K 距离算法
%K Chains
%K Monotone
%K Based
%K Algorithm
%K Distance
%K Polygon
%K 算法性能
%K 结果
%K 试验
%K 求解
%K 计算机
%K 策略
%K 分支限界
%K 理论
%K 层次树
%K 结合
%K 原则
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=343459AF1736CA69609E17EB7B417406&yid=A732AF04DDA03BB3&vid=B91E8C6D6FE990DB&iid=CA4FD0336C81A37A&sid=58F693790F887B3B&eid=12DC19455C3A2FA8&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=4