A linear time algorithm for minimum conic link path in a simple polygon

作者：

Highlights：

• The studied problem is the generalization of the well-known straight line version.

• A linear time algorithm for the problem is proposed.

• The result has inherently broadened applications than that of its degenerate case.

• Practitioners in the fields of computational geometry may find merits herein.

摘要

•The studied problem is the generalization of the well-known straight line version.•A linear time algorithm for the problem is proposed.•The result has inherently broadened applications than that of its degenerate case.•Practitioners in the fields of computational geometry may find merits herein.

论文关键词：Path planning,Conic link path,Conic visibility,Circular visibility,Splinegon,Computational geometry

论文评审过程：Received 16 June 2014, Revised 21 September 2015, Accepted 22 September 2015, Available online 9 October 2015, Version of Record 10 November 2015.

论文官网地址：https://doi.org/10.1016/j.eswa.2015.09.034