Covering paths for planar point sets

DOI10.1007/978-3-642-36763-2_27MaRDI QIDQ4912212zbMATH OpenOpenAlexFDO

Authors Adrian Dumitrescu, Csaba D. Tóth

Publication date 3 April 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36763-2_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Covering paths for planar point sets
• Covering paths and trees for planar grids
• On Covering Points with Minimum Turns
• scientific article; zbMATH DE number 2145233
• COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS

Cited in

(6)

• Covering paths for planar point sets
• Covering a set of points with a minimum number of turns
• Embedding Four-directional Paths on Convex Point Sets
• Covering paths and trees for planar grids
• Improved bounds for covering paths and trees in the plane
• Improved bounds for covering paths and trees in the plane

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

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