A Fast Algorithm for Closest-Pair Problem
碩士 === 淡江大學 === 資訊工程研究所 === 83 === The closest-pair problem is to find a pair of closest poi- nts among a set of points in the plane. Intuitively , it would seem necessary to examine the distances between all pairs of points to find the s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1995
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/02957667637506879880 |