scientific article; zbMATH DE number 426139

zbMATH Open0801.68157MaRDI QIDQ3136961FDOQ3136961

Authors: Rocky Lombardo, Laxmi P. Gewali 

Publication date: 1 November 1993

Title of this publication is not available (Why is that?)

Recommendations

• Watchman routes in the presence of a pair of convex polygons
• Optimum watchman routes
• Shortest watchman routes in simple polygons
• Theory and Applications of Models of Computation
• Finding the shortest watchman route in a simple polygon

zbMATH Keywords

computational geometryconvex polygonsart gallery problemoptimum watchman route

Mathematics Subject Classification ID

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

Cited In (3)

• On Romeo and Juliet problems: minimizing distance-to-sight
• Watchman routes in the presence of a pair of convex polygons
• Watchman routes for lines and line segments

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 Q3136961)