Approximation algorithms for lawn mowing and milling

Redirect to:

• Approximation algorithms for lawn mowing and milling

DOI10.1016/S0925-7721(00)00015-8MaRDI QIDQ1841242zbMATH OpenFDO

Authors Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell

Publication date 22 February 2001

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0925-7721(00)00015-8

zbMATH Keywords

milling problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimal Covering Tours with Turn Costs
• Optimal covering tours with turn costs
• APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING
• Approximation algorithms for TSP with neighborhoods in the plane
• Approximation algorithms for TSP with neighborhoods in the plane

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1256695 (Why is no real title available?)
• scientific article; zbMATH DE number 1306896 (Why is no real title available?)
• scientific article; zbMATH DE number 1163704 (Why is no real title available?)
• scientific article; zbMATH DE number 1555918 (Why is no real title available?)
• scientific article; zbMATH DE number 1775442 (Why is no real title available?)
• scientific article; zbMATH DE number 871938 (Why is no real title available?)
• scientific article; zbMATH DE number 3895002 (Why is no real title available?)
• Angle-restricted tours in the plane.
• Approximate minimum weight matching on points in k-dimensional space
• Approximation algorithms for the Geometric Covering Salesman Problem
• Finding the medial axis of a simple polygon in linear time
• Geometry Helps in Matching
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Hamilton Paths in Grid Graphs
• On the computational geometry of pocket machining
• Optimal covering tours with turn costs
• Optimization problems related to zigzag pocket machining
• Traveling the boundary of Minkowski sums.
• Triangulating a simple polygon in linear time
• Watchman routes under limited visibility

Cited in

(36)

• Communication and location discovery in geometric ring networks
• Optimal covering tours with turn costs
• TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING
• Optimal Covering Tours with Turn Costs
• An improved strategy for exploring a grid polygon
• Competitive on-line coverage of grid environments by a mobile robot
• scientific article; zbMATH DE number 1555918 (Why is no real title available?)
• Watchman tours for polygons with holes
• Minimum covering with travel cost
• The single robot line coverage problem: Theory, algorithms, and experiments
• Adaptive action for multi-agent persistent coverage
• Multivehicle coverage control for a nonstationary spatiotemporal field
• A local strategy for cleaning expanding cellular domains by simple robots
• An information roadmap method for robotic sensor path planning
• Optimality and competitiveness of exploring polygons by mobile robots
• Experimental evaluation of algorithms for the orthogonal milling problem with turn costs
• SFCDecomp: multicriteria optimized tool path planning in 3D printing using space-filling curve based domain decomposition
• Polygon exploration with time-discrete vision
• A framework for multi-robot node coverage in sensor networks
• An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
• On-line exploration of rectangular cellular environments with a rectangular hole
• What goes around comes around: covering tours and cycle covers with turn costs
• APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING
• On optimal coverage of a tree with multiple robots
• Competitive complexity of mobile robot on-line motion planning problems
• The snowblower problem
• The snowblower problem
• The maximum scatter TSP on a regular grid
• Off-line exploration of rectangular cellular environments with a rectangular obstacle
• An approximation algorithm for locating maximal disks within convex polygons
• Covering segments on a line with drones
• Milling a graph with turn costs: a parameterized complexity perspective
• Persistent coverage control for a team of agents with collision avoidance
• Capacitated arc routing problem with deadheading demands
• Not being (super)thin or solid is hard: A study of grid Hamiltonicity
• A closer cut: computing near-optimal lawn mowing tours

This page was built for publication: Approximation algorithms for lawn mowing and milling

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