Covering paths for planar point sets

DOI10.1007/s00454-013-9563-4zbMath1294.05102arXiv1303.0262OpenAlexW2569145132MaRDI QIDQ2250054

Dániel Gerbner, Adrian Dumitrescu, Balázs Keszegh, Csaba D. Tóth

Publication date: 4 July 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.0262

zbMATH Keywords

noncrossing graphcovering treecovering path

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (3)

Piercing the Chessboard ⋮ Rainbow polygons for colored point sets in the plane ⋮ On Covering Points with Minimum Turns

Cites Work

• Improved lower bounds for the link length of rectilinear spanning paths in grids
• Minimum-link watchman tours
• On-line construction of the convex hull of a simple polyline
• Triangulating a simple polygon in linear time
• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
• On polygons excluding point sets
• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
• On Covering Points with Minimum Turns
• Traversing a set of points with a minimum number of turns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering paths for planar point sets