Efficiently finding bitangents
暂无分享,去创建一个
We propose a new algorithm for the detection of bitangents in planar curves. It is much faster than an algorithm used by Rothwell et al. (1995). Careful comparisons of the stability of detection using artificially transformed curves show that the new algorithm is as stable as the one proposed by Rothwell et al. An example for the use of the algorithm for object search is given.
[1] Yehezkel Lamdan,et al. Object recognition by affine invariant matching , 2011, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.