Approximation algorithms for lawn mowing and milling
From MaRDI portal
Publication:1841242
DOI10.1016/S0925-7721(00)00015-8zbMath0968.68164MaRDI QIDQ1841242
Sándor P. Fekete, Esther M. Arkin, Joseph S. B. Mitchell
Publication date: 22 February 2001
Published in: Computational Geometry (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Off-line exploration of rectangular cellular environments with a rectangular obstacle, An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem, On optimal coverage of a tree with multiple robots, An information roadmap method for robotic sensor path planning, A local strategy for cleaning expanding cellular domains by simple robots, Optimality and competitiveness of exploring polygons by mobile robots, SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition, Watchman tours for polygons with holes, The single robot line coverage problem: Theory, algorithms, and experiments, On-line exploration of rectangular cellular environments with a rectangular hole, Minimum covering with travel cost, Multivehicle coverage control for a nonstationary spatiotemporal field, Not being (super)thin or solid is hard: A study of grid Hamiltonicity, The snowblower problem, Communication and location discovery in geometric ring networks, AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS, COMPETITIVE COMPLEXITY OF MOBILE ROBOT ON-LINE MOTION PLANNING PROBLEMS, Capacitated arc routing problem with deadheading demands, Persistent coverage control for a team of agents with collision avoidance, TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING, Universal hinge patterns for folding strips efficiently into any grid polyhedron, Adaptive Action for Multi-Agent Persistent Coverage, A framework for multi-robot node coverage in sensor networks, An Improved Strategy for Exploring a Grid Polygon, Polygon exploration with time-discrete vision, Competitive on-line coverage of grid environments by a mobile robot
Cites Work
- Triangulating a simple polygon in linear time
- Watchman routes under limited visibility
- On the computational geometry of pocket machining
- Approximation algorithms for the Geometric Covering Salesman Problem
- Approximate minimum weight matching on points in k-dimensional space
- Optimization problems related to zigzag pocket machining
- Angle-restricted tours in the plane.
- Traveling the boundary of Minkowski sums.
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
