Guarding Exterior Region of a Simple Polygon

DOI10.1007/978-3-540-77891-2_10zbMath1132.68793OpenAlexW2121166541MaRDI QIDQ5452157

Arindam Karmakar, Sandip Das, Sasanka Roy

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)

Related Items

The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the external geodesic diameter of a simple polygon
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• A linear algorithm for finding the convex hull of a simple polygon
• Computing external farthest neighbors for a simple polygon
• The furthest-site geodesic Voronoi diagram
• A combinatorial theorem in plane geometry
• Edge guards for the fortress problem
• Computing geodesic furthest neighbors in simple polygons