Optimization algorithms for sweeping a polygonal region with mobile guards

DOI10.1007/3-540-45678-3_41MaRDI QIDQ4474115zbMATH OpenFDO

Authors Sang-Min Park, Kyung-Yong Chwa, Jae-Ha Lee

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230480.htm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimum sweeps of simple polygons with two guards
• Optimum sweeps of simple polygons with two guards
• scientific article; zbMATH DE number 1445396
• Searching a Polygonal Region by Two Guards
• Minimization of the maximum distance between the two guards patrolling a polygonal region

Cited in

(8)

• Optimum sweeps of simple polygons with two guards
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Minimization of the maximum distance between the two guards patrolling a polygonal region
• Optimum sweeps of simple polygons with two guards
• scientific article; zbMATH DE number 1208727 (Why is no real title available?)
• scientific article; zbMATH DE number 1445396 (Why is no real title available?)
• Finding the shortest boundary guard of a simple polygon
• Sweeping simple polygons with the minimum number of chain guards

This page was built for publication: Optimization algorithms for sweeping a polygonal region with mobile guards

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