On Covering Points with Minimum Turns

DOI10.1142/S0218195915500016MaRDI QIDQ5892218zbMATH OpenOpenAlexFDO

Authors Minghui Jiang

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

zbMATH Keywords

computational complexitycomputational geometry

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On covering points with minimum turns
• Covering a set of points with a minimum number of turns
• Covering points with convex sets of minimum size
• Covering Points with Convex Sets of Minimum Size
• Covering a Set of Points with a Minimum Number of Lines
• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
• Minimum ply covering of points with unit squares
• Minimum ply covering of points with disks and squares
• Traversing a set of points with a minimum number of turns
• Traversing a set of points with a minimum number of turns

Cites work

• A parameterized algorithm for the hyperplane-cover problem
• Angle-restricted tours in the plane.
• Approximation algorithms for hitting objects with straight lines
• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
• Covering paths for planar point sets
• Covering things with things
• FPT-algorithms for minimum-bends tours
• Hamilton Paths in Grid Graphs
• Improved lower bounds for the link length of rectilinear spanning paths in grids
• Minimum-link watchman tours
• On the complexity of locating linear facilities in the plane
• Optimal Covering Tours with Turn Costs
• The Angular-Metric Traveling Salesman Problem
• Traversing a set of points with a minimum number of turns

Cited in

(11)

• Covering Points with Convex Sets of Minimum Size
• Covering a set of points with a minimum number of turns
• scientific article; zbMATH DE number 4110701 (Why is no real title available?)
• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
• Covering paths for planar point sets
• Optimal Covering Tours with Turn Costs
• On covering points with minimum turns
• Traversing a set of points with a minimum number of turns
• Traversing a set of points with a minimum number of turns
• An improved bound for plane covering paths
• On the approximability of covering points by lines and related problems

This page was built for publication: On Covering Points with Minimum Turns

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