On representing a simple polygon perceivable to a blind person

详细信息    查看全文

• 作者：Sandip Banerjee<sup>asup><sup> ; sup><sup>sandip.ndp@gmail.comsup> ; Bhargab B. Bhattacharya<sup>asup> ; Binay Bhattacharya<sup>bsup> ; Arindam Biswas<sup>csup> ; Sandip Das<sup>asup> ; Ritankar Mandal<sup>dsup> ; Sasanka Roy<sup>asup>
• 关键词：Simple polygon ; Triangulation ; Visual perception ; Computational geometry
• 刊名：Information Processing Letters
• 出版年：2017
• 出版时间：April 2017
• 年：2017
• 卷：120
• 期：Complete
• 页码：1-5
• 全文大小：301 K
• 卷排序：120

文摘

Given a polygon P(V,E)P(V,E), our objective is to insert a smallest set (V∪V′)(V∪V′) of vertices on the edges of P such that P can be uniquely reconstructed from the unordered set of vertices. The maximum number of extra vertices is determined by |V||V| and certain geometric parameters of P. A non-trivial lower bound on the required number of pseudo-vertices is an interesting problem to solve.