scientific article
From MaRDI portal
Publication:3787487
zbMath0644.68068MaRDI QIDQ3787487
Jörg-Rüdiger Sack, Subhash Suri
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04)
Related Items (6)
An O(n log n) algorithm for computing a link center in a simple polygon ⋮ Three dimensional weak visibility: Complexity and applications ⋮ Some chain visibility problems in a simple polygon ⋮ Characterizing and recognizing weak visibility polygons ⋮ Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains ⋮ A constant-factor approximation algorithm for vertex guarding a WV-polygon
This page was built for publication:
