Polynomial-time algorithms for the touring rays and related problems

DOI10.1007/978-3-030-57602-8_1zbMath1482.68258OpenAlexW3047727575MaRDI QIDQ2039639

Xue-Hou Tan

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

The touring rays and related problems

Cites Work

• Optimum watchman routes
• The traveling salesmanpProblem for lines in the plane
• Fast computation of shortest watchman routes in simple polygons
• Minimum-perimeter intersecting polygons
• Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
• Touring a sequence of polygons
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial-time algorithms for the touring rays and related problems