EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS
From MaRDI portal
Publication:3007721
DOI10.1142/S0218195911003524zbMath1218.65025MaRDI QIDQ3007721
Publication date: 17 June 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
computational geometryNP-hardnesslinear-time algorithmsdata imprecisiontours through imprecise points
Related Items
Minimum-link \(C\)-oriented paths visiting a sequence of regions in the plane ⋮ Non-crossing Paths with Geographic Constraints
Cites Work
- Robustness of numerical methods in geometric computation when problem data is uncertain
- On the complexity of approximating TSP with neighborhoods and related problems
- Finding shortest safari routes in simple polygons
- Watchman routes under limited visibility
- Constructing strongly convex hulls using exact or rounded arithmetic
- Foundation of a computable solid modelling.
- Constructing strongly convex approximate hulls with inaccurate primitives
- Euclidean shortest paths in the presence of rectilinear barriers
- Planar Formulae and Their Uses
- TSP with neighborhoods of varying size