摘要
为了准确拾取区域覆盖情况下的图形,逐步分析并给出了决定图形拾取与否的三个条件:拾取点是否落在图形的可拾取区域内、拾取点到图形的最短距离是否为最小、拾取点所在的图形的拾取区域面积是否最小。通过对这三个条件的依次判断,提出一种将最短距离与面积结合的方式来实现区域覆盖情况下的图形拾取算法,高效而快捷地实现了图形的拾取。
In order to pick up graph of region overlay well and truly, three conditions are analyzed and provided namely position of the picking point, the nearest distance to the graph, and the area of picking region. according to these conditions combining the nearest distance and area, an efficient algorithm for picking up graph of region overlay is put forward.
出处
《微计算机应用》
2004年第5期586-589,共4页
Microcomputer Applications
