Context-free grammars to detect straight segments and a novel polygonal approximation method
作者：
Highlights：
• Break points through a context-free grammar in contour shapes are obtained.
• An elimination of break points through an imposition of tolerable error is achieved.
• Through an inspection of the updated breakpoints vicinity, a base-graph problem is modeled.
• Computing the Dijkstra algorithm in the graphical problem allows obtaining the final dominant points.
• Digital straight segments without pixel loss is also computed.
摘要
•Break points through a context-free grammar in contour shapes are obtained.•An elimination of break points through an imposition of tolerable error is achieved.•Through an inspection of the updated breakpoints vicinity, a base-graph problem is modeled.•Computing the Dijkstra algorithm in the graphical problem allows obtaining the final dominant points.•Digital straight segments without pixel loss is also computed.
论文关键词：Break points,Dominant points,Shortest path,Digital straight segments,Lost pixels,Tolerable error
论文评审过程：Received 25 May 2020, Revised 26 September 2020, Accepted 22 November 2020, Available online 26 November 2020, Version of Record 2 December 2020.
论文官网地址：https://doi.org/10.1016/j.image.2020.116080
