scientific article; zbMATH DE number 140088

MaRDI QIDQ4028463zbMATHFDO

Authors Laxmi P. Gewali

Publication date 28 March 1993

zbMATH Keywords

\(s-t\)-monotone visit problem

Mathematics Subject Classification ID

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

Recommendations

• Computing simple paths among obstacles
• Rectilinear paths among rectilinear obstacles
• Euclidean shortest path in the presence of obstacles
• Touring a sequence of polygons
• Shortest paths in the plane with convex polygonal obstacles

Cited in

(2)

• Computing shortest heterochromatic monotone routes
• How to navigate through obstacles?

This page was built for publication:

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