Publication:4698690
From MaRDI portal
zbMath0817.68127MaRDI QIDQ4698690
Paul J. Heffernan, Giri Narasimhan, Gautam K. Das
Publication date: 11 May 1995
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Optimally computing a shortest weakly visible line segment inside a simple polygon, On hamiltonian triangulations in simple polygons (Extended Abstract), Finding the shortest boundary guard of a simple polygon, Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains, Guarding in a simple polygon, A constant-factor approximation algorithm for vertex guarding a WV-polygon