Open Access
MATEC Web Conf.
Volume 232, 2018
2018 2nd International Conference on Electronic Information Technology and Computer Engineering (EITCE 2018)
Article Number 03027
Number of page(s) 6
Section Algorithm Study and Mathematical Application
Published online 19 November 2018
  1. K. Tang and A. Pang. Optimal connection of loops in laminated object manufacturing, Computer-Aided Design, 2003(35): 1011-1022. [CrossRef] [Google Scholar]
  2. Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: Proceedings of the STOC 2003, pp. 473–482 (2003) [Google Scholar]
  3. Fellows M, Tan X, Zhu B. Frontiers in Algorithmics and Algorithmic Aspects in Information and Management: Third Joint International Conference, FAW-AAIM 2013, Dalian, China. Computer Science and General Issues)[M]. Springer Publishing Company, Incorporated, 2013. [Google Scholar]
  4. Chou S Y, Chou C C, Chen Y K. A base function for generating contour traversal paths in stereolithography apparatus applications[J]. Expert Systems with Applications, 2008, 35(1–2):235-244. [CrossRef] [Google Scholar]
  5. Chou C C. An efficient algorithm for relay placement in a ring sensor networks[M]. Pergamon Press, Inc. 2010. [Google Scholar]
  6. Chou C C. On the Shortest Path Touring n Circles[J]. International Journal of Advancements in Computing Technology, 2012, 4(10): 356-364. [Google Scholar]
  7. Tan X, Jiang B. An improved algorithm for computing a shortest watchman route for lines[J]. Information Processing Letters, 2018, 131:51-54. [CrossRef] [Google Scholar]
  8. Tan X, Jiang B. The Touring Polygons Problem Revisited[J]. Ieice Transactions on Fundamentals of Electronics Communications & Computer Sciences, 2018, 101. [Google Scholar]
  9. Tan X, Jiang B. Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems[C]// International Conference on Theory and Applications of Models of Computation. Springer, Cham, 2017:614-627. [Google Scholar]
  10. Ahadi A, Mozafari A, Zarei A. Touring a sequence of disjoint polygons: Complexity and extension[J]. Theoretical Computer Science, 2014, 556:45-54. [CrossRef] [Google Scholar]
  11. Liu, T. L., Chuang, H. Z., & Wang, W. H. Shortest circumferential inscribed convex n-gon inside a convex n-gon. Research papers from Senior High School version, 29th Taiwan National Primary and High School Science Fair (in Chinese), 1989. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.