Fast algorithms for computing the diameter of a finite planar set |
| |
Authors: | Binay K Bhattacharya Godfried T Toussaint |
| |
Affiliation: | (1) School of Computing Science, Simon Fraser University, V5A1S6 Burnaby, B.C., Canada;(2) School of Computer Science, McGill University, H3A2K6 Montreal, Quebec, Canada |
| |
Abstract: | Three algorithms for computing the diameter of a finite planar set are proposed. Although all three algorithms have (O(n
2) worst-case running time, an expected-complexity analysis shows that, under reasonable probabilistic assumptions, all three algorithms have linear expected running time. Experimental results indicate that two of these algorithms perform very well for some distributions, and are competitive with an existing method. Finally, we exhibit situations where these exact algorithms out-perform a published approximate algorithm.Research of the first author was supported by grant NSERC A 2422. Research of the second author was supported by grants NSERC A 9293, FCAC EQ-1678 and a Killam Senior Research Fellowship awarded by the Canada Council |
| |
Keywords: | Diameter Expected complexity Monte Carlo simulation Approximate algorithm |
本文献已被 SpringerLink 等数据库收录! |
|