Polynomial-time algorithms for the touring rays and related problems

DOI10.1007/978-3-030-57602-8_1MaRDI QIDQ2039639zbMATH OpenOpenAlexFDO

Authors Xuehou 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

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

Recommendations

• The touring rays and related problems
• Touring a sequence of polygons
• The traveling salesmanpProblem for lines in the plane
• Efficient algorithms for touring a sequence of convex polygons and related problems
• The traveling salesman problem for lines and rays in the plane

Cites work

• Efficient algorithms for touring a sequence of convex polygons and related problems
• Fast computation of shortest watchman routes in simple polygons
• scientific article; zbMATH DE number 432849 (Why is no real title available?)
• scientific article; zbMATH DE number 465669 (Why is no real title available?)
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• MINIMUM POLYGON TRANSVERSALS OF LINE SEGMENTS
• Minimum-perimeter intersecting polygons
• Optimum watchman routes
• The traveling salesman problem for lines and rays in the plane
• The traveling salesmanpProblem for lines in the plane
• Touring a sequence of polygons

Cited in

(2)

• The touring rays and related problems
• Touring a sequence of disjoint polygons: complexity and extension

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2039639)