首页 | 本学科首页   官方微博 | 高级检索  
     


An O(N) algorithm for polygonal approximation
Authors:L.P Cordella  G Dettori
Affiliation:Dipartimento di Informatica e Sistemistica, Università di Napoli, Napoli, Italy;Instituto per la Matematica Applicata del C.N.R., Genova, Italy
Abstract:
A new, sequential algorithm for polygonal approximation of plane, closed curves is presented. It runs in O(N) time and is based on a tolerance independent of the scale factor.
Keywords:Polygonal approximation  tolerance criteria  computational complexity  scan-along algorithms  area and shape preservation
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号