Angle-restricted tours in the plane.
From MaRDI portal
Publication:2482907
DOI10.1016/S0925-7721(96)00012-0zbMATH Open1133.90385MaRDI QIDQ2482907FDOQ2482907
Authors: Sándor P. Fekete, Gerhard J. Woeginger 
Publication date: 25 April 2008
Published in: Computational Geometry (Search for Journal in Brave)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamilton Paths in Grid Graphs
- Title not available (Why is that?)
- Shortest paths of bounded curvature in the plane
- Title not available (Why is that?)
- The Angular-Metric Traveling Salesman Problem
- Title not available (Why is that?)
- Nonholonomic multibody mobile robots: controllability and motion planning in the presence of obstacles
- On Some Distance Problems in Fixed Orientations
- Title not available (Why is that?)
- On the convex layers of a planar set
- Optimal computation of finitely oriented convex hulls
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Traveling salesman cycles are not always subgraphs of Delaunay triangulations or of minimum weight triangulations
- A non-Hamiltonian, nondegenerate Delaunay triangulation
- Title not available (Why is that?)
- Minimum-time turn trajectories to fly-to points
Cited In (17)
- Peeling meshed potatoes
- SFCDecomp: Multicriteria Optimized Tool Path Planning in 3D Printing using Space-Filling Curve Based Domain Decomposition
- Going around in circles
- Drawing Hamiltonian cycles with no large angles
- Infinite paths with no small angles
- Bounded-angle minimum spanning trees
- Minimum Scan Cover with Angular Transition Costs
- Approximation algorithms for lawn mowing and milling
- On Covering Points with Minimum Turns
- On the approximability of covering points by lines and related problems
- Traversing a set of points with a minimum number of turns
- Paths with no Small Angles
- Title not available (Why is that?)
- Bounded-angle spanning tree: modeling networks with angular constraints
- Connectivity guarantees for wireless networks with directional antennas
- Connected Rectilinear Graphs on Point Sets
- Minimization and maximization versions of the quadratic travelling salesman problem
This page was built for publication: Angle-restricted tours in the plane.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482907)
