Guarding Exterior Region of a Simple Polygon

DOI10.1007/978-3-540-77891-2_10MaRDI QIDQ5452157zbMATH OpenOpenAlexFDO

Authors Arindam Karmakar, Sasanka Roy, Sandip Das

Publication date 25 March 2008

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77891-2_10

Mathematics Subject Classification ID

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

Recommendations

• Finding the shortest boundary guard of a simple polygon
• Guard placement for maximizing L-visibility exterior to a convex polygon
• Optimal Guard Placement Problem Under L-Visibility
• Guarding in a simple polygon
• The prison yard problem

Cites work

• scientific article; zbMATH DE number 4065813 (Why is no real title available?)
• scientific article; zbMATH DE number 1391661 (Why is no real title available?)
• A combinatorial theorem in plane geometry
• A linear algorithm for finding the convex hull of a simple polygon
• Computing external farthest neighbors for a simple polygon
• Computing geodesic furthest neighbors in simple polygons
• Computing the external geodesic diameter of a simple polygon
• Edge guards for the fortress problem
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• The furthest-site geodesic Voronoi diagram

Cited in

(5)

• Guard placement for maximizing L-visibility exterior to a convex polygon
• Finding the \(\Theta \)-guarded region
• GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
• The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application
• Polygon guarding with orientation

This page was built for publication: Guarding Exterior Region of a Simple Polygon

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