On Covering Points with Minimum Turns
From MaRDI portal
Publication:5892218
DOI10.1142/s0218195915500016zbMath1341.68294OpenAlexW163861208MaRDI QIDQ5892218
Publication date: 9 October 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/869c02c08c8c918ee9b9e8397ae75df9e93e19a7
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Cites Work
- Improved lower bounds for the link length of rectilinear spanning paths in grids
- A parameterized algorithm for the hyperplane-cover problem
- Minimum-link watchman tours
- Approximation algorithms for hitting objects with straight lines
- On the complexity of locating linear facilities in the plane
- Covering paths for planar point sets
- Angle-restricted tours in the plane.
- Covering things with things
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS
- Hamilton Paths in Grid Graphs
- COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
- The Angular-Metric Traveling Salesman Problem
- Optimal Covering Tours with Turn Costs
- Traversing a set of points with a minimum number of turns